SRM 589 · 2013-06-25 · by snuke
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | GooseTattarrattatDiv1 | Graph Theory, Greedy | 54.00% | 189 |
| 500 | GearsDiv1 | Graph Theory | 56.00% | 104 |
| 1000 | FlippingBitsDiv1 | Brute Force, Dynamic Programming, Search, String Manipulation | 53.00% | 67 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | GooseTattarrattatDiv2 | Greedy, Simple Search, Iteration | 94.00% | 85 |
| 500 | GearsDiv2 | Greedy, Simple Search, Iteration | 28.00% | 108 |
| 1000 | FlippingBitsDiv2 | Dynamic Programming, Simple Math | 13.00% | 87 |
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.
A division runs one field at a time and starts on the quarter hour, so entering puts you in the next slot — at most fifteen minutes away — alongside everyone else who signs up before the gun.
Sign in to enter a virtual contest.