SRM 518 · 2011-05-25 · by omeometo
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | LargestSubsequence | Greedy, String Manipulation | 99.00% | 160 |
| 500 | ConvexSequence | Greedy | 92.00% | 170 |
| 1000 | Nim | Dynamic Programming | 42.00% | 70 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TwiceString | String Manipulation | 83.00% | 128 |
| 500 | LargestSubsequence | Greedy, String Manipulation | 93.00% | 160 |
| 1000 | CoinReversing | Dynamic Programming, Simple Math | 88.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.
Sign in to enter a virtual contest.