11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
19 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2146E | Yet Another MEX Problem | 2300 | 2.2k | |||
| 2059E2 | Stop Gaming (Hard Version) | 2900 | 355 | |||
| 2002D1 | DFS Checker (Easy Version) | 1900 | 5.2k | |||
| 1996G | Penacony | 2200 | 2.4k | |||
| 1986G2 | Permutation Problem (Hard Version) | 2500 | 1.5k | |||
| 1968G2 | Division + LCP (hard version) | 2200 | 2.6k | |||
| 1887C | Minimum Array | 2400 | 2.3k | |||
| 1849C | Binary String Copying | 1600 | 12.7k | |||
| 1827C | Palindrome Partition | 2600 | 1.8k | |||
| 1735D | Meta-set | 1700 | 7.1k | |||
| 1634F | Fibonacci Additions | 2700 | 2k | |||
| 1574D | The Strongest Build | 2000 | 4.9k | |||
| 1535F | String Distance | 3000 | 701 | |||
| 1493D | GCD of an Array | 2100 | 5.9k | |||
| 1340F | Nastya and CBS | 3300 | 792 | |||
| 1175F | The Number of Subpermutations | 2500 | 2.8k | |||
| 1056E | Check Transcription | 2100 | 2.9k | |||
| 710F | String Set Queries | 2400 | 2.6k | |||
| 113B | Petr# | 2000 | 3.3k |
showing 1–19 of 19