1549+ problems with statements under 1000 characters
Updated: 2026-04-21
Have fun :)
| Skill Level | Problems |
|---|---|
| Newbie | 800 (246) • 900 (54) • 1000 (71) • 1100 (79) |
| Pupil | 1200 (81) • 1300 (59) |
| Specialist | 1400 (71) • 1500 (57) |
| Expert | 1600 (91) • 1700 (63) • 1800 (69) |
| Candidate Master | 1900 (85) • 2000 (56) |
| Master | 2100 (56) • 2200 (57) |
| International Master | 2300 (52) |
| Grandmaster | 2400 (58) • 2500 (49) |
| International GM | 2600 (34) • 2700 (30) • 2800 (23) • 2900 (26) |
| Legendary GM | 3000 (22) • 3100 (23) • 3200 (10) • 3300 (6) • 3400 (5) • 3500 (16) |
Codeforces blocks raw HTTP scraping with Cloudflare (confirmed 2026). Use Chrome:
python annual_update.py --statement-fetcher chromeChrome setup:
- Open Chrome and log into Codeforces
- When asked, allow terminal to control Google Chrome
Rating 800
Rating 900
Rating 1000
Rating 1100
Rating 1200
Rating 1300
Rating 1400
Rating 1500
Rating 1600
Rating 1700
Rating 1800
Rating 1900
Rating 2000
Rating 2100
Rating 2200
Rating 2300
Rating 2400
Rating 2500
Rating 2600
Rating 2700
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 70D | Professor's task | 2700 |
| 2 | 107E | Darts | 2700 |
| 3 | 293B | Distinct Paths | 2700 |
| 4 | 293D | Ksusha and Square | 2700 |
| 5 | 293E | Close Vertices | 2700 |
| 6 | 827D | Best Edge Weight | 2700 |
| 7 | 958E3 | Guard Duty (hard) | 2700 |
| 8 | 982F | The Meeting Place Cannot Be Changed | 2700 |
| 9 | 995E | Number Clicker | 2700 |
| 10 | 1019D | Large Triangle | 2700 |
| 11 | 1182F | Maximum Sine | 2700 |
| 12 | 1194G | Another Meme Problem | 2700 |
| 13 | 1205D | Almost All | 2700 |
| 14 | 1270G | Subset with Zero Sum | 2700 |
| 15 | 1366G | Construct the String | 2700 |
| 16 | 1555F | Good Graph | 2700 |
| 17 | 1599G | Shortest path | 2700 |
| 18 | 1599I | Desert | 2700 |
| 19 | 1641D | Two Arrays | 2700 |
| 20 | 1671F | Permutation Counting | 2700 |
| 21 | 1728G | Illumination | 2700 |
| 22 | 1814F | Communication Towers | 2700 |
| 23 | 1849F | XOR Partition | 2700 |
| 24 | 1867F | Most Different Tree | 2700 |
| 25 | 1916H1 | Matrix Rank (Easy Version) | 2700 |
| 26 | 1916H2 | Matrix Rank (Hard Version) | 2700 |
| 27 | 1918G | Permutation of Given | 2700 |
| 28 | 2025F | Choose Your Queries | 2700 |
| 29 | 2028F | Alice's Adventures in Addition | 2700 |
| 30 | 2081C | Quaternary Matrix | 2700 |
Rating 2800
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 325E | The Red Button | 2800 |
| 2 | 418D | Big Problems for Organizers | 2800 |
| 3 | 480E | Parking Lot | 2800 |
| 4 | 575I | Robots protection | 2800 |
| 5 | 600F | Edge coloring of bipartite graph | 2800 |
| 6 | 802D3 | Marmots (hard) | 2800 |
| 7 | 802F | Marmots (hard) | 2800 |
| 8 | 819E | Mister B and Flight to the Moon | 2800 |
| 9 | 908G | New Year and Original Order | 2800 |
| 10 | 983E | NN country | 2800 |
| 11 | 1031F | Familiar Operations | 2800 |
| 12 | 1039D | You Are Given a Tree | 2800 |
| 13 | 1067E | Random Forest Rank | 2800 |
| 14 | 1436F | Sum Over Subsets | 2800 |
| 15 | 1442D | Sum | 2800 |
| 16 | 1578A | Anti-Tetris | 2800 |
| 17 | 1609F | Interesting Sections | 2800 |
| 18 | 1620F | Bipartite Array | 2800 |
| 19 | 1697F | Too Many Constraints | 2800 |
| 20 | 1863G | Swaps | 2800 |
| 21 | 1904F | Beautiful Tree | 2800 |
| 22 | 1913F | Palindromic Problem | 2800 |
| 23 | 1976F | Remove Bridges | 2800 |
Rating 2900
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 19E | Fairy | 2900 |
| 2 | 128E | Birthday | 2900 |
| 3 | 455E | Function | 2900 |
| 4 | 598F | Cut Length | 2900 |
| 5 | 741D | Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths | 2900 |
| 6 | 802O | April Fools' Problem (hard) | 2900 |
| 7 | 871E | Restore the Tree | 2900 |
| 8 | 886F | Symmetric Projections | 2900 |
| 9 | 980F | Cactus to Tree | 2900 |
| 10 | 1032G | Chattering | 2900 |
| 11 | 1129D | Isolation | 2900 |
| 12 | 1198F | GCD Groups 2 | 2900 |
| 13 | 1221G | Graph And Numbers | 2900 |
| 14 | 1285F | Classical? | 2900 |
| 15 | 1310E | Strange Function | 2900 |
| 16 | 1452F | Divide Powers | 2900 |
| 17 | 1487F | Ones | 2900 |
| 18 | 1616F | Tricolor Triangles | 2900 |
| 19 | 1622F | Quadratic Set | 2900 |
| 20 | 1667D | Edge Elimination | 2900 |
| 21 | 1677E | Tokitsukaze and Beautiful Subsegments | 2900 |
| 22 | 1773J | Jumbled Trees | 2900 |
| 23 | 1810H | Last Number | 2900 |
| 24 | 1910J | Two Colors | 2900 |
| 25 | 2140F | Sum Minimisation | 2900 |
| 26 | 2192F | Fish Fight | 2900 |
Rating 3000
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 57E | Chess | 3000 |
| 2 | 243E | Matrix | 3000 |
| 3 | 335F | Buy One, Get One Free | 3000 |
| 4 | 364E | Empty Rectangles | 3000 |
| 5 | 375E | Red and Black Tree | 3000 |
| 6 | 504E | Misha and LCP on Tree | 3000 |
| 7 | 618F | Double Knapsack | 3000 |
| 8 | 1175G | Yet Another Partiton Problem | 3000 |
| 9 | 1211I | Unusual Graph | 3000 |
| 10 | 1418F | Equal Product | 3000 |
| 11 | 1476F | Lanterns | 3000 |
| 12 | 1569F | Palindromic Hamiltonian Path | 3000 |
| 13 | 1603D | Artistic Partition | 3000 |
| 14 | 1616H | Keep XOR Low | 3000 |
| 15 | 1637G | Birthday | 3000 |
| 16 | 1854E | Game Bundles | 3000 |
| 17 | 1969F | Card Pairing | 3000 |
| 18 | 1983G | Your Loss | 3000 |
| 19 | 2043G | Problem with Queries | 3000 |
| 20 | 2075F | Beautiful Sequence Returns | 3000 |
| 21 | 2156F2 | Strange Operation (Hard Version) | 3000 |
| 22 | 2199I | Strange Process | 3000 |
Rating 3100
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 164D | Minimum Diameter | 3100 |
| 2 | 407E | k-d-sequence | 3100 |
| 3 | 442E | Gena and Second Distance | 3100 |
| 4 | 468E | Permanent | 3100 |
| 5 | 720C | Homework | 3100 |
| 6 | 720F | Array Covering | 3100 |
| 7 | 804E | The same permutation | 3100 |
| 8 | 986D | Perfect Encoding | 3100 |
| 9 | 1067D | Computer Game | 3100 |
| 10 | 1168E | Xor Permutations | 3100 |
| 11 | 1188D | Make Equal | 3100 |
| 12 | 1225G | To Make 1 | 3100 |
| 13 | 1286D | LCC | 3100 |
| 14 | 1307G | Cow and Exercise | 3100 |
| 15 | 1329D | Dreamoon Likes Strings | 3100 |
| 16 | 1425C | Captain of Knights | 3100 |
| 17 | 1463F | Max Correct Set | 3100 |
| 18 | 1476G | Minimum Difference | 3100 |
| 19 | 1510A | ASCII Automata Art | 3100 |
| 20 | 1762G | Unequal Adjacent Elements | 3100 |
| 21 | 1958I | Equal Trees | 3100 |
| 22 | 2046D | For the Emperor! | 3100 |
| 23 | 2081G1 | Hard Formula | 3100 |
Rating 3200
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 457F | An easy problem about trees | 3200 |
| 2 | 571E | Geometric Progressions | 3200 |
| 3 | 690F3 | Tree of Life (hard) | 3200 |
| 4 | 1007D | Ants | 3200 |
| 5 | 1268D | Invertation in Tournament | 3200 |
| 6 | 1408I | Bitwise Magic | 3200 |
| 7 | 1584G | Eligible Segments | 3200 |
| 8 | 1608F | MEX counting | 3200 |
| 9 | 1656G | Cycle Palindrome | 3200 |
| 10 | 1656H | Equal LCM Subsets | 3200 |
Rating 3300
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 906E | Reverses | 3300 |
| 2 | 1266G | Permutation Concatenation | 3300 |
| 3 | 1329E | Dreamoon Loves AA | 3300 |
| 4 | 1556H | DIY Tree | 3300 |
| 5 | 1580F | Problems for Codeforces | 3300 |
| 6 | 1615G | Maximum Adjacent Pairs | 3300 |
Rating 3400
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 1268E | Happy Cactus | 3400 |
| 2 | 1431J | Zero-XOR Array | 3400 |
| 3 | 1553I | Stairs | 3400 |
| 4 | 1684H | Hard Cut | 3400 |
| 5 | 2081G2 | Hard Formula (Hard Version) | 3400 |
Rating 3500
| # | ID | Problem | Rating |
|---|---|---|---|
| 1 | 799G | Cut the pie | 3500 |
| 2 | 1054H | Epic Convolution | 3500 |
| 3 | 1458F | Range Diameter Sum | 3500 |
| 4 | 1470F | Strange Covering | 3500 |
| 5 | 1608G | Alphabetic Tree | 3500 |
| 6 | 1616G | Just Add an Edge | 3500 |
| 7 | 1718E | Impressionism | 3500 |
| 8 | 1774H | Maximum Permutation | 3500 |
| 9 | 1827F | Copium Permutation | 3500 |
| 10 | 1874F | Jellyfish and OEIS | 3500 |
| 11 | 1916G | Optimizations From Chelsu | 3500 |
| 12 | 2061H1 | Kevin and Stones (Easy Version) | 3500 |
| 13 | 2138F | Ode to the Bridge Builder | 3500 |
| 14 | 2147I2 | Longest Increasing Path (Hard Version) | 3500 |
| 15 | 2161H | Cycle Sort | 3500 |
| 16 | 2165F | Arctic Acquisition | 3500 |