SRM 382 · 2007-12-11 · by andrewzta, dkorduban
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | CollectingRiders | Graph Theory | 72.00% | 85 |
| 500 | PointsOnACircle | Greedy, Search, Sorting | 24.00% | 135 |
| 1000 | CharmingTickets | Dynamic Programming, Math | 72.00% | 93 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | ContiguousSubsequences | Simple Search, Iteration | 61.00% | 111 |
| 500 | CollectingRiders | Graph Theory | 56.00% | 85 |
| 1000 | CharmingTicketsEasy | Dynamic Programming | 20.00% | 59 |
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.