SRM 316 · 2006-08-19 · by _efer_
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | InboxCleanup | Greedy, Simple Search, Iteration | 64.00% | 115 |
| 500 | PlacingPieces | Dynamic Programming, Search | 18.00% | 137 |
| 1000 | RoboRace | Dynamic Programming, Graph Theory, Search | 59.00% | 102 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | HiddenMessage | Simple Search, Iteration, String Parsing | 91.00% | 39 |
| 500 | InboxCleanup | Greedy, Simple Search, Iteration | 45.00% | 115 |
| 1000 | SpreadingNews | Graph Theory, Greedy, Recursion | 56.00% | 80 |
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.