Codeforces Round 237 (Div. 2)
5 problems from Codeforces Round 237 (Div. 2) (contest 404), difficulty 1000-2200. 3/5 solutions verified against sample I/O.
Codeforces Round 237 (Div. 2)
Div. 2 | 5 problems | 3/5 verified | Difficulty 1000-2200 | 24m 8s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Valera and X | 1000 | implementation | 26,203 | 4m 41s | ✓ |
| B | Marathon | 1500 | implementation, math | 3,049 | 4m 20s | ✓ |
| C | Restore Graph | 1800 | dfs-and-similar, graphs, sortings | 5,787 | 6m 13s | |
| D | Minesweeper 1D | 1900 | dp, implementation | 2,465 | 4m 20s | ✓ |
| E | Maze 1D | 2200 | binary-search, greedy, implementation | 642 | 4m 34s |