SRM 560 · 2012-06-05 · by meret
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TomekPhone | Greedy, Sorting | 95.00% | 125 |
| 500 | DrawingPointsDivOne | Simple Search, Iteration | 42.00% | 136 |
| 1000 | BoundedOptimization | Brute Force, Dynamic Programming, Graph Theory, Math | 0.00% | 137 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TypingDistance | Simulation | 98.00% | 55 |
| 500 | TomekPhone | Greedy, Sorting | 84.00% | 125 |
| 1000 | DrawingPointsDivTwo | Simple Search, Iteration | 13.00% | 117 |
Virtual Contest
Rerun this round against its original field. TopCoder scoring, 75-minute coding phase, and the real competitors replayed as ghosts on the scoreboard.
Sign in to enter a virtual contest.