11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
27 problems · filtered by 4 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2205G | Simons and Diophantus Equation | 3000 | 231 | |||
| 2204F | Sum of Fractions | 2200 | 1.3k | |||
| 2123G | Modular Sorting | 2100 | 3.3k | |||
| 2118D2 | Red Light, Green Light (Hard version) | 2200 | 2.6k | |||
| 2091G | Gleb and Boating | 2300 | 1.6k | |||
| 2044F | Easy Demon Problem | 1900 | 6.4k | |||
| 1986G1 | Permutation Problem (Simple Version) | 2200 | 2k | |||
| 1986G2 | Permutation Problem (Hard Version) | 2500 | 1.5k | |||
| 1982D | Beauty of the mountains | 1700 | 10.2k | |||
| 1977C | Nikita and LCM | 1900 | 8.2k | |||
| 1945H | GCD is Greater | 2600 | 971 | |||
| 1822G1 | Magic Triples (Easy Version) | 1700 | 9.9k | |||
| 1822G2 | Magic Triples (Hard Version) | 2200 | 3.1k | |||
| 1797E | Li Hua and Array | 2300 | 1.7k | |||
| 1783E | Game of the Year | 2300 | 2.5k | |||
| 1780E | Josuke and Complete Graph | 2400 | 1.8k | |||
| 1728E | Red-Black Pepper | 2300 | 2.1k | |||
| 1712E2 | LCM Sum (hard version) | 2500 | 1.7k | |||
| 1706D2 | Chopping Carrots (Hard Version) | 2400 | 2k | |||
| 1561D1 | Up the Strip (simplified version) | 1700 | 6.2k | |||
| 1493D | GCD of an Array | 2100 | 5.9k | |||
| 1200F | Graph Traveler | 2300 | 1.2k | |||
| 986E | Prince's Problem | 2800 | 957 | |||
| 979D | Kuro and GCD and XOR and SUM | 2200 | 2.3k | |||
| 830C | Bamboo Partition | 2300 | 1.3k | |||
| 731F | Video Cards | 1900 | 3.2k | |||
| 385C | Bear and Prime Numbers | 1700 | 10.8k |
showing 1–27 of 27