SRM 348 · 2007-05-09 · by soul-net
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | LostParentheses | Greedy | 88.00% | 98 |
| 500 | RailwayTickets | Search, Sorting | 49.00% | 115 |
| 1000 | NormalizingTrees | Graph Theory, Greedy, Recursion | 21.00% | 100 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | OptimalList | Greedy, Simulation | 90.00% | 81 |
| 500 | LostParentheses | Greedy | 71.00% | 98 |
| 1000 | IncreasingSubsequences | Dynamic Programming | 44.00% | 100 |
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.