Ominous Omino solutions
Ominous Omino was solved using Lisp by 6 contestants. Solution sizes: average 961 bytes (shortest: 339; longest: 2385).
1225. ![]() 1316. ![]() 2472. ![]() 10539. ![]() 10569. ![]() |
11795. ![]() |
Ominous Omino was solved using Lisp by 6 contestants. Solution sizes: average 961 bytes (shortest: 339; longest: 2385).
1225. ![]() 1316. ![]() 2472. ![]() 10539. ![]() 10569. ![]() |
11795. ![]() |