Codeforces Round 947 (Div. 1 + Div. 2)
9 problems from Codeforces Round 947 (Div. 1 + Div. 2) (contest 1975), difficulty 800-3500. 0/9 solutions verified against sample I/O.
Codeforces Round 947 (Div. 1 + Div. 2)
Div. 1+2 | 9 problems | 0/9 verified | Difficulty 800-3500 | 47m 41s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Bazoka and Mocha's Array | 800 | brute-force, greedy, implementation | 20,704 | 5m 18s | |
| B | 378QAQ and Mocha's Array | 1000 | brute-force, greedy, math | 21,065 | 5m 18s | |
| C | Chamo and Mocha's Array | 1200 | binary-search, brute-force, greedy | 17,159 | 5m 19s | |
| D | Paint the Tree | 1700 | brute-force, dfs-and-similar, dp | 7,494 | 5m 19s | |
| E | Chain Queries | 2100 | binary-search, data-structures, dfs-and-similar | 2,870 | 5m 17s | |
| F | Set | 2600 | bitmasks, brute-force, combinatorics | 1,036 | 5m 17s | |
| G | Zimpha Fan Club | 3000 | fft, greedy, math | 342 | 5m 19s | |
| H | 378QAQ and Core | 3500 | greedy, strings | 217 | 5m 19s | |
| I | Mind Bloom | 3500 | dp | 175 | 5m 15s |