11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
14 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2241E | Fair and Square | 1600 | 5.8k | |||
| 2211E | Minimum Path Cover | 2500 | 1k | |||
| 2112E | Tree Colorings | 2200 | 3.5k | |||
| 1916G | Optimizations From Chelsu | 3500 | 239 | |||
| 1778F | Maximizing Root | 2600 | 964 | |||
| 1725E | Electrical Efficiency | 2500 | 640 | |||
| 1617E | Christmas Chocolates | 2700 | 1.1k | |||
| 1401D | Maximum Distributed Tree | 1800 | 10.7k | |||
| 1292D | Chaotic V. | 2700 | 1.1k | |||
| 1101D | GCD Counting | 2000 | 5.5k | |||
| 1034C | Region Separation | 2700 | 1.1k | |||
| 1025D | Recovering BST | 2100 | 4.3k | |||
| 990G | GCD Counting | 2400 | 2.4k | |||
| 979D | Kuro and GCD and XOR and SUM | 2200 | 2.3k |
showing 1–14 of 14