TCCC '03 Round 4 · 2003-03-12 · by brett1479, dgoodman, lars2520
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | ChessMetric | Dynamic Programming, Graph Theory | 18 | |
| 500 | TileMatch | Brute Force, Simple Search, Iteration | 23 | |
| 1000 | Optimizer | Math, String Manipulation, String Parsing | 29 |
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.
A division runs one field at a time and starts on the quarter hour, so entering puts you in the next slot — at most fifteen minutes away — alongside everyone else who signs up before the gun.
Sign in to enter a virtual contest.