TCO04 Round 2 · 2004-09-07 · by schveiguy
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | SchoolAssembly | Brute Force, Greedy | 74 | |
| 500 | LinePlotter | Brute Force, Dynamic Programming, Geometry, Graph Theory, Search, String Parsing | 53 | |
| 1000 | MLBRecord | Brute Force, Greedy, Simple Search, Iteration | 91 |
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.
Sign in to enter a virtual contest.