Pegman solutions
Pegman was solved using OCaml by 5 contestants. Solution sizes: average 1800 bytes (shortest: 1111; longest: 2732).
63. ![]() 417. ![]() 1083. ![]() 1289. ![]() 1337. ![]() |
Pegman was solved using OCaml by 5 contestants. Solution sizes: average 1800 bytes (shortest: 1111; longest: 2732).
63. ![]() 417. ![]() 1083. ![]() 1289. ![]() 1337. ![]() |