11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
26 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2242E | Product of Closures | 2200 | 1.4k | |||
| 2231F | Quadratic Jumps | 2600 | 787 | |||
| 2219A | Grid L | 1400 | 10.7k | |||
| 2144A | Cut the Array | 800 | 22.3k | |||
| 2138E1 | Determinant Construction (Easy Version) | 3100 | 270 | |||
| 2138E2 | Determinant Construction (Hard Version) | 3100 | 197 | |||
| 2131H | Sea, You & copriMe | 2600 | 909 | |||
| 2114G | Build an Array | 2200 | 2.1k | |||
| 2092F | Andryusha and CCB | 2900 | 438 | |||
| 2091G | Gleb and Boating | 2300 | 1.6k | |||
| 2029E | Common Generator | 2100 | 3.6k | |||
| 1995C | Squaring | 1800 | 10.4k | |||
| 1993F1 | Dyn-scripted Robot (Easy Version) | 2400 | 1.2k | |||
| 1928E | Modular Sequence | 2300 | 2.3k | |||
| 1909E | Multiple Lamps | 2400 | 1.7k | |||
| 1902C | Insert and Equalize | 1300 | 17.5k | |||
| 1732A | Bestie | 1000 | 17.8k | |||
| 1706D2 | Chopping Carrots (Hard Version) | 2400 | 2k | |||
| 1617B | GCD Problem | 900 | 27.2k | |||
| 1562B | Scenes From a Memory | 1000 | 20.7k | |||
| 1553G | Common Divisor Graph | 2700 | 1.3k | |||
| 1469D | Ceil Divisions | 1700 | 10.3k | |||
| 1332B | Composite Coloring | 1400 | 19.3k | |||
| 1166E | The LCMs Must be Large | 2100 | 3k | |||
| 743C | Vladik and fractions | 1500 | 13.6k | |||
| 633B | A Trivial Problem | 1300 | 7.3k |
showing 1–26 of 26