Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5319 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 50331 | Ordinary Numbers | brute force math number theory | Statement | B | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 27110 | Potion-making | math number theory | Statement | A | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 37528 | I Hate 1111 | dp math number theory | Statement | B | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 15683 | Pursuit | binary search greedy sortings | Statement | C | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1000.0 | Codeforces Round #733 Editorial (all problems) | |
| 34488 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 16315 | Diluc and Kaeya | dp hashing number theory | Statement | C | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1500.0 | Codeforces Round #724 — Editorial | 1500 |
| 13830 | Deleting Divisors | games math number theory | Statement | D | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1500.0 | Codeforces Round #726 (Div.2) Editorial | |
| 15504 | Another Problem About Dividing Numbers | constructive algorithms number theory | Statement | D | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 40240 | Pleasant Pairs | brute force math number theory | Statement | B | Codeforces Round 728 (Div. 2) {1541} | PROGRAMMING | 1000.0 | Tutorial | |
| 26885 | Plus and Multiply | constructive algorithms math number theory | Statement | B | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1250.0 | ||
| 16420 | Strange Function | math number theory | Statement | C | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1500.0 | ||
| 43283 | Exciting Bets | greedy math number theory | Statement | A | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 500.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 7177 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 11609 | Integers Have Friends | binary search data structures math number theory two pointers | Statement | B | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 346 | Gregor and the Odd Cows (Hard) | brute force geometry math number theory | Statement | D2 | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 1643 | Gregor and the Odd Cows (Easy) | geometry math number theory | Statement | D1 | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 2000.0 | Codeforces Round 736 Editorial | |
| 35909 | Gregor and Cryptography | math number theory | Statement | A | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 500.0 | Codeforces Round 736 Editorial | |
| 470 | Guess the Perimeter | binary search interactive number theory | Statement | H | Codeforces Global Round 15 {1552} | PROGRAMMING | 2750.0 | Editorial of Global Round 15 | |
| 1294 | Common Divisor Graph | binary search dsu graphs math number theory | Statement | G | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 34549 | Digits Sum | math number theory | Statement | A | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 250.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 1440 | You | dfs and similar dp math number theory | Statement | E | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #735 (Div. 2) | 2600 |
| 5343 | Up the Strip | brute force dp math number theory | Statement | B | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1900 |
| 2796 | Mocha and Stars | combinatorics dp fft math number theory | Statement | E | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 3000.0 | Tutorial (en) | 2200 |
| 6174 | Up the Strip (simplified version) | brute force data structures dp math number theory | Statement | D1 | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 1700 |
| 20667 | Scenes From a Memory | brute force implementation math number theory | Statement | B | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 467 | Tubular Bells | interactive math number theory probabilities | Statement | F | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 177 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 5405 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 742 | Kuzya and Homework | data structures number theory | Statement | G | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 3250.0 | Codeforces Round #750 (Div.2) Editorial | |
| 14418 | Windblume Ode | math number theory | Statement | A | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 2656 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 | |
| 5618 | Half of Same | dp math number theory | Statement | D2 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 22203 | All are Same | math number theory | Statement | D1 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 22257 | Array Elimination | bitmasks math number theory | Statement | A | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 500.0 | 95865 | 1300 |
| 17940 | Di-visible Confusion | constructive algorithms math number theory | Statement | A | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #752 | 1300 |
| 15208 | Moderate Modular Mode | constructive algorithms math number theory | Statement | B | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1600 |
| 2341 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 958 | Artistic Partition | divide and conquer dp number theory | Statement | D | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #752 | 3000 |
| 1213 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 21705 | A.M. Deviation | math number theory | Statement | A | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 500.0 | tutorial | 800 |
| 10541 | Complex Market Analysis | binary search dp implementation number theory schedules two pointers | Statement | C | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1500.0 | Deltix Round, Autumn 2021. Editorial | 1400 |
| 19079 | Divide and Multiply | greedy implementation math number theory | Statement | A | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 500.0 | Deltix Round, Autumn 2021. Editorial | 900 |
| 3092 | Not Quite Lee | combinatorics math number theory | Statement | D | Codeforces Global Round 17 {1610} | PROGRAMMING | 2250.0 | Codeforces Global Round 17 Editorial | |
| 10366 | X-Magic Pair | math number theory | Statement | D | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 4561 | Divan and Kostomuksha (easy version) | dp number theory | Statement | D1 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 2100 |
| 2793 | Divan and Kostomuksha (hard version) | dp number theory | Statement | D2 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1000.0 | Tutorial | 2300 |
| 1070 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 941 | Quadratic Set | constructive algorithms hashing number theory | Statement | F | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 1195 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 705 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 922 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 16431 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 9514 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 25469 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 621 | Expected Components | combinatorics number theory probabilities | Statement | E | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #768 | |
| 2061 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 984 | Making It Bipartite | flows graphs number theory | Statement | F | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #768 | |
| 5434 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 7105 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 511 | Basis | combinatorics fft math number theory | Statement | F | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 2819 | Power Board | brute force math number theory | Statement | E | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2500.0 | Codeforces Round #774 (Div. 2) Editorial | 2200 |
| 5725 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 3094 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 7635 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
| 836 | Equal LCM Subsets | math number theory | Statement | H | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3750.0 | Tutorial | |
| 21191 | Make Equal With Mod | math number theory sortings | Statement | C | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1500.0 | Tutorial | |
| 1255 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 4763 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 3644 | Lost Arithmetic Progression | combinatorics implementation math number theory | Statement | D | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2000.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 850 | Power or XOR? | combinatorics math number theory | Statement | E | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 18926 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 42938 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 817 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
| 323 | Become Big For Me | combinatorics constructive algorithms math number theory | Statement | E | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 796 | |
| 9192 | Shifting String | graphs math number theory strings | Statement | F | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1700 | |
| 397 | Long Binary String | math matrices meet-in-the-middle number theory | Statement | G | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 3250.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 9586 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 7798 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 1968 | Chopping Carrots (Hard Version) | constructive algorithms dp number theory two pointers | Statement | D2 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 186 | Bugaboo | bitmasks constructive algorithms dp number theory | Statement | F | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 3250.0 | 104930 | |
| 2532 | LCM Sum (easy version) | binary search brute force combinatorics math number theory two pointers | Statement | E1 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 1684 | LCM Sum (hard version) | combinatorics data structures math number theory two pointers | Statement | E2 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 750.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 22459 | Woeful Permutation | constructive algorithms greedy number theory | Statement | B | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 1000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 6305 | Tournament Countdown | constructive algorithms fft greedy greedy interactive number theory probabilities | Statement | D | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 2000.0 | Codeforces Round #812 (Div. 2) Editorial | 1800 |
| 24634 | Add Modulo 10 | brute force math number theory | Statement | E | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 1463 | Bags with Balls | combinatorics math number theory | Statement | F | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 3579 | Madoka and The Best University | brute force math number theory | Statement | E | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 2000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2200 |
| 21138 | Madoka and Strange Thoughts | math number theory | Statement | A | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 500.0 | Codeforces Round #818 (Div. 2) Editorial. | 800 |
| 3544 | Fibonacci Strings | brute force data structures greedy implementation math number theory | Statement | B | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 1885 | Tonya and Burenka-179 | brute force data structures greedy math number theory | Statement | C | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 244 | Burenka, an Array and Queries | data structures math number theory | Statement | F | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2750.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 24557 | Burenka Plays with Fractions | math number theory | Statement | A | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 639 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 2074 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 815 | Maximums and Minimums | combinatorics combinatorics data structures number theory | Statement | E | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 2250.0 | Codeforces Round #823 — editorial | 2700 |
| 12528 | Even Subarrays | bitmasks brute force hashing math number theory | Statement | C | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 3564 | Graph Cost | dp greedy math number theory | Statement | E | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 17798 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 3311 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 20583 | Playing with GCD | math number theory | Statement | B | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 162 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
| 181 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 23396 | Factorise N+M | math number theory | Statement | A | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 35995 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13002 | Divisible Numbers (easy version) | brute force math number theory | Statement | E1 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 6980 | Divisible Numbers (hard version) | brute force math number theory | Statement | E2 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 3314 | ConstructOR | bitmasks chinese remainder theorem combinatorics constructive algorithms number theory | Statement | D | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2000.0 | Codeforces Round #833 (Div. 2) Editorial | 2100 |
| 6440 | Counting Arrays | math number theory | Statement | D | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 7565 | Count GCD | bitmasks combinatorics dp math number theory | Statement | D | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 15370 | Almost All Multiples | greedy number theory | Statement | C | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 4568 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 21383 | Make It Round | brute force number theory | Statement | D | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 18738 | Make Array Good | constructive algorithms implementation number theory sortings | Statement | B | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1000.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 20690 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 4452 | GCD Queries | interactive number theory | Statement | D | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2000.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 18119 | Doremy's Perfect Math Class | number theory | Statement | B | Codeforces Global Round 24 {1764} | PROGRAMMING | 1000.0 | Codeforces Global Round 24 Editorial | |
| 10946 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 2364 | Partial Sorting | combinatorics fft math number theory | Statement | E | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 2250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31214 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 9769 | Koxia and Number Theory | chinese remainder theorem math number theory | Statement | C | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1250.0 | Good Bye 2022 -- Editorial | |
| 11947 | Hossam and Trainees | math number theory | Statement | C | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 8895 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 1809 | Josuke and Complete Graph | binary search brute force data structures number theory | Statement | E | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1750.0 | 111841 | |
| 1978 | Three Chairs | bitmasks brute force combinatorics data structures number theory sortings | Statement | F | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2000.0 | 111841 | |
| 27385 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 1040 | Delicious Dessert | math number theory string suffix structures strings | Statement | G | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2500.0 | 111841 | |
| 6367 | Many Perfect Squares | brute force math number theory | Statement | D | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2000.0 | Tutorial | |
| 2520 | Game of the Year | brute force math number theory | Statement | E | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 15174 | Number Factorization | greedy math number theory | Statement | B | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1006 | Serval and Music Game | brute force combinatorics implementation math number theory | Statement | E | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2000.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 36141 | Serval and Mocha's Array | brute force math number theory | Statement | A | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 500.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1627 | Divisors and Table | dp number theory shortest paths | Statement | E | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 4608 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1691 | Li Hua and Array | brute force data structures math number theory | Statement | E | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 2250.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 9555 | Candy Store | greedy math number theory | Statement | C | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 860 (Div. 2) | 1700 |
| 688 | Gifts from Grandfather Ahmed | dp math number theory | Statement | F | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 860 (Div. 2) | 2500 |
| 758 | Another n-dimensional chocolate bar | dp number theory | Statement | F | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 13994 | Pull Your Luck | brute force greedy math number theory | Statement | C | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 483 | GCD Master (easy version) | greedy math number theory sortings | Statement | F1 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 19019 | Candies | constructive algorithms math number theory | Statement | B | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 750.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 14630 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 4947 | Trivial Conjecture | *special constructive algorithms math number theory | Statement | D | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 1336 | Factorization | *special number theory | Statement | F | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 466 | Bosco and Particle | dp math number theory strings | Statement | E | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #865 | 3100 |
| 9857 | Magic Triples (Easy Version) | brute force math number theory | Statement | G1 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 3126 | Magic Triples (Hard Version) | brute force math number theory | Statement | G2 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 13988 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 29966 | Lunatic Never Content | math number theory | Statement | B | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1000.0 | Codeforces Round #870 (Div. 2) Editorial | 1100 |
| 15886 | Dreaming of Freedom | greedy math number theory | Statement | C | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1500.0 | Codeforces Round #870 (Div. 2) Editorial | 1300 |
| 42012 | Permutation Swap | math number theory | Statement | B | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 1000.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 900 |
| 2327 | Hyperregular Bracket Strings | combinatorics hashing number theory sortings two pointers | Statement | C | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 2880 | MEX of LCM | binary search brute force data structures implementation math number theory two pointers | Statement | E | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 2500.0 | Codeforces Round #879 Editorial | |
| 707 | Doctor's Brown Hypothesis | dfs and similar graphs math number theory | Statement | D | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1750.0 | Codeforces Round 880 Editorial | |
| 17593 | No Prime Differences | constructive algorithms math number theory | Statement | C | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1205 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 13964 | Row Major | constructive algorithms math number theory strings | Statement | D | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 475 | Swimmers in the Pool | fft math number theory | Statement | F | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 981 | Vika and Stone Skipping | brute force math number theory | Statement | E | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2250.0 | Codeforces Round #885 (Div.2) Editorial | |
| 7255 | Vika and Price Tags | greedy math number theory | Statement | C | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 25340 | We Were Both Children | brute force implementation math number theory | Statement | F | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 48106 | Longest Divisors Interval | brute force combinatorics greedy math number theory | Statement | B | Codeforces Round 889 (Div. 2) {1855} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 25772 | Yet Another Permutation Problem | constructive algorithms math number theory | Statement | C | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1500.0 | Codeforces Round #893 (Div. 2) Editorial | 1000 |
| 13186 | The Walkway | brute force greedy implementation math number theory | Statement | B | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1250.0 | Codeforces Round #893 (Div. 2) Editorial | 1500 |
| 15484 | Divisor Chain | bitmasks constructive algorithms math number theory | Statement | C | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 9391 | Battling with Numbers | combinatorics math number theory | Statement | B | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 26742 | Non-coprime Split | math number theory | Statement | C | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 14097 | Jellyfish and Green Apple | bitmasks greedy math number theory | Statement | C | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 10262 | Effects of Anti Pimples | combinatorics number theory sortings | Statement | B | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1000.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 13115 | Joyboard | math number theory | Statement | C | Codeforces Round 902 (Div. 2, based on COMPFEST 15 - Final Round) {1877} | PROGRAMMING | 1500.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 5017 | Vasilije Loves Number Theory | math number theory | Statement | F | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 652 | Last Man Standing | data structures number theory | Statement | F | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2800 | |
| 30250 | Divide and Equalize | math number theory | Statement | D | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 1251 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 4281 | Counting Rhyme | brute force combinatorics dp math number theory sortings | Statement | D | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 2500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 4607 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 181 | Cyclic Hamming (Easy Version) | divide and conquer dp fft math number theory | Statement | H1 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 4000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 164 | Cyclic Hamming (Hard Version) | dp fft math number theory | Statement | H2 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 35415 | 250 Thousand Tons of TNT | brute force implementation number theory | Statement | B | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 99824 | Game with Integers | games math number theory | Statement | A | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 15863 | Yarik and Musical Notes | math number theory | Statement | D | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 5559 | Small GCD | brute force math number theory | Statement | D | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 17494 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 430 | Grid Game 2 | games number theory | Statement | G | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 16665 | Good Triples | brute force combinatorics number theory | Statement | E | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 1736 | Multiple Lamps | brute force constructive algorithms number theory | Statement | E | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 5191 | Split Plus K | greedy math number theory | Statement | D | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 33306 | Make Almost Equal With Mod | math number theory | Statement | B | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 28499 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 32766 | Two Divisors | constructive algorithms math number theory | Statement | B | Good Bye 2023 {1916} | PROGRAMMING | 750.0 | ||
| 239 | Optimizations From Chelsu | divide and conquer dp number theory trees | Statement | G | Good Bye 2023 {1916} | PROGRAMMING | 3750.0 | ||
| 20936 | Partitioning the Array | brute force number theory | Statement | C | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 23522 | A Balanced Problemset? | brute force greedy math number theory | Statement | B | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 15160 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 10533 | Physical Education Lesson | brute force math number theory | Statement | C | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1500.0 | Codeforces Round 924 Editorial | |
| 2253 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 3796 | One-Dimensional Puzzle | combinatorics constructive algorithms math number theory | Statement | G | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 1415 | Moving Platforms | graphs math number theory shortest paths | Statement | G | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 10448 | Final Countdown | implementation math number theory | Statement | E | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 24004 | Chaya Calendar | number theory | Statement | B | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 1215 | Turtle Magic: Royal Turtle Shell Pattern | bitmasks brute force combinatorics math | Statement | G | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 25679 | Turtle Fingers: Count the Values of k | brute force number theory | Statement | C | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 23930 | Turtle Tenacity: Continual Mods | constructive algorithms greedy number theory sortings | Statement | D | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 36950 | Turtle Math: Fast Three Task | implementation number theory | Statement | B | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 971 | GCD is Greater | bitmasks brute force number theory | Statement | H | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 26476 | Fireworks | math number theory | Statement | B | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 1290 | Nobody is needed | brute force data structures dp math number theory | Statement | F | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 3231 | Girl Permutation | combinatorics dp math number theory | Statement | E | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2250.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 17726 | Nearly Shortest Repeating Substring | brute force implementation number theory strings | Statement | E | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26741 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 3044 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 6052 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 1677 | Carousel of Combinations | brute force combinatorics dp math number theory | Statement | E | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2400 |
| 8278 | Missing Subsequence Sum | bitmasks constructive algorithms greedy number theory | Statement | B | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1250.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1800 |
| 16343 | Reverse Card (Easy Version) | brute force math number theory | Statement | B1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 500.0 | Tutorial | 1400 |
| 4965 | Reverse Card (Hard Version) | brute force math number theory | Statement | B2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 2200 |
| 29656 | Assembly via Remainders | constructive algorithms number theory | Statement | C | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1000 | |
| 39922 | Maximize? | brute force math number theory | Statement | A | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 345 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |
| 8167 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 1634 | Large Graph | data structures dsu graphs number theory | Statement | F | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2500.0 | 130527 | |
| 22492 | Earning on Bets | binary search combinatorics constructive algorithms number theory | Statement | C | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 1500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 17670 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 2217 | Turtle and Multiplication | constructive algorithms dfs and similar graphs number theory | Statement | D | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2000.0 | Simplified Chinese Tutorial | |
| 10158 | Beauty of the mountains | brute force data structures implementation math number theory | Statement | D | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1750.0 | 130839 | |
| 20036 | Collatz Conjecture | brute force implementation math number theory | Statement | B | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 12508 | D-Function | bitmasks combinatorics math number theory | Statement | G | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1956 | Permutation Problem (Simple Version) | brute force combinatorics math number theory | Statement | G1 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 1505 | Permutation Problem (Hard Version) | brute force data structures hashing math number theory | Statement | G2 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 7992 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 579 | Prime Split Game | fft games math number theory | Statement | H | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3500.0 | Video Tutorial | |
| 4301 | Ultra-Meow | combinatorics math number theory | Statement | G | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 7714 | Valuable Cards | dp greedy number theory two pointers | Statement | F | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1218 | Dyn-scripted Robot (Easy Version) | brute force chinese remainder theorem constructive algorithms math number theory | Statement | F1 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 578 | Dyn-scripted Robot (Hard Version) | chinese remainder theorem math number theory | Statement | F2 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 7714 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 10443 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 19978 | Fun | binary search brute force number theory | Statement | D | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 28519 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | Video Tutorial | |
| 1021 | Court Blue (Easy Version) | brute force dfs and similar dp math number theory | Statement | F1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 597 | Court Blue (Hard Version) | brute force dp math number theory | Statement | F2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 5200 | Not a Nim Problem | games math number theory | Statement | E | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 1281 | Alter the GCD | binary search data structures divide and conquer dp number theory | Statement | D | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2250.0 | Discussion stream (With Hints) | |
| 2107 | Eri and Expanded Sets | binary search data structures number theory two pointers | Statement | C | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1500.0 | Tutorial | |
| 25468 | Dora's Set | math number theory | Statement | A | Codeforces Round 969 (Div. 2) {2007} | PROGRAMMING | 500.0 | Tutorial | |
| 16374 | Dora and C++ | math number theory | Statement | C | Codeforces Round 969 (Div. 2) {2007} | PROGRAMMING | 1000.0 | Tutorial | |
| 6801 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 3660 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 15958 | Sakurako's Box | math number theory | Statement | F | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 4374 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 |