Spanning Planning solutions
Spanning Planning was solved using C++ by 12 contestants. Solution sizes: average 3683 bytes (shortest: 1304; longest: 6743).
The list below is sorted by ranking. You can also sort by solution size.
1.  Gennady.Korotkevich (2481 B)3. vepifanov (1304 B)4. SnapDragon (2573 B)6. apiapiapiad (2204 B)7. simonlindholm |
8. Zlobober (4255 B) 9. Endagorion (3744 B)14. rng..58 (1993 B)17. ifsmirnov (6743 B)19. LHiC (4624 B) |
21. Marcin.Smulewicz (5335 B) 22. Snuke (5262 B) |