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 ... 8 9 10 11 12 13 14 15 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 7789 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 250 | Deducing Sortability | binary search bitmasks math | Statement | D | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1993 | Circular Mirror | binary search combinatorics math two pointers | Statement | C | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 6776 | Garage | binary search math | Statement | G | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 3046 | Hot Black Hot White | constructive algorithms math | Statement | H | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 10223 | Accumulation of Dominoes | math | Statement | A | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 17039 | Mainak and Interesting Sequence | bitmasks constructive algorithms math | Statement | B | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 1000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 1760 | Almost Perfect | combinatorics fft math | Statement | E | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2250.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 117 | Mainak and the Bleeding Polygon | geometry implementation math | Statement | H | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 3500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 38885 | Mainak and Array | greedy math | Statement | A | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 500.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 2065 | 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 | ||
| 25506 | Colored Balls: Revisited | greedy implementation sortings | Statement | A | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 4607 | Kirei and the Linear Function | brute force math | Statement | F | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 46344 | Two Elevators | math | Statement | A | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 18043 | Minimum Notation | data structures greedy math sortings | Statement | C | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1500.0 | Codeforces Round #823 — editorial | 1200 |
| 17962 | Meeting on the Line | binary search greedy implementation math ternary search | Statement | B | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1000.0 | Codeforces Round #823 — editorial | 1600 |
| 12486 | 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 | |
| 910 | Function Sum | brute force combinatorics dp fft math | Statement | F | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2750.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 3551 | 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 | |
| 23741 | Joey Takes Money | greedy math | Statement | A | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 28195 | Kill Demodogs | greedy math | Statement | B | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 17763 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 17534 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 21233 | Rule of League | constructive algorithms math | Statement | B | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1000.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15138 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1567 | Conveyor | dp math | Statement | E | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 2750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1013 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 3304 | Rectangular Congruence | constructive algorithms math number theory | Statement | E | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 30214 | Removing Smallest Multiples | greedy math | Statement | C | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 1250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 22484 | Select Three Sticks | greedy math sortings | Statement | A | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 500.0 | Codeforces Round #822 (Div.2) Editorial | |
| 7063 | Meta-set | brute force combinatorics data structures hashing math | Statement | D | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1750.0 | Codeforces Round #824 — editorial | |
| 21124 | Working Week | constructive algorithms greedy math | Statement | A | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 500.0 | Codeforces Round #824 — editorial | |
| 19517 | Tea with Tangerines | greedy math | Statement | B | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 750.0 | Codeforces Round #824 — editorial | |
| 20565 | Playing with GCD | math number theory | Statement | B | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 10231 | Ela's Fitness and the Luxury Number | binary search implementation math | Statement | B | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1000.0 | Editorial of Dytechlab Cup 2022 | |
| 162 | Ela and Prime GCD | constructive algorithms math number theory | Statement | F | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3500.0 | Editorial of Dytechlab Cup 2022 | |
| 6468 | Ela and Crickets | games implementation math | Statement | C | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1500.0 | Editorial of Dytechlab Cup 2022 | |
| 1844 | Balance Addicts | combinatorics dp math two pointers | Statement | E | Codeforces Global Round 22 {1738} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 19051 | Prefix Sum Addicts | constructive algorithms math sortings | Statement | B | Codeforces Global Round 22 {1738} | PROGRAMMING | 1000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 12989 | Even Number Addicts | dp games greedy math | Statement | C | Codeforces Global Round 22 {1738} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 24619 | Array Recovery | constructive algorithms greedy math | Statement | B | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 9143 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 1137 | Conditional Mix | combinatorics dp math | Statement | F | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2500.0 | Tutorial | 2600 |
| 23374 | Factorise N+M | math number theory | Statement | A | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 2968 | Multi-Colored Segments | binary search data structures math sortings | Statement | F | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 19556 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 26856 | Funny Permutation | constructive algorithms math | Statement | B | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 40689 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 13587 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 1844 | Intersection and Union | combinatorics data structures dp math matrices | Statement | F | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2300 | |
| 352 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 12971 | Divisible Numbers (easy version) | brute force math number theory | Statement | E1 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 6963 | Divisible Numbers (hard version) | brute force math number theory | Statement | E2 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 3881 | MEX vs MED | brute force math two pointers | Statement | F | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24769 | Divisibility by 2^n | greedy math sortings | Statement | D | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 24999 | Even-Odd Increments | implementation math | Statement | B | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 1785 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 14171 | Permutation Operations | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 23 {1746} | PROGRAMMING | 1000.0 | Codeforces Global Round 23 Editorial | |
| 570 | Joking (Hard Version) | dp interactive | Statement | E2 | Codeforces Global Round 23 {1746} | PROGRAMMING | 1750.0 | Codeforces Global Round 23 Editorial | |
| 695 | List Generation | combinatorics math | Statement | E | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 2500.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 25382 | The Ultimate Square | math | Statement | A | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 500.0 | Codeforces Round #833 (Div. 2) Editorial | 800 |
| 6429 | Counting Arrays | math number theory | Statement | D | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 1697 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 7551 | 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 | |
| 17868 | Indirect Sort | constructive algorithms math | Statement | A | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 393 | Doping | dp dp math math | Statement | G | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 15217 | Factorial Divisibility | greedy math | Statement | B | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 750.0 | Tutorial | 1600 |
| 5418 | Wish I Knew How to Sort | dp math probabilities | Statement | C | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 1750.0 | Tutorial | 2000 |
| 19762 | Kevin and Permutation | constructive algorithms constructive algorithms math | Statement | B | Codeforces Round 829 (Div. 2) {1754} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 8599 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 236 | Decent Division | data structures | Statement | F | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 3000.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 5628 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4564 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 19549 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 23728 | Lost Permutation | math | Statement | B | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 10640 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 23200 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 2877 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 109 | Anti-median (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 299 | Anti-median (Easy Version) | dp math | Statement | F1 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 10219 | Binary Strings are Fun | combinatorics dp | Statement | C | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 20681 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 17093 | Absolute Maximization | bitmasks constructive algorithms greedy math | Statement | A | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2396 | Valid Bitonic Permutations | combinatorics dp implementation math | Statement | D | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2250 | Node Pairs | dp graphs math | Statement | E | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 795 | Doremy's Perfect DS Class (Easy Version) | binary search interactive | Statement | G1 | Codeforces Global Round 24 {1764} | PROGRAMMING | 2000.0 | Codeforces Global Round 24 Editorial | |
| 725 | Doremy's Perfect DS Class (Medium Version) | binary search interactive | Statement | G2 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 619 | Doremy's Perfect DS Class (Hard Version) | binary search interactive | Statement | G3 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 1238 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 3200 | Doremy's Pegging Game | combinatorics geometry math | Statement | D | Codeforces Global Round 24 {1764} | PROGRAMMING | 1750.0 | Codeforces Global Round 24 Editorial | |
| 10521 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 18095 | Doremy's Perfect Math Class | number theory | Statement | B | Codeforces Global Round 24 {1764} | PROGRAMMING | 1000.0 | Codeforces Global Round 24 Editorial | |
| 11979 | Exchange | math | Statement | E | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1000 | |
| 34295 | Minimum LCM | math | Statement | M | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1000 | |
| 6836 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 10932 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 49412 | Extremely Round | implementation math | Statement | A | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 2355 | Partial Sorting | combinatorics fft math number theory | Statement | E | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 2250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 25854 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31192 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 996 | Koxia and Sequence | bitmasks combinatorics math | Statement | F | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2500.0 | Good Bye 2022 -- Editorial | |
| 9759 | 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 | |
| 1634 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 195 | Koxia and Bracket | divide and conquer fft math | Statement | G | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 3250.0 | Good Bye 2022 -- Editorial | |
| 1637 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 25562 | Hossam and Combinatorics | combinatorics math sortings | Statement | A | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 11921 | Hossam and Trainees | math number theory | Statement | C | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 1634 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 26419 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 18782 | Absolute Sorting | math | Statement | D | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 560 | Game of Questions | bitmasks dp math probabilities | Statement | G | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2800 | ||
| 23668 | Add Plus Minus Sign | constructive algorithms math | Statement | A | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 14789 | Interesting Sequence | binary search bitmasks math | Statement | C | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 916 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 3941 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 8855 | 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 | |
| 12330 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 171 | Uniform Chemistry | dp math | Statement | K | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 104 | Count Permutations | math | Statement | N | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 47049 | Everybody Likes Good Arrays! | greedy math | Statement | A | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 19382 | Emordnilap | greedy math | Statement | B | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 12806 | Quiz Master | math sortings two pointers | Statement | C | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1160 | The Tree Has Fallen! | bitmasks dfs and similar math trees | Statement | E | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 3521 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 955 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 14618 | The Forbidden Permutation | greedy math | Statement | B | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1000.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 24129 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 25148 | MKnez's ConstructiveForces Task | constructive algorithms math | Statement | B | Hello 2023 {1779} | PROGRAMMING | 750.0 | ||
| 14672 | Least Prefix Sum | data structures greedy | Statement | C | Hello 2023 {1779} | PROGRAMMING | 1250.0 | ||
| 5900 | Bit Guessing Game | binary search bitmasks interactive | Statement | D | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1500.0 | 111841 | |
| 27247 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 1028 | Delicious Dessert | math number theory string suffix structures strings | Statement | G | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2500.0 | 111841 | |
| 14959 | Going to the Cinema | binary search math sortings two pointers | Statement | B | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1000.0 | Tutorial | |
| 1358 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 6359 | Many Perfect Squares | brute force math number theory | Statement | D | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2000.0 | Tutorial | |
| 16125 | Parallel Projection | math | Statement | A | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 500.0 | Tutorial | |
| 2511 | 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 | ||
| 3690 | Letter Exchange | constructive algorithms constructive algorithms | Statement | B | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 1250.0 | Codeforces Round #850 Editorial | |
| 2781 | The Harmonization of XOR | bitmasks constructive algorithms greedy math | Statement | E | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 835 | Inverse Transformation | constructive algorithms implementation math | Statement | F | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20480 | Exponential Equation | constructive algorithms math | Statement | A | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8433 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 15156 | 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 | |
| 4752 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 56612 | One and Two | brute force math | Statement | A | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 22575 | Sum of Two Numbers | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 19615 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 994 | 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 | |
| 35904 | 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 | |
| 10049 | Serval and Toxel's Arrays | combinatorics implementation math | Statement | C | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1250.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 4129 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 27081 | Premutation | brute force implementation math | Statement | C | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 29124 | Taisia and Dice | greedy greedy math | Statement | B | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 41375 | Polycarp and the Day of Pi | implementation math strings | Statement | A | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 53411 | Following Directions | geometry implementation | Statement | B | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 17030 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 8315 | Fixed Prefix Permutations | binary search data structures math sortings strings | Statement | D | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 24419 | Stand-up Comedian | greedy math | Statement | B | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 17231 | Fedya and Array | constructive algorithms math | Statement | B | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1000.0 | Codeforces Round #852 Editorial | |
| 18887 | Yet Another Promotion | greedy math | Statement | A | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 500.0 | Codeforces Round #852 Editorial | |
| 23256 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 4596 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 42602 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 2425 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 13642 | Triangle Coloring | combinatorics math | Statement | D | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12332 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 251 | Strange Triples | math | Statement | F | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1678 | 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 | |
| 14725 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 9538 | 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 |
| 675 | 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 |
| 12917 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 1117 | Count Voting | combinatorics dp math | Statement | G | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3000.0 | Codeforces Round #854 Editorial | |
| 1425 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 7020 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 12426 | Recent Actions | data structures greedy implementation math | Statement | A | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 500.0 | Codeforces Round #854 Editorial | |
| 4866 | Dasha and Nightmares | bitmasks hashing meet-in-the-middle | Statement | F | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 14822 | Settlement of Guinea Pigs | implementation math | Statement | B | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 750.0 | Codeforces Round #857 Editorial | |
| 13976 | 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 | |
| 18749 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 14329 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1408 | Survival of the Weakest (easy version) | brute force math sortings | Statement | F1 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1948 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 8752 | Sequence Master | brute force constructive algorithms math | Statement | C | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1750.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 1241 | DSU Master | combinatorics dp dsu math | Statement | D | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 46408 | Walking Master | geometry greedy math | Statement | A | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 482 | 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 | |
| 487 | GCD Master (hard version) | greedy math sortings | Statement | F2 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 17175 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 29270 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 31606 | Playing in a Casino | math sortings | Statement | B | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 1200 |
| 609 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 1106 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22628 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 15383 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 8644 | Climbing the Tree | binary search math | Statement | D | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1250.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 19011 | 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!) | |
| 691 | M-tree | data structures | Statement | F | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 176 | Last Number | math | Statement | H | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2180 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14614 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2564 | Vlad and the Nice Paths (easy version) | combinatorics dp math | Statement | G1 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 8761 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 34927 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 22521 | Conveyor Belts | math | Statement | B | 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 | ||
| 175 | Expected Twist | *special interactive | Statement | H | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 11717 | Long Legs | brute force math | Statement | B | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 12591 | Search in Parallel | greedy math sortings | Statement | C | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 54904 | Coins | math | Statement | A | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 16162 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 3670 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 1538 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 465 | 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 |
| 324 | OH NO1 (-2-3-4) | constructive algorithms graphs math shortest paths | Statement | F | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #865 | 3500 |
| 18950 | Ian Visits Mary | constructive algorithms geometry | Statement | A | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 800 |
| 1247 | Similar Polynomials | math | Statement | C | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1250.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1767 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 383 | Roads in E City | interactive math probabilities trees | Statement | E | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 24342 | JoJo's Incredible Adventures | math strings two pointers | Statement | B | Codeforces Round 866 (Div. 2) {1820} | PROGRAMMING | 1000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 5587 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 16357 | Tear It Apart | brute force implementation math strings | Statement | C | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 994 | Timber | combinatorics dp fft math | Statement | F | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 21325 | Matching | combinatorics math | Statement | A | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2757 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 9833 | Magic Triples (Easy Version) | brute force math number theory | Statement | G1 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 3120 | Magic Triples (Hard Version) | brute force math number theory | Statement | G2 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 19195 | Super-Permutation | constructive algorithms math | Statement | D | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 26723 | Karina and Array | greedy math | Statement | B | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 12547 | Making Anti-Palindromes | greedy math strings | Statement | E | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 24906 | Bun Lover | math | Statement | C | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4354 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 18281 | Sort with Step | brute force math sortings | Statement | B | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1000.0 | 115465 | |
| 17271 | A-characteristic | combinatorics constructive algorithms math | Statement | A | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 500.0 | 115465 | |
| 1347 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 1492 | Removing Graph | games graphs math | Statement | E | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 13977 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 6246 | LuoTianyi and the Floating Islands (Easy Version) | combinatorics math probabilities trees | Statement | B1 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1800 |
| 3532 | LuoTianyi and the Floating Islands (Hard Version) | combinatorics dfs and similar math probabilities trees | Statement | B2 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2300 |
| 16270 | LuoTianyi and the Table | greedy math | Statement | B | Codeforces Round 872 (Div. 2) {1825} | PROGRAMMING | 1000.0 | CodeForces Round 872(Div. 1&2) Editorial | 1000 |
| 29784 | Lunatic Never Content | math number theory | Statement | B | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1000.0 | Codeforces Round #870 (Div. 2) Editorial | 1100 |
| 15866 | 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 |
| 478 | Fading into Fog | geometry interactive math probabilities | Statement | F | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 3000.0 | Codeforces Round #870 (Div. 2) Editorial | 2800 |
| 30400 | Counting Orders | combinatorics math sortings two pointers | Statement | A | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 1100 |
| 25468 | Divisible Array | constructive algorithms math | Statement | A | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 800 |
| 41734 | Permutation Swap | math number theory | Statement | B | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 1000.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 900 |
| 22242 | Forever Winter | dfs and similar graphs math | Statement | F | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1300 | |
| 15835 | Hits Different | data structures dp implementation math | Statement | G | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1600 | |
| 11232 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 5939 | The BOSS Can Count Pairs | brute force data structures math | Statement | B | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1000.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial |