Ominous Omino solutions
Ominous Omino was solved using OCaml by 12 contestants. Solution sizes: average 920 bytes (shortest: 655; longest: 2593).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() |
Ominous Omino was solved using OCaml by 12 contestants. Solution sizes: average 920 bytes (shortest: 655; longest: 2593).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() |