2015 TCO 1C · 2015-04-08 · by praveen123
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DevuAndPlantingTrees | Brute Force | 82.00% | 67 |
| 500 | UnrelatedPaths | Graph Theory | 82.00% | 71 |
| 1000 | DevuAndBeautifulSubstrings | Dynamic Programming, Simple Math, String Manipulation | 92.00% | 134 |
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.