SRM 259 · 2005-08-22 · by Andrew_Lazarev
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | NumericalSequence | Greedy | 82.00% | 83 |
| 500 | SuperString | Dynamic Programming, String Manipulation | 27.00% | 97 |
| 1000 | CardRemover | Dynamic Programming | 31.00% | 75 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | CompetitionStatistics | Brute Force | 80.00% | 79 |
| 500 | PrimePolynom | Brute Force | 25.00% | 128 |
| 1000 | NumericalSequence | Greedy | 74.00% | 83 |
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.