Codeforces Round 946 (Div. 3)
Solutions for Codeforces Round 946 (Div. 3) (contest 1974). 0/7 problems verified against sample I/O. Difficulty range: 800-2000.
Codeforces Round 946 (Div. 3)
Type: Div. 3 | Problems: 7 | Verified: 0/7 | Rating range: 800-2000 | Time: 36m 53s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Phone Desktop | 800 | greedy, math | 5m 17s | ✗ |
| B | Symmetric Encoding | 800 | implementation, sortings, strings | 5m 18s | ✗ |
| C | Beautiful Triple Pairs | 1400 | combinatorics, data-structures | 5m 16s | ✗ |
| D | Ingenuity-2 | 1400 | constructive-algorithms, greedy, implementation | 5m 16s | ✗ |
| E | Money Buys Happiness | 1800 | dp | 5m 17s | ✗ |
| F | Cutting Game | 1900 | binary-search, brute-force, data-structures | 5m 16s | ✗ |
| G | Money Buys Less Happiness Now | 2000 | data-structures, greedy, sortings | 5m 13s | ✗ |