11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
27 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2236G | Criterion in Burlandia | 2600 | 385 | |||
| 2164F2 | Chain Prefix Rank (Hard Version) | 2900 | 648 | |||
| 2093G | Shorten the Array | 1900 | 4k | |||
| 2042E | Vertex Pairs | 2900 | 535 | |||
| 2002D2 | DFS Checker (Hard Version) | 2300 | 2.9k | |||
| 1990E1 | Catch the Mole(Easy Version) | 2500 | 1.2k | |||
| 1990E2 | Catch the Mole(Hard Version) | 2600 | 1.2k | |||
| 1975E | Chain Queries | 2100 | 2.9k | |||
| 1957F2 | Frequency Mismatch (Hard Version) | 2700 | 659 | |||
| 1935F | Andrey's Tree | 2800 | 634 | |||
| 1878G | wxhtzdy ORO Tree | 2300 | 1.5k | |||
| 1739D | Reset K Edges | 1900 | 6.4k | |||
| 1714G | Path Prefixes | 1700 | 9.9k | |||
| 1712F | Triameter | 3200 | 508 | |||
| 1706E | Qpwoeirut and Vertices | 2300 | 4k | |||
| 1633E | Spanning Tree Queries | 2400 | 1.8k | |||
| 1632E1 | Distance Tree (easy version) | 2400 | 1.4k | |||
| 1625E2 | Cats on the Upgrade (hard version) | 2800 | 705 | |||
| 1608G | Alphabetic Tree | 3500 | 300 | |||
| 1099F | Cookies | 2400 | 1.1k | |||
| 1062E | Company | 2300 | 2.1k | |||
| 739B | Alyona and a tree | 1900 | 5.2k | |||
| 722D | Generating Sets | 1900 | 3.4k | |||
| 533A | Berland Miners | 3000 | 618 | |||
| 519E | A and B and Lecture Rooms | 2100 | 8.9k | |||
| 372D | Choosing Subtree is Fun | 2600 | 1.2k | |||
| 208E | Blood Cousins | 2100 | 9.4k |
showing 1–27 of 27