Multi-base happiness solutions
Multi-base happiness was solved using Perl by 30 contestants. Solution sizes: average 1309 bytes (shortest: 612; longest: 2564).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
Multi-base happiness was solved using Perl by 30 contestants. Solution sizes: average 1309 bytes (shortest: 612; longest: 2564).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |