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

Expensive Dinner solutions

Expensive Dinner was solved using OCaml by 3 contestants. Solution sizes: average 947 bytes (shortest: 717; longest: 1296).

142. aleksey (S, L) (889 B) 259. gnomnain (S) (1296 B) 994. xsd (S) (717 B)