SRM 321 · 2006-10-02 · by Mike Mirzayanov
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | Chocolate | Simple Search, Iteration | 45.00% | 247 |
| 500 | WeirdSort | Sorting | 33.00% | 151 |
| 1000 | MergingGraph | Dynamic Programming, Graph Theory | 13.00% | 80 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | KDoubleSubstrings | String Manipulation | 86.00% | 60 |
| 500 | Chocolate | Simple Search, Iteration | 14.00% | 247 |
| 1000 | LexStringWriter | Dynamic Programming | 6.00% | 110 |
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.