11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
26 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2041I | Auto Complete | 2300 | 688 | |||
| 2038I | Polyathlon | 2500 | 758 | |||
| 2002D2 | DFS Checker (Hard Version) | 2300 | 2.9k | |||
| 1968G1 | Division + LCP (easy version) | 1900 | 5.4k | |||
| 1968G2 | Division + LCP (hard version) | 2200 | 2.6k | |||
| 1957F1 | Frequency Mismatch (Easy Version) | 2600 | 706 | |||
| 1957F2 | Frequency Mismatch (Hard Version) | 2700 | 659 | |||
| 1913F | Palindromic Problem | 2800 | 583 | |||
| 1887C | Minimum Array | 2400 | 2.3k | |||
| 1849C | Binary String Copying | 1600 | 12.7k | |||
| 1827C | Palindrome Partition | 2600 | 1.8k | |||
| 1792D | Fixed Prefix Permutations | 1700 | 8.3k | |||
| 1771F | Hossam and Range Minimum Query | 2500 | 1.7k | |||
| 1608G | Alphabetic Tree | 3500 | 300 | |||
| 1574D | The Strongest Build | 2000 | 4.9k | |||
| 1537E2 | Erase and Extend (Hard Version) | 2200 | 6.4k | |||
| 1535F | String Distance | 3000 | 701 | |||
| 1284D | New Year and Conference | 2100 | 3.4k | |||
| 1129C | Morse Code | 2400 | 1k | |||
| 1051E | Vasya and Big Integers | 2600 | 1.3k | |||
| 650D | Zip-line | 2600 | 1.7k | |||
| 514C | Watto and Mechanism | 2000 | 8.4k | |||
| 425D | Sereja and Squares | 2300 | 1.7k | |||
| 350D | Looking for Owls | 2400 | 320 | |||
| 30E | Tricky and Clever Password | 2800 | 961 | |||
| 28D | Don't fear, DravDe is kind | 2400 | 723 |
showing 1–26 of 26