Codeforces Round 456 (Div. 2)
5 problems from Codeforces Round 456 (Div. 2) (contest 912), difficulty 800-2500. 5/5 solutions verified against sample I/O.
Codeforces Round 456 (Div. 2)
Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2500 | 33m 2s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Tricky Alchemy | 800 | implementation | 14,383 | 4m 12s | ✓ |
| B | New Year's Eve | 1300 | bitmasks, constructive-algorithms, number-theory | 13,833 | 10m 57s | ✓ |
| C | Perun, Ult! | 2500 | brute-force, greedy, sortings | 540 | 5m 1s | ✓ |
| D | Fishes | 2100 | data-structures, graphs, greedy | 2,148 | 5m 22s | ✓ |
| E | Prime Gift | 2400 | binary-search, dfs-and-similar, math | 2,044 | 7m 30s | ✓ |