• 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 Haskell by 6 contestants. Solution sizes: average 1772 bytes (shortest: 699; longest: 3544).

125. strangecow (S, L) (699 B) 203. tos.lunar (S, L) (1622 B) 502. Xofon (S, L) (1167 B) 571. bodzaszorp (S, L) (3544 B) 675. fixme (S) (2478 B)

992. mrak (S) (1176 B)