• 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 OCaml by 2 contestants. Solution sizes: average 1325 bytes (shortest: 894; longest: 1784).

399. aleksey (S, L) (1224 B) 525. xsd (S, L) (894 B)