SRM 666 · 2015-06-30 · by praveen123
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | WalkOverATree | Graph Theory | 76.00% | 106 |
| 500 | SumOverPermutations | Dynamic Programming, Math | 93.00% | 74 |
| 1000 | CountBinarySequences | Dynamic Programming, Graph Theory, Math, Recursion | 80.00% | 143 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DevuAndGame | Brute Force, Simulation | 87.00% | 109 |
| 500 | GoodString | Brute Force, String Manipulation, String Parsing | 84.00% | 85 |
| 1000 | WalkOverATreeDiv2 | Dynamic Programming | 28.00% | 97 |
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.