11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
18 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2207H1 | Bowser's Castle (Easy Version) | unrated | 60 | |||
| 2169D2 | Removal of a Sequence (Hard Version) | 2100 | 2.4k | |||
| 2154E | No Mind To Think | 2500 | 1.2k | |||
| 2106G1 | Baudelaire (easy version) | 2200 | 1.7k | |||
| 2042E | Vertex Pairs | 2900 | 535 | |||
| 2035D | Yet Another Real Number Problem | 1800 | 5.9k | |||
| 2018E1 | Complex Segments (Easy Version) | 3300 | 246 | |||
| 2018E2 | Complex Segments (Hard Version) | 3400 | 210 | |||
| 2001C | Guess The Tree | 1500 | 13.1k | |||
| 1998E1 | Eliminating Balls With Merging (Easy Version) | 2200 | 2.3k | |||
| 1998E2 | Eliminating Balls With Merging (Hard Version) | 2500 | 927 | |||
| 1969E | Unique Array | 2400 | 1.9k | |||
| 1849F | XOR Partition | 2700 | 911 | |||
| 1750E | Bracket Cost | 2400 | 1.7k | |||
| 1706E | Qpwoeirut and Vertices | 2300 | 4k | |||
| 1696D | Permutation Graph | 1900 | 6.1k | |||
| 1439C | Greedy Shopping | 2600 | 2.3k | |||
| 1237C2 | Balanced Removals (Harder) | 1900 | 4.6k |
showing 1–18 of 18