Codeforces Round 947 (Div. 1 + Div. 2)
Solutions for Codeforces Round 947 (Div. 1 + Div. 2) (contest 1975). 0/9 problems verified against sample I/O. Difficulty range: 800-3500.
Codeforces Round 947 (Div. 1 + Div. 2)
Type: Div. 1+2 | Problems: 9 | Verified: 0/9 | Rating range: 800-3500 | Time: 47m 41s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Bazoka and Mocha's Array | 800 | brute-force, greedy, implementation | 5m 18s | ✗ |
| B | 378QAQ and Mocha's Array | 1000 | brute-force, greedy, math | 5m 18s | ✗ |
| C | Chamo and Mocha's Array | 1200 | binary-search, brute-force, greedy | 5m 19s | ✗ |
| D | Paint the Tree | 1700 | brute-force, dfs-and-similar, dp | 5m 19s | ✗ |
| E | Chain Queries | 2100 | binary-search, data-structures, dfs-and-similar | 5m 17s | ✗ |
| F | Set | 2600 | bitmasks, brute-force, combinatorics | 5m 17s | ✗ |
| G | Zimpha Fan Club | 3000 | fft, greedy, math | 5m 19s | ✗ |
| H | 378QAQ and Core | 3500 | greedy, strings | 5m 19s | ✗ |
| I | Mind Bloom | 3500 | dp | 5m 15s | ✗ |