Member Single Round Match 474 · 2009-12-03 · by K.A.D.R, maksay
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | RouteIntersection | Dynamic Programming, Encryption/Compression | 90.00% | 191 |
| 500 | TreesCount | Dynamic Programming, Graph Theory | 74.00% | 109 |
| 1000 | GameWithGraphAndTree | Dynamic Programming | 51.00% | 104 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | PalindromesCount | Brute Force, Simple Search, Iteration | 92.00% | 119 |
| 500 | RouteIntersection | Dynamic Programming, Encryption/Compression | 62.00% | 191 |
| 1000 | SquaresCovering | Dynamic Programming, Geometry, Search | 11.00% | 118 |
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.