SRM 283 · 2006-01-19 · by gevak
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | PowerSupply | Brute Force, Geometry | 53.00% | 109 |
| 500 | FactorialTower | Math, Simple Search, Iteration | 26.00% | 97 |
| 1000 | SuspiciousStrings | Dynamic Programming, String Manipulation | 55.00% | 81 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DiagonalDisproportion | Simple Search, Iteration | 98.00% | 21 |
| 500 | PowerSupply | Brute Force, Geometry | 20.00% | 109 |
| 1000 | FactorialGCD | Math, Simple Search, Iteration | 6.00% | 170 |
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.