• 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 Fortran by 2 contestants. Solution sizes: average 1703 bytes (shortest: 1112; longest: 2299).

8758. Amsyk (S, L) (2299 B) 10184. dundjoh (S, L) (1112 B)