SRM 411 · 2008-07-24 · by hken
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | SentenceDecomposition | Dynamic Programming, String Manipulation | 82.00% | 232 |
| 500 | HoleCakeCuts | Geometry, Simple Math | 58.00% | 254 |
| 1000 | MinimumTours | Graph Theory, Search | 0.00% | 158 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MaximumScoredNumber | Simple Search, Iteration | 66.00% | 147 |
| 500 | SentenceDecomposition | Dynamic Programming, String Manipulation | 42.00% | 232 |
| 1000 | HoleCakeCuts | Geometry, Simple Math | 22.00% | 254 |
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.
A division runs one field at a time and starts on the quarter hour, so entering puts you in the next slot — at most fifteen minutes away — alongside everyone else who signs up before the gun.
Sign in to enter a virtual contest.