SRM 536 · 2011-11-22 · by meret
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MergersDivOne | Greedy, Sorting | 95.00% | 114 |
| 500 | RollingDiceDivOne | Math | 26.00% | 156 |
| 1000 | BinaryPolynomialDivOne | Dynamic Programming, Simple Math | 74.00% | 103 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | BinaryPolynomialDivTwo | Simple Math, Simple Search, Iteration | 95.00% | 63 |
| 500 | RollingDiceDivTwo | Greedy, Sorting, String Parsing | 97.00% | 55 |
| 1000 | MergersDivTwo | Dynamic Programming, Sorting | 20.00% | 99 |
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.