• 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 Groovy by 2 contestants. Solution sizes: average 1021 bytes (shortest: 933; longest: 1110).

759. Lite (S) (1110 B) 872. ziegfried (S) (933 B)