11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
17 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2219C | Coloring a Red Black Tree | 2300 | 1.4k | |||
| 2211E | Minimum Path Cover | 2500 | 1k | |||
| 2040E | Control of Randomness | 2100 | 2.8k | |||
| 2031E | Penchick and Chloe's Trees | 2100 | 2.8k | |||
| 2028E | Alice's Adventures in the Rabbit Hole | 2300 | 2k | |||
| 2021E1 | Digital Village (Easy Version) | 2300 | 2k | |||
| 2021E3 | Digital Village (Extreme Version) | 2800 | 725 | |||
| 1929E | Sasha and the Happy Tree Cutting | 2300 | 2.1k | |||
| 1856E2 | PermuTree (hard version) | 2700 | 1.8k | |||
| 1843F1 | Omsk Metro (simple version) | 1800 | 6.5k | |||
| 1416C | XOR Inverse | 2000 | 5.2k | |||
| 1401D | Maximum Distributed Tree | 1800 | 10.7k | |||
| 1369D | TediousLee | 1900 | 9.3k | |||
| 1292D | Chaotic V. | 2700 | 1.1k | |||
| 1088E | Ehab and a component choosing problem | 2400 | 1.6k | |||
| 979D | Kuro and GCD and XOR and SUM | 2200 | 2.3k | |||
| 75D | Big Maximum Sum | 2000 | 2.1k |
showing 1–17 of 17