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 ... 28 29 30 31 32 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 341 | Managing Telephone Poles | Statement | M | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | |||
| 1698 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 798 | Knitting Batik | implementation math | Statement | K | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 4254 | Jeopardy of Dropped Balls | brute force dsu implementation | Statement | J | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1020 | Illusions of the Desert | data structures trees | Statement | I | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 766 | Holiday Wall Ornaments | strings | Statement | H | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 833 | GCD Festival | math | Statement | G | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 137 | Finding Expected Value | math | Statement | F | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 395 | Eye-Pleasing City Park Tour | Statement | E | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | |||
| 2868 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 193 | Cyclic Sum | data structures | Statement | C | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 537 | Building an Amusement Park | binary search geometry | Statement | B | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 5178 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 0 | Communication Routing Challenge | *special | Statement | A | 2021 ICPC Communication Routing Challenge: Marathon {1576} | PROGRAMMING | |||
| 511 | The Mind | constructive algorithms interactive probabilities | Statement | M | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 1433 | Labyrinth | binary search dsu | Statement | L | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 408 | Kingdom of Islands | graphs implementation | Statement | K | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 344 | Just Kingdom | data structures dfs and similar | Statement | J | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 72 | Interactive Rays | geometry interactive | Statement | I | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 2167 | Higher Order Functions | implementation strings | Statement | H | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 56 | Game of Chance | math probabilities | Statement | G | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 187 | Framing Pictures | geometry | Statement | F | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 4132 | Easy Scheduling | implementation math | Statement | E | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 55 | Dragon Curve | Statement | D | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | |||
| 12 | Cactus Lady and her Cing | Statement | C | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | |||
| 475 | Building Forest Trails | data structures dsu | Statement | B | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 422 | Anti-Tetris | constructive algorithms graphs shortest paths | Statement | A | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 11647 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 18875 | Shifting Sort | implementation sortings | Statement | B | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 18385 | Productive Meeting | graphs greedy | Statement | D | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 25116 | Permutation Minimization by Deque | constructive algorithms greedy math | Statement | E1 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2747 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 41939 | Casimir's String Solitaire | math strings | Statement | A | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 5344 | 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 | ||
| 7360 | Array Optimization by Deque | data structures greedy | Statement | E2 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3921 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 2231 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 1281 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 1101 | Subsequence | divide and conquer dp trees | Statement | D | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 2000.0 | Codeforces Round #745 Editorial | 2900 |
| 148 | Problems for Codeforces | fft math | Statement | F | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3300 |
| 124 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 12466 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 14269 | CQXYM Count Permutations | math | Statement | A | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 800 |
| 11578 | Vupsen, Pupsen and 0 | constructive algorithms math | Statement | D | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1750.0 | Codeforces Round #750 (Div.2) Editorial | |
| 4201 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 33185 | Luntik and Subsequences | combinatorics math | Statement | B | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 750.0 | Codeforces Round #750 (Div.2) Editorial | |
| 19737 | Luntik and Concerts | math | Statement | A | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 696 | Kuzya and Homework | data structures number theory | Statement | G | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 3250.0 | Codeforces Round #750 (Div.2) Editorial | |
| 2078 | Korney Korneevich and XOR (hard version) | binary search brute force dp two pointers | Statement | F2 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 6566 | Korney Korneevich and XOR (easy version) | bitmasks dp | Statement | F1 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2000.0 | Codeforces Round #750 (Div.2) Editorial | |
| 23542 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 14373 | 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) | |
| 400 | Omkar and Tours | sortings trees | Statement | H | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 495 | Omkar and Time Travel | data structures math | Statement | G | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 5929 | Omkar and the Meaning of Life | constructive algorithms interactive | Statement | D | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 13239 | Omkar and Heavenly Tree | constructive algorithms trees | Statement | B | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 7435 | Omkar and Determination | data structures dp | Statement | C | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 2484 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1534 | Defender of Childhood Dreams | bitmasks constructive algorithms divide and conquer | Statement | F | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 14347 | Coloring Rectangles | greedy | Statement | B | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 1000 |
| 3985 | Guess the Permutation | binary search combinatorics interactive math | Statement | D | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2000 |
| 1469 | Game with Stones | binary search data structures games greedy | Statement | E | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2300 |
| 1114 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 246 | Eligible Segments | geometry | Statement | G | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 3250.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3200 |
| 15529 | Mathematical Addition | math | Statement | A | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 800 |
| 17694 | Two Arrays | greedy math sortings | Statement | C | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 900 |
| 4378 | Yet Another Sorting Problem | math | Statement | D | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 2000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 304 | Poachers | dp games graphs trees | Statement | G | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 1665 | Non-equal Neighbours | combinatorics dp math | Statement | F | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 12812 | Minimize Distance | greedy | Statement | C | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 1500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 18903 | Life of a Flower | implementation | Statement | A | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 1206 | Frequency Queries | data structures dfs and similar trees | Statement | E | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 16127 | Array Eversion | greedy | Statement | B | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 1000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 298 | Omkar and Mosaic | combinatorics constructive algorithms math | Statement | I | Codeforces Round 749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1) {1586} | PROGRAMMING | 4000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 353 | Jumping Through the Array | data structures graphs two pointers | Statement | F | Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) {1588} | PROGRAMMING | 3750.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3500 |
| 1410 | Yet Another Sorting Problem | data structures math sortings | Statement | D | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 2000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 336 | Non-equal Neighbours | combinatorics data structures dp math | Statement | F | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 5097 | Minimize Distance | greedy math | Statement | C | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 1500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 10692 | Life of a Flower | implementation | Statement | A | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 293 | Frequency Queries | data structures dfs and similar | Statement | E | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 8454 | Array Eversion | greedy | Statement | B | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 1000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 17076 | Hemose Shopping | dsu math sortings | Statement | B | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1000.0 | 95583 | |
| 2564 | 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 | |
| 23754 | Gamer Hemose | greedy math sortings | Statement | A | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 500.0 | 95583 | |
| 1919 | Bored Bakry | bitmasks greedy math two pointers | Statement | E | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2500.0 | 95583 | |
| 9113 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 968 | Alice and Recoloring 2 | flows graph matchings greedy | Statement | F2 | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1750.0 | 95583 | |
| 1078 | Alice and Recoloring 1 | greedy | Statement | F1 | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1750.0 | 95583 | |
| 27845 | Save More Mice | binary search greedy greedy | Statement | C | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 2651 | Red-Black Number | dp implementation math | Statement | F | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 40451 | Make it Divisible by 25 | dp greedy math math | Statement | B | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 5559 | Half of Same | dp math number theory | Statement | D2 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 14698 | Gardener and Tree | dfs and similar greedy implementation trees | Statement | E | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 41438 | Elections | Statement | A | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | |||
| 1886 | Changing Brackets | data structures greedy | Statement | G | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 21770 | All are Same | math number theory | Statement | D1 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 22109 | Special Numbers | bitmasks math | Statement | B | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1000.0 | 95525 | 1100 |
| 28173 | Make Them Equal | brute force greedy math strings | Statement | C | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 1200 |
| 12185 | Rubik's Cube Coloring (easy version) | combinatorics math | Statement | E1 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1000.0 | 95525 | 1300 |
| 9348 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 1610 | Rubik's Cube Coloring (hard version) | brute force dp implementation math trees | Statement | E2 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 2300 |
| 1535 | Ideal Farm | constructive algorithms math | Statement | F | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 2750.0 | 95525 | 2400 |
| 27073 | Consecutive Sum Riddle | math | Statement | A | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 500.0 | 95525 | 800 |
| 10460 | Training Session | combinatorics math | Statement | D | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 404 | The Sum of Good Numbers | hashing probabilities | Statement | G | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 2493 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 1625 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 16929 | Groups | brute force implementation | Statement | B | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 23614 | Delete Two Elements | data structures math | Statement | C | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 25605 | Computer Game | dfs and similar dp implementation | Statement | A | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 860 | Weights | constructive algorithms greedy two pointers | Statement | A | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 89 | Two Arrays | data structures matrices | Statement | E | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 408 | Shortest path | brute force geometry math | Statement | G | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 160 | Restaurant Game | Statement | B | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | |||
| 409 | Mars | Statement | F | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | |||
| 1272 | Hidden Fortress | interactive math | Statement | H | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 132 | Desert | data structures graphs | Statement | I | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 1962 | Bubble Strike | combinatorics math probabilities ternary search | Statement | C | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 34 | Bubble Popping | Statement | D | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | |||
| 328 | Bob's Beautiful Array | bitmasks brute force greedy | Statement | J | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 4413 | Robot Factory | bitmasks dfs and similar | Statement | J | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2) {1600} | PROGRAMMING | BubbleCup2021.pdf | ||
| 615 | Party Organization | probabilities | Statement | F | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2) {1600} | PROGRAMMING | BubbleCup2021.pdf | ||
| 2364 | Array Game | games greedy two pointers | Statement | E | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2) {1600} | PROGRAMMING | BubbleCup2021.pdf | ||
| 20997 | Array Elimination | bitmasks math number theory | Statement | A | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 500.0 | 95865 | 1300 |
| 5497 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 2342 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 1929 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 596 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 275 | Two Sorts | binary search math | Statement | F | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 3000.0 | 95865 | 3400 |
| 14740 | Divine Array | constructive algorithms implementation | Statement | B | Codeforces Round 751 (Div. 2) {1602} | PROGRAMMING | 1000.0 | 95865 | 1100 |
| 19716 | Two Subsequences | implementation | Statement | A | Codeforces Round 751 (Div. 2) {1602} | PROGRAMMING | 500.0 | 95865 | 800 |
| 348 | October 18, 2017 | combinatorics dp implementation math | Statement | F | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3750.0 | Editorial of Codeforces Round #752 | |
| 634 | A Perfect Problem | combinatorics dp | Statement | E | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #752 | |
| 17816 | 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 |
| 15063 | 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 |
| 2263 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 878 | 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 |
| 16262 | XOR Specia-LIS-t | constructive algorithms | Statement | B | Codeforces Round 752 (Div. 2) {1604} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1100 |
| 22627 | Era | greedy | Statement | A | Codeforces Round 752 (Div. 2) {1604} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #752 | 800 |
| 19245 | Reverse Sort | greedy sortings | Statement | B | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1000.0 | tutorial | 1000 |
| 18834 | Dominant Character | brute force implementation strings | Statement | C | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1500.0 | tutorial | 1400 |
| 3245 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 1182 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 429 | PalindORme | combinatorics dp | Statement | F | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 3500.0 | tutorial | 2900 |
| 21634 | A.M. Deviation | math number theory | Statement | A | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 500.0 | tutorial | 800 |
| 19502 | Update Files | implementation math | Statement | B | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 661 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 1576 | Red-Blue Matrix | constructive algorithms data structures hashing implementation sortings two pointers | Statement | D | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 15197 | Banknotes | constructive algorithms greedy | Statement | C | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 4179 | Arena | combinatorics dp | Statement | E | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 37300 | AB Balance | constructive algorithms strings | Statement | A | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 2126 | Robot on the Board 2 | dfs and similar graphs | Statement | F | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 10013 | Robot on the Board 1 | implementation | Statement | E | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 39287 | Odd Grasshopper | math | Statement | B | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 26811 | Minimum Extraction | brute force sortings | Statement | C | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 40644 | Linear Keyboard | implementation strings | Statement | A | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 18116 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1421 | Banquet Preparations 2 | greedy sortings | Statement | H | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1742 | Banquet Preparations 1 | greedy | Statement | G | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 484 | The Cells on the Paper | binary search data structures implementation sortings | Statement | E | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 836 | MEX counting | combinatorics dp | Statement | F | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 7357 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 20245 | Find Array | constructive algorithms math | Statement | A | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 250.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 1552 | Dominoes | combinatorics fft graphs math | Statement | D | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 12476 | Build the Permutation | constructive algorithms greedy | Statement | B | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 243 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 12141 | William the Vigilant | implementation strings | Statement | B | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1000.0 | Deltix Round, Autumn 2021. Editorial | 1100 |
| 10446 | 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 |
| 8378 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 2445 | William The Oblivious | data structures divide and conquer dp matrices | Statement | E | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2750.0 | Deltix Round, Autumn 2021. Editorial | 2400 |
| 958 | Interesting Sections | binary search data structures divide and conquer geometry meet-in-the-middle | Statement | F | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3000.0 | Deltix Round, Autumn 2021. Editorial | 2800 |
| 484 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 104 | Pushing Robots | Statement | H | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3750.0 | Deltix Round, Autumn 2021. Editorial | 3500 | |
| 18877 | 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 |
| 627 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 3035 | Not Quite Lee | combinatorics math number theory | Statement | D | Codeforces Global Round 17 {1610} | PROGRAMMING | 2250.0 | Codeforces Global Round 17 Editorial | |
| 338 | Mashtali vs AtCoder | games trees | Statement | I | Codeforces Global Round 17 {1610} | PROGRAMMING | 4000.0 | Codeforces Global Round 17 Editorial | |
| 704 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 15570 | Keshi Is Throwing a Party | binary search greedy | Statement | C | Codeforces Global Round 17 {1610} | PROGRAMMING | 1500.0 | Codeforces Global Round 17 Editorial | |
| 23277 | Kalindrome Array | greedy two pointers | Statement | B | Codeforces Global Round 17 {1610} | PROGRAMMING | 1000.0 | Codeforces Global Round 17 Editorial | |
| 17065 | Anti Light's Cell Guessing | constructive algorithms implementation math | Statement | A | Codeforces Global Round 17 {1610} | PROGRAMMING | 500.0 | Codeforces Global Round 17 Editorial | |
| 654 | AmShZ Wins a Bet | data structures hashing | Statement | G | Codeforces Global Round 17 {1610} | PROGRAMMING | 3250.0 | Codeforces Global Round 17 Editorial | |
| 1922 | AmShZ and G.O.A.T. | binary search brute force greedy math | Statement | E | Codeforces Global Round 17 {1610} | PROGRAMMING | 2500.0 | Codeforces Global Round 17 Editorial | |
| 19351 | Polycarp Recovers the Permutation | constructive algorithms | Statement | C | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1000 | |
| 11583 | Weights Assignment For Tree Edges | constructive algorithms trees | Statement | D | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1500 | |
| 8339 | Escape The Maze (easy version) | dfs and similar greedy shortest paths trees two pointers | Statement | E1 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 7368 | ATM and Students | binary search data structures two pointers | Statement | F | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 4311 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 738 | Robot and Candies | data structures greedy | Statement | G | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2500 | |
| 31888 | Team Composition: Programmers and Mathematicians | binary search constructive algorithms math | Statement | B | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 33386 | Make Even | constructive algorithms math | Statement | A | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 10251 | X-Magic Pair | math number theory | Statement | D | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 18424 | Special Permutation | constructive algorithms | Statement | B | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 2807 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 998 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 18207 | Distance | brute force constructive algorithms | Statement | A | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 25687 | Chat Ban | binary search math | Statement | C | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 692 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 830 | Tree Coloring | combinatorics fft | Statement | F | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 29632 | Poisoned Dagger | binary search | Statement | C | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 5298 | MEX Sequences | dp | Statement | D | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 26611 | Long Comparison | implementation | Statement | A | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 5882 | Crazy Robot | constructive algorithms dfs and similar graphs | Statement | E | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 23296 | Absent Remainder | implementation | Statement | B | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 28895 | Divan and a New Project | constructive algorithms sortings | Statement | B | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 750.0 | Tutorial | 1000 |
| 11295 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 4468 | Divan and Kostomuksha (easy version) | dp number theory | Statement | D1 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 2100 |
| 2741 | Divan and Kostomuksha (hard version) | dp number theory | Statement | D2 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1000.0 | Tutorial | 2300 |
| 948 | Divan and a Cottage | binary search data structures | Statement | E | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 2750.0 | Tutorial | 2600 |
| 24581 | Divan and a Store | brute force constructive algorithms greedy | Statement | A | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 2132 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 386 | Reindeer Games | constructive algorithms flows graphs shortest paths | Statement | H | Codeforces Global Round 18 {1615} | PROGRAMMING | 4000.0 | Global Round 18 Editorial | |
| 1698 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 9186 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 172 | Maximum Adjacent Pairs | constructive algorithms graph matchings | Statement | G | Codeforces Global Round 18 {1615} | PROGRAMMING | 3750.0 | Global Round 18 Editorial | |
| 1148 | LEGOndary Grandmaster | combinatorics dp math | Statement | F | Codeforces Global Round 18 {1615} | PROGRAMMING | 3000.0 | Global Round 18 Editorial | |
| 21570 | Closing The Gap | greedy math | Statement | A | Codeforces Global Round 18 {1615} | PROGRAMMING | 250.0 | Global Round 18 Editorial | |
| 17886 | And It's Non-Zero | bitmasks greedy math | Statement | B | Codeforces Global Round 18 {1615} | PROGRAMMING | 1000.0 | Global Round 18 Editorial | |
| 20686 | Mirror in the String | greedy strings | Statement | B | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1000.0 | Good Bye 2021 -- Editorial | 1100 |
| 13192 | Representative Edges | brute force geometry implementation math | Statement | C | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1500.0 | Good Bye 2021 -- Editorial | 1500 |
| 5557 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 2711 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 719 | Tricolor Triangles | graphs math matrices | Statement | F | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3000.0 | Good Bye 2021 -- Editorial | 2900 |
| 1232 | Keep XOR Low | bitmasks combinatorics divide and conquer dp math | Statement | H | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 4000.0 | Good Bye 2021 -- Editorial | 3000 |
| 424 | Just Add an Edge | dfs and similar dp graphs | Statement | G | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3500.0 | Good Bye 2021 -- Editorial | 3500 |
| 23813 | Integer Diversity | implementation | Statement | A | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 500.0 | Good Bye 2021 -- Editorial | 800 |
| 2021 | Too Many Impostors (hard version) | constructive algorithms interactive | Statement | D2 | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 5161 | Too Many Impostors (easy version) | constructive algorithms interactive | Statement | D1 | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 15991 | Paprika and Permutation | greedy math | Statement | C | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 26684 | GCD Problem | brute force constructive algorithms math | Statement | B | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 17001 | Forbidden Subsequence | constructive algorithms sortings strings | Statement | A | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1014 | 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) | |
| 1924 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 7781 | Singers' Tour | constructive algorithms math | Statement | E | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 4725 | Reverse | bitmasks implementation math strings | Statement | F | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 34352 | Polycarp and Sums of Subsequences | math | Statement | A | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 32283 | Paint the Array | math | Statement | C | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 23822 | Missing Bigram | implementation | Statement | B | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 20875 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 22626 | Wrong Addition | implementation | Statement | C | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2728 | Unusual Minesweeper | binary search dfs and similar dsu implementation sortings | Statement | G | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 62671 | Square String? | implementation strings | Statement | A | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 32912 | Squares and Cubes | implementation math | Statement | B | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 1429 | Permutation and Queries | brute force data structures | Statement | H | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 8442 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 10195 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2336 | Let's Play the Hat? | constructive algorithms math | Statement | F | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 31323 | Triangles on a Rectangle | geometry greedy math | Statement | B | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1155 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 9637 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 |