Codeforces Round 946 (Div. 3)
7 problems from Codeforces Round 946 (Div. 3) (contest 1974), difficulty 800-2000. 0/7 solutions verified against sample I/O.
Codeforces Round 946 (Div. 3)
Div. 3 | 7 problems | 0/7 verified | Difficulty 800-2000 | 36m 53s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Phone Desktop | 800 | greedy, math | 37,900 | 5m 17s | |
| B | Symmetric Encoding | 800 | implementation, sortings, strings | 34,472 | 5m 18s | |
| C | Beautiful Triple Pairs | 1400 | combinatorics, data-structures | 19,037 | 5m 16s | |
| D | Ingenuity-2 | 1400 | constructive-algorithms, greedy, implementation | 17,788 | 5m 16s | |
| E | Money Buys Happiness | 1800 | dp | 11,313 | 5m 17s | |
| F | Cutting Game | 1900 | binary-search, brute-force, data-structures | 4,401 | 5m 16s | |
| G | Money Buys Less Happiness Now | 2000 | data-structures, greedy, sortings | 5,890 | 5m 13s |