11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
14 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2176E | Remove at the lowest cost | 2400 | 1.3k | |||
| 2063F1 | Counting Is Not Fun (Easy Version) | 2400 | 1.6k | |||
| 2031D | Penchick and Desert Rabbit | 1700 | 10.1k | |||
| 2021E1 | Digital Village (Easy Version) | 2300 | 2k | |||
| 2021E3 | Digital Village (Extreme Version) | 2800 | 725 | |||
| 1985H2 | Maximize the Largest Component (Hard Version) | 2200 | 2k | |||
| 1923E | Count Paths | 2000 | 5.3k | |||
| 1895E | Infinite Card Game | 2300 | 1.9k | |||
| 1824C | LuoTianyi and XOR-Tree | 2500 | 1.7k | |||
| 1763F | Edge Queries | 3000 | 750 | |||
| 1681F | Unique Occurrences | 2300 | 2.4k | |||
| 1521D | Nastia Plays with a Tree | 2500 | 2.4k | |||
| 766D | Mahmoud and a Dictionary | 2000 | 4k | |||
| 292D | Connected Components | 1900 | 2.8k |
showing 1–14 of 14