Reordering Train Cars solutions
Reordering Train Cars was solved using Groovy by 2 contestants. Solution sizes: average 4934 bytes (shortest: 4118; longest: 6126).
375.  Loki... (S, L) (4118 B)3337. TheArchitect (S) (4559 B) |
Reordering Train Cars was solved using Groovy by 2 contestants. Solution sizes: average 4934 bytes (shortest: 4118; longest: 6126).
| 375. Loki... (S, L) (4118 B) 3337. TheArchitect (S) (4559 B) |