SRM 301 · 2006-05-09 · by soul-net
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | IndicatorMotionReverse | Greedy, Simulation | 61.00% | 167 |
| 500 | EscapingJail | Dynamic Programming, Graph Theory | 76.00% | 97 |
| 1000 | ContextFreeGrammars | Dynamic Programming, Recursion, Simulation, String Parsing | 19.00% | 0 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | InsertionSortCount | Simple Search, Iteration, Sorting | 81.00% | 90 |
| 500 | IndicatorMotionReverse | Greedy, Simulation | 16.00% | 167 |
| 1000 | CorrectingParenthesization | Dynamic Programming, Recursion, String Manipulation | 2.00% | 122 |
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.