Codeforces Round 945 (Div. 2)
6 problems from Codeforces Round 945 (Div. 2) (contest 1973), difficulty 900-3100. 0/6 solutions verified against sample I/O.
Codeforces Round 945 (Div. 2)
Div. 2 | 6 problems | 0/6 verified | Difficulty 900-3100 | 31m 30s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Chess For Three | 900 | brute-force, dp, implementation | 28,522 | 5m 14s | |
| B | Cat, Fox and the Lonely Array | 1300 | binary-search, bitmasks, data-structures | 16,819 | 5m 16s | |
| C | Cat, Fox and Double Maximum | 1700 | constructive-algorithms, greedy, implementation | 9,846 | 5m 15s | |
| D | Cat, Fox and Maximum Array Split | 2400 | brute-force, interactive, math | 2,256 | 5m 14s | |
| E | Cat, Fox and Swaps | 2500 | graphs, math, sortings | 993 | 5m 15s | |
| F | Maximum GCD Sum Queries | 3100 | bitmasks, brute-force, dp | 320 | 5m 16s |