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

Candy Splitting solutions

Candy Splitting was solved using Erlang by 2 contestants. Solution sizes: average 1769 bytes (shortest: 895; longest: 3518).

8026. tohava (S, L) (895 B) 8458. metajack (S) (3518 B)