TCO11 Semifinal 1 · 2011-05-07 · by Smylic, misof
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | OrthogonalAnagram | Greedy, String Manipulation | 83.00% | 128 |
| 500 | GuessTheSubstring | Dynamic Programming, Greedy, Math, Search, String Manipulation | 77.00% | 134 |
| 1000 | MatrixPower | Math | 100.00% | 123 |
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.