SRM 210 · 2004-09-01 · by the_one_smiley
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | IPConverter | Recursion, Search, Sorting | 71 | |
| 500 | HierarchicalTree | Graph Theory, Recursion, Sorting, String Parsing | 78 | |
| 1000 | NegativePhotoresist | Graph Theory, Math, Search, String Parsing | 52 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TitleString | String Manipulation, String Parsing | 55 | |
| 500 | DrivingDirections | String Manipulation, String Parsing | 68 | |
| 1000 | TopographicalImage | Graph Theory, Recursion, Sorting | 43 |
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.