TCCC07 Round 1A · 2007-07-30 · by andrewzta
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | LetterInterchange | Search, String Manipulation | 60.00% | 142 |
| 500 | LongestSubanagramChain | Greedy, Search, Sorting | 77.00% | 101 |
| 1000 | KSlopePermutation | Dynamic Programming | 60.00% | 244 |
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.