Cheating a Boolean Tree solutions
Cheating a Boolean Tree was solved using OCaml by 2 contestants. Solution sizes: average 2922 bytes (shortest: 1494; longest: 4350).
231.  aleksey (S, L) (1494 B)1069. Kirill.Ignatiev (S, L) (4350 B) |
Cheating a Boolean Tree was solved using OCaml by 2 contestants. Solution sizes: average 2922 bytes (shortest: 1494; longest: 4350).
| 231. aleksey (S, L) (1494 B) 1069. Kirill.Ignatiev (S, L) (4350 B) |