SRM 622 · 2013-12-22 · by ltaravilse
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | BuildingRoutes | Dynamic Programming, Graph Theory | 74.00% | 60 |
| 500 | Ethernet | Dynamic Programming | 70.00% | 38 |
| 1000 | FibonacciXor | Advanced Math, Dynamic Programming | 87.00% | 82 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | FibonacciDiv2 | Brute Force, Dynamic Programming | 92.00% | 66 |
| 500 | BoxesDiv2 | Greedy | 63.00% | 69 |
| 1000 | Subsets | Simple Math | 21.00% | 63 |
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.