11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
12 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2107C | Maximum Subarray Sum | 1500 | 12.5k | |||
| 2071D2 | Infinite Sequence (Hard Version) | 2500 | 1.1k | |||
| 2044H | Hard Demon Problem | 2100 | 2.7k | |||
| 1956D | Nene and the Mex Operator | 2000 | 4.9k | |||
| 1919E | Counting Prefixes | 2600 | 1.2k | |||
| 1868B2 | Candy Party (Hard Version) | 2100 | 2.8k | |||
| 1819C | The Fox and the Complete Tree Traversal | 2400 | 1.8k | |||
| 1704E | Count Seconds | 2200 | 2.7k | |||
| 1697E | Coloring | 2400 | 1.5k | |||
| 1619E | MEX and Increments | 1700 | 10.3k | |||
| 1286F | Harry The Potter | 3100 | 411 | |||
| 830E | Perpetual Motion Machine | 3100 | 373 |
showing 1–12 of 12