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

Language Details: AWK

Skip to: Contestants · Problems solved · Represented countries.

AWK uses a data-driven scripting language consisting of a set of actions to be taken against textual data (either in files or data streams) for the purpose of producing formatted reports.

— AWK article on Wikipedia

Problems solved

Qualification Round (22 solutions by 7 contestants):

• Tic-Tac-Toe-Tomek: 3 small solutions, 3 large solutions.
• Lawnmower: 5 small solutions, 4 large solutions.
• Fair and Square: 3 small solutions, 2 large-1 solutions.
• Treasure: 1 small solution, 1 large solution.

Round 1A (3 solutions by 2 contestants):

• Bullseye: 2 small solutions.
• Good Luck: 1 small solution.

Round 1B (2 solutions by 2 contestants):

• Osmos: 1 small solution.
• Falling Diamonds: 1 small solution.

Submission Origin