Codeforces Round 945 (Div. 2)
Solutions for Codeforces Round 945 (Div. 2) (contest 1973). 0/6 problems verified against sample I/O. Difficulty range: 900-3100.
Codeforces Round 945 (Div. 2)
Type: Div. 2 | Problems: 6 | Verified: 0/6 | Rating range: 900-3100 | Time: 31m 30s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Chess For Three | 900 | brute-force, dp, implementation | 5m 14s | ✗ |
| B | Cat, Fox and the Lonely Array | 1300 | binary-search, bitmasks, data-structures | 5m 16s | ✗ |
| C | Cat, Fox and Double Maximum | 1700 | constructive-algorithms, greedy, implementation | 5m 15s | ✗ |
| D | Cat, Fox and Maximum Array Split | 2400 | brute-force, interactive, math | 5m 14s | ✗ |
| E | Cat, Fox and Swaps | 2500 | graphs, math, sortings | 5m 15s | ✗ |
| F | Maximum GCD Sum Queries | 3100 | bitmasks, brute-force, dp | 5m 16s | ✗ |