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