Multi-base happiness solutions
Multi-base happiness was solved using Haskell by 13 contestants. Solution sizes: average 1748 bytes (shortest: 530; longest: 4649).
The list below is sorted by ranking. You can also sort by solution size.
320. ![]() 692. ![]() 711. ![]() 723. ![]() 769. ![]() |
805. ![]() 815. ![]() 888. ![]() 1155. ![]() 1156. ![]() |
1436. ![]() 1608. ![]() 1707. ![]() |