SRM 733 · 2018-04-13 · by ltdtl
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MinimizeAbsoluteDifferenceDiv1 | Brute Force, Simple Math | 52.00% | 170 |
| 500 | BuildingSpanningTreesDiv1 | Graph Theory, Math | 89.00% | 151 |
| 1000 | HamiltonianCircuits | Graph Theory, Greedy | 22.00% | 189 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MinimizeAbsoluteDifferenceDiv2 | Brute Force, Simple Math | 81.00% | 159 |
| 500 | BuildingSpanningTreesDiv2 | Graph Theory, Math | 66.00% | 91 |
| 1000 | HamiltonianPathsInGraph | Graph Theory, Greedy | 23.00% | 209 |
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.