11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
9 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2002D1 | DFS Checker (Easy Version) | 1900 | 5.2k | |||
| 1867F | Most Different Tree | 2700 | 554 | |||
| 1681D | Required Length | 1700 | 10.9k | |||
| 1574D | The Strongest Build | 2000 | 4.9k | |||
| 1569F | Palindromic Hamiltonian Path | 3000 | 493 | |||
| 1394B | Boboniu Walks on Graph | 2300 | 2.2k | |||
| 778C | Peterson Polyglot | 2500 | 1k | |||
| 574B | Bear and Three Musketeers | 1500 | 8.4k | |||
| 65D | Harry Potter and the Sorting Hat | 2200 | 500 |
showing 1–9 of 9