• Code Jam 2009 ↓
  • Qualification Round
  • Round 1A
  • Round 1B
  • Round 1C
  • Round 2
  • Round 3
  • World Final
• Countries
• Languages
• Round 1A

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 solution size. You can also sort by ranking.

notogawa (S) (530 B) xyx (S) (657 B) falsifian (S) (692 B) sannysanoff (S) (743 B) Verum (S) (1070 B)

joee (S) (1137 B) jhpriestley (S) (1170 B) Yiding (S) (1667 B) Matthew.Maurer (S) (1681 B) alexbagel (S) (2166 B)

gglouser (S) (2505 B) yugr (S) (4064 B) shujin (S) (4649 B)