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

Ominous Omino solutions

Ominous Omino was solved using Fortran by 2 contestants. Solution sizes: average 1299 bytes (shortest: 1208; longest: 1391).

6828. kurena (S) (1208 B) 11882. Dog (S) (1391 B)