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 ... 19 20 21 22 23 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4486 | Median String | bitmasks math number theory strings | Statement | E | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1900 | |
| 2382 | Two Merged Sequences | dp greedy | Statement | G | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 2600 | |
| 22259 | Diverse Strings | implementation strings | Statement | A | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 900 | |
| 9377 | Thanos Sort | implementation | Statement | A | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 1200 | Pigeon d'Or | implementation | Statement | D | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 548 | Neat Words | Statement | F | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | |||
| 838 | Mystery Circuit | bitmasks brute force | Statement | C | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 1512 | Kanban Numbers | brute force | Statement | B | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 449 | Fourier Doodles | Statement | E | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | |||
| 197 | AI Takeover | Statement | G | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | |||
| 9448 | Hate "A" | implementation strings | Statement | B | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 1100 | |
| 4325 | Tree Diameter | bitmasks graphs interactive | Statement | C | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 1700 | |
| 1232 | Frog Jumping | dfs and similar math number theory | Statement | D | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2100 | |
| 1400 | Leaf Partition | dp trees | Statement | F | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1109 | Hot is Cold | bitmasks data structures divide and conquer implementation | Statement | E | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1136 | Zoning Restrictions | dp flows graphs | Statement | G | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2600 | |
| 808 | Satanic Panic | dp geometry | Statement | H | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2800 | |
| 23862 | Love "A" | implementation strings | Statement | A | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 600 | |
| 5643 | Hide and Seek | graphs | Statement | A | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 1500 | |
| 3129 | Chladni Figure | brute force strings | Statement | B | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 1900 | |
| 3741 | Thanos Nim | games | Statement | C | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 2100 | |
| 883 | Palindrome XOR | dfs and similar graphs | Statement | D | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 2600 | |
| 520 | Rainbow Coins | interactive | Statement | E | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 2900 | |
| 406 | Zigzag Game | games interactive | Statement | F | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 3400 | |
| 5701 | Crazy Diamond | constructive algorithms sortings | Statement | C | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1700 | |
| 8044 | Born This Way | binary search brute force two pointers | Statement | B | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1700 | |
| 5305 | Dirty Deeds Done Dirt Cheap | greedy sortings | Statement | D | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1800 | |
| 1863 | Earth Wind and Fire | constructive algorithms greedy math sortings two pointers | Statement | E | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2300 | |
| 1192 | Foo Fighters | bitmasks constructive algorithms | Statement | F | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2500 | |
| 664 | Gold Experience | constructive algorithms graphs math number theory probabilities | Statement | G | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 3100 | |
| 412 | Holy Diver | data structures | Statement | H | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 3600 | |
| 15630 | Another One Bites The Dust | greedy | Statement | A | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 700 | |
| 18257 | Prefix Sum Primes | constructive algorithms greedy math number theory | Statement | A | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 1300 | |
| 2086 | Three Religions | dp implementation strings | Statement | B | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2200 | |
| 1757 | Tree Generator™ | data structures implementation trees | Statement | C | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 1145 | Abandoning Roads | brute force dp graphs greedy | Statement | D | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 896 | Election Promises | games graphs | Statement | E | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 3100 | |
| 11930 | Tiling Challenge | greedy implementation | Statement | B | Codeforces Round 556 (Div. 2) {1150} | PROGRAMMING | 66783 | 1100 | |
| 12647 | Stock Arbitraging | greedy implementation | Statement | A | Codeforces Round 556 (Div. 2) {1150} | PROGRAMMING | 66783 | 900 | |
| 12017 | Maxim and Biology | brute force strings | Statement | A | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1000 | |
| 9244 | Stas and the Queue at the Buffet | greedy math sortings | Statement | D | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1500 | |
| 13196 | Dima and a Bad XOR | bitmasks brute force constructive algorithms dp | Statement | B | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1600 | |
| 5643 | Problem for Nazar | constructive algorithms math | Statement | C | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1700 | |
| 3876 | Number of Components | combinatorics data structures dp math | Statement | E | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2100 | |
| 1532 | Sonya and Informatics | combinatorics dp matrices probabilities | Statement | F | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2500 | |
| 9479 | Neko Performs Cat Furrier Transform | bitmasks constructive algorithms dfs and similar math | Statement | B | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1300 | |
| 7166 | Neko does Maths | brute force math number theory | Statement | C | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1800 | |
| 2611 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 1172 | Neko and Flashback | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2500 | |
| 895 | Neko Rules the Catniverse (Small Version) | bitmasks dp matrices | Statement | F1 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 1152 | Neko Rules the Catniverse (Large Version) | bitmasks dp matrices | Statement | F2 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 16321 | Neko Finds Grapes | greedy implementation math | Statement | A | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 800 | |
| 12228 | Serval and Bus | brute force math | Statement | A | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1100 | |
| 9439 | Serval and Toy Bricks | constructive algorithms greedy | Statement | B | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1200 | |
| 7828 | Serval and Parenthesis Sequence | greedy strings | Statement | C | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1600 | |
| 5694 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 1805 | Serval and Snake | binary search brute force interactive | Statement | E | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 2100 | |
| 1018 | Serval and Bonus Problem | combinatorics dp math probabilities | Statement | F | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 2800 | |
| 17853 | Make Them Equal | math | Statement | B | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1200 | |
| 10658 | Walking Robot | greedy | Statement | D | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1400 | |
| 11643 | Gourmet Cat | implementation math | Statement | C | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1400 | |
| 7094 | Two Teams | data structures implementation sortings | Statement | E | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1800 | |
| 3435 | Shovels Shop | dp greedy sortings | Statement | F | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2300 | |
| 3415 | Minimum Possible LCM | brute force greedy math number theory | Statement | G | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2400 | |
| 90268 | Restoring Three Numbers | math | Statement | A | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 600 | |
| 28509 | Reverse a Substring | implementation sortings strings | Statement | A | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1000 | |
| 12801 | Game with Telephone Numbers | games greedy implementation | Statement | B | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1200 | |
| 9847 | Alarm Clocks Everywhere | math number theory | Statement | C | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1300 | |
| 7975 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
| 1710 | Guess the Root | brute force interactive math | Statement | E | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 2200 | |
| 577 | Delivery Oligopoly | brute force dp graphs | Statement | F | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 2700 | |
| 8938 | Inscribed Figures | geometry | Statement | A | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 1400 | |
| 6612 | Ugly Pairs | dfs and similar greedy implementation sortings strings | Statement | B | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 1800 | |
| 6888 | Match Points | binary search greedy sortings ternary search two pointers | Statement | C | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2000 | |
| 4927 | 0-1-Tree | dfs and similar divide and conquer dp dsu trees | Statement | D | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2300 | |
| 4273 | Special Segments of Permutation | data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2400 | |
| 1778 | Card Bag | dp math probabilities | Statement | F | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2500 | |
| 191 | Optimizer | graphs greedy hashing implementation | Statement | G | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 3100 | |
| 16700 | Reachable Numbers | implementation | Statement | A | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1100 | |
| 15993 | Long Number | greedy | Statement | B | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 13695 | Increasing Subsequence (easy version) | greedy | Statement | C1 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 9380 | Minimum Array | binary search data structures greedy | Statement | E | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 9297 | Increasing Subsequence (hard version) | greedy | Statement | C2 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 4037 | N Problems During K Days | constructive algorithms greedy math | Statement | D | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2100 | |
| 2949 | Maximum Balanced Circle | constructive algorithms dp greedy two pointers | Statement | F | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2300 | |
| 1132 | Inverse of Rows and Columns | brute force constructive algorithms | Statement | G | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2800 | |
| 8589 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 2408 | The minimal unique substring | constructive algorithms math strings | Statement | B | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2200 | |
| 2326 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 1040 | Winding polygonal line | constructive algorithms geometry greedy math | Statement | D | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2800 | |
| 232 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 | |
| 653 | Density of subarrays | dp math | Statement | F | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3400 | |
| 7888 | Expansion coefficient of the array | implementation math | Statement | B | Codeforces Round 559 (Div. 2) {1159} | PROGRAMMING | 66993 | 1300 | |
| 13483 | A pile of stones | implementation math | Statement | A | Codeforces Round 559 (Div. 2) {1159} | PROGRAMMING | 66993 | 800 | |
| 0 | Collaboration | *special | Statement | A2 | VRt Contest 2019 (marathon) {1160} | PROGRAMMING | |||
| 6127 | Double Matrix | brute force greedy | Statement | B | Codeforces Round 557 (Div. 2) [based on Forethought Future Cup - Final Round] {1162} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 1400 | |
| 8798 | Zoning Restrictions Again | implementation | Statement | A | Codeforces Round 557 (Div. 2) [based on Forethought Future Cup - Final Round] {1162} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 800 | |
| 14041 | Eating Soup | greedy math | Statement | A | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1000 | |
| 7389 | Cat Party (Easy Edition) | data structures implementation | Statement | B1 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1500 | |
| 7710 | Cat Party (Hard Edition) | data structures implementation | Statement | B2 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1700 | |
| 3630 | Power Transmission (Easy Edition) | brute force geometry | Statement | C1 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1900 | |
| 4018 | Power Transmission (Hard Edition) | data structures geometry implementation math | Statement | C2 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2000 | |
| 1680 | Mysterious Code | dp strings | Statement | D | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2200 | |
| 1057 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 1540 | Indecisive Taxi Fee | data structures graphs shortest paths | Statement | F | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2900 | |
| 24900 | Polycarp Training | data structures greedy sortings | Statement | B | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1000 | |
| 14806 | Remainder | implementation math | Statement | A | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1200 | |
| 14584 | Good String | greedy | Statement | C | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1300 | |
| 20390 | Almost All Divisors | math number theory | Statement | D | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1600 | |
| 10371 | Two Arrays and Sum of Functions | greedy math sortings | Statement | E | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1800 | |
| 2531 | Microtransactions (hard version) | binary search greedy implementation | Statement | F2 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 2208 | Microtransactions (easy version) | binary search greedy | Statement | F1 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 11993 | All the Vowels Please | constructive algorithms math number theory | Statement | B | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1100 | |
| 11279 | A Tale of Two Lands | binary search sortings two pointers | Statement | C | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1600 | |
| 3046 | The LCMs Must be Large | bitmasks brute force constructive algorithms math number theory | Statement | E | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2000 | |
| 2316 | Cute Sequences | binary search brute force greedy math | Statement | D | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2100 | |
| 857 | Vicky's Delivery Service | data structures dsu graphs hashing | Statement | F | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2800 | |
| 15205 | Silent Classroom | combinatorics greedy | Statement | A | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 900 | |
| 28041 | News Distribution | dfs and similar dsu graphs | Statement | C | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1400 | |
| 17626 | Lost Numbers | brute force divide and conquer interactive math | Statement | B | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1400 | |
| 7412 | Bicolored RBS | constructive algorithms greedy | Statement | D | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1500 | |
| 3001 | Range Deleting | binary search combinatorics data structures two pointers | Statement | E | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2100 | |
| 1935 | Scalar Queries | combinatorics data structures math sortings | Statement | F | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2300 | |
| 225 | Low Budget Inception | brute force geometry | Statement | G | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 3000 | |
| 20844 | Telephone Number | brute force greedy strings | Statement | A | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 700 | |
| 7783 | Increasing by Modulo | binary search greedy | Statement | A | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 1800 | |
| 3828 | Good Triple | brute force two pointers | Statement | B | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2000 | |
| 2783 | And Reachability | bitmasks dp | Statement | C | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2400 | |
| 577 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 450 | Xor Permutations | constructive algorithms math | Statement | E | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 3100 | |
| 12791 | Circle Metro | implementation math | Statement | A | Codeforces Round 562 (Div. 2) {1169} | PROGRAMMING | Codeforces Round #562 — Editorial | 1000 | |
| 10835 | Pairs | graphs implementation | Statement | B | Codeforces Round 562 (Div. 2) {1169} | PROGRAMMING | Codeforces Round #562 — Editorial | 1500 | |
| 136 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 1567 | Three Integers Again | *special math | Statement | A | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 275 | Sliding Doors | *special binary search | Statement | E | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 836 | Minus and Minus Give Plus | *special implementation strings | Statement | C | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 57 | Longest Saw | *special constructive algorithms | Statement | H | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 85 | Graph Decomposition | *special graphs | Statement | G | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 47 | Good Subsets | *special dp | Statement | I | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 532 | Decoding of Integer Sequences | *special data structures implementation | Statement | D | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 1151 | Bad Days | *special implementation | Statement | B | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 5300 | Nauuo and Cards | greedy implementation | Statement | A | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 1800 | |
| 4468 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 1264 | Nauuo and Pictures (easy version) | dp probabilities | Statement | C1 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2500 | |
| 1065 | Nauuo and Pictures (hard version) | dp probabilities | Statement | C2 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2700 | |
| 750 | Nauuo and Portals | constructive algorithms | Statement | D | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2800 | |
| 380 | Nauuo and ODT | data structures | Statement | E | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 3300 | |
| 919 | Nauuo and Bug | data structures | Statement | F | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 3300 | |
| 9485 | Nauuo and Chess | constructive algorithms greedy | Statement | B | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 1100 | |
| 17390 | Nauuo and Votes | greedy | Statement | A | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 700 | |
| 19458 | Ehab Fails to Be Thanos | constructive algorithms greedy sortings | Statement | A | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1000 | |
| 17004 | Ehab Is an Odd Person | sortings | Statement | B | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1200 | |
| 12891 | Ehab and a Special Coloring Problem | constructive algorithms number theory | Statement | C | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1300 | |
| 5133 | Ehab and the Expected XOR Problem | bitmasks constructive algorithms | Statement | D | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1900 | |
| 2087 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 1853 | Ehab and the Expected GCD Problem | combinatorics dp math number theory | Statement | E | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2500 | |
| 20161 | From Hero to Zero | implementation math | Statement | A | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1000 | |
| 7314 | Electrification | binary search brute force greedy | Statement | C | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 12878 | Catch Overflow! | data structures expression parsing implementation | Statement | B | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 7173 | Array Splitting | greedy sortings | Statement | D | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1900 | |
| 4823 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 2947 | The Number of Subpermutations | brute force data structures divide and conquer hashing math | Statement | F | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2600 | |
| 941 | Yet Another Partiton Problem | data structures divide and conquer dp geometry two pointers | Statement | G | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2700 | |
| 18472 | Merge it! | math | Statement | B | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1100 | |
| 15241 | Lose it! | dp greedy implementation | Statement | C | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1300 | |
| 14172 | Cover it! | dfs and similar dsu graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 5894 | Recover it! | dfs and similar graphs greedy number theory sortings | Statement | D | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1900 | |
| 2378 | Destroy it! | dp implementation sortings | Statement | F | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 2500 | |
| 25406 | Divide it! | brute force greedy implementation | Statement | A | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 800 | |
| 6923 | Digits Sequence (Easy Edition) | implementation | Statement | A | Testing Round 15 (Unrated) {1177} | PROGRAMMING | 1100 | ||
| 3153 | Digits Sequence (Hard Edition) | binary search divide and conquer implementation | Statement | B | Testing Round 15 (Unrated) {1177} | PROGRAMMING | 1800 | ||
| 11334 | Prime Minister | greedy | Statement | A | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1100 | |
| 23386 | WOW Factor | dp strings | Statement | B | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 13548 | Tiles | combinatorics greedy math | Statement | C | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 7979 | Prime Graph | constructive algorithms greedy math number theory | Statement | D | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1600 | |
| 4636 | Archaeology | brute force constructive algorithms greedy strings | Statement | E | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1900 | |
| 2355 | Short Colorful Strip | combinatorics dfs and similar dp | Statement | F1 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2200 | |
| 1094 | Long Colorful Strip | dp | Statement | F2 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2600 | |
| 677 | The Awesomest Vertex | data structures dfs and similar | Statement | G | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2900 | |
| 299 | Stock Exchange | binary search flows graphs | Statement | H | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 3500 | |
| 12096 | Valeriy and Deque | data structures implementation | Statement | A | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 4617 | Tolik and His Uncle | constructive algorithms | Statement | B | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1800 | |
| 2566 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 1089 | Fedor Runs for President | data structures dp trees | Statement | D | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2600 | |
| 204 | Alesya and Discrete Math | divide and conquer interactive | Statement | E | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 3200 | |
| 10158 | Nick and Array | greedy implementation | Statement | B | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 27790 | Alex and a Rhombus | dp implementation math | Statement | A | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 800 | |
| 15065 | Chunga-Changa | greedy math | Statement | A | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1000 | |
| 6706 | Split a Number | greedy implementation strings | Statement | B | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1500 | |
| 3418 | Flag | brute force combinatorics dp implementation | Statement | C | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1900 | |
| 2920 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 674 | A Story of One Country (Easy) | brute force divide and conquer sortings | Statement | E1 | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2600 | |
| 549 | A Story of One Country (Hard) | brute force greedy sortings | Statement | E2 | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 3000 | |
| 36303 | Filling Shapes | dp math | Statement | A | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1000 | |
| 12103 | Plus from Picture | dfs and similar implementation strings | Statement | B | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1300 | |
| 4612 | Beautiful Lyrics | data structures greedy strings | Statement | C | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1700 | |
| 3490 | Product Oriented Recurrence | dp math matrices number theory | Statement | E | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2200 | |
| 1046 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 450 | Maximum Sine | binary search data structures number theory | Statement | F | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2900 | |
| 19856 | Equalize Prices | math | Statement | B | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1000 | |
| 15246 | Computer Game | binary search math | Statement | C | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 22004 | Candy Box (easy version) | greedy sortings | Statement | D | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 5596 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 2750 | Candy Box (hard version) | greedy implementation sortings | Statement | G | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2100 | |
| 3750 | Subsequences (hard version) | dp strings | Statement | H | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2200 | |
| 2303 | Topforces Strikes Back | brute force math sortings | Statement | F | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2400 | |
| 27262 | Nearest Interesting Number | implementation | Statement | A | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 900 | |
| 6668 | Heidi Learns Hashing (Easy) | brute force math number theory | Statement | A1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1200 | |
| 6275 | The Doctor Meets Vader (Easy) | binary search sortings | Statement | B1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1400 | |
| 2818 | Parallel Universes (Easy) | implementation | Statement | D1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1600 | |
| 2968 | Heidi and the Turing Test (Easy) | implementation | Statement | C1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1700 | |
| 1885 | Daleks' Invasion (easy) | graphs trees | Statement | E1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2000 | |
| 1154 | Heidi Learns Hashing (Medium) | brute force number theory | Statement | A2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2100 | |
| 1126 | Daleks' Invasion (medium) | dfs and similar graphs shortest paths trees | Statement | E2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2200 | |
| 716 | The Doctor Meets Vader (Medium) | flows graph matchings graphs shortest paths sortings | Statement | B2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2300 | |
| 807 | Heidi and the Turing Test (Medium) | data structures | Statement | C2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2300 | |
| 706 | Daleks' Invasion (hard) | data structures dsu graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 310 | The Doctor Meets Vader (Hard) | flows shortest paths | Statement | B3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2700 | |
| 177 | Heidi Learns Hashing (Hard) | fft math number theory | Statement | A3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3100 | |
| 50 | Heidi and the Turing Test (Hard) | Statement | C3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3200 | ||
| 169 | Parallel Universes (Hard) | math matrices | Statement | D2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3300 | |
| 11954 | Exam in BerSU (easy version) | greedy sortings | Statement | C1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1200 | |
| 14360 | Email from Polycarp | implementation strings | Statement | B | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1200 | |
| 7086 | Extra Element | implementation math | Statement | D | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 7875 | Exam in BerSU (hard version) | brute force data structures greedy math | Statement | C2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 2835 | Polycarp and Snakes | brute force implementation | Statement | E | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2000 | |
| 3276 | Playlist for Polycarp (easy version) | bitmasks combinatorics dp | Statement | G1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2100 | |
| 2310 | Two Pizzas | bitmasks brute force | Statement | F | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2200 | |
| 989 | Playlist for Polycarp (hard version) | combinatorics dp | Statement | G2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2800 | |
| 15485 | Ropewalkers | math | Statement | A | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 900 | |
| 9400 | Vus the Cossack and Numbers | constructive algorithms greedy math | Statement | D | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1600 | |
| 6622 | Vus the Cossack and Strings | implementation math | Statement | C | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1800 | |
| 1220 | Vus the Cossack and a Graph | dfs and similar graphs greedy implementation | Statement | F | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2300 | |
| 775 | Vus the Cossack and a Field | divide and conquer implementation math | Statement | E | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2500 | |
| 43107 | Vus the Cossack and a Contest | implementation | Statement | A | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 600 | |
| 12991 | Letters Shop | binary search implementation strings | Statement | B | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1300 | |
| 6831 | Vasya And Array | constructive algorithms greedy implementation | Statement | C | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1800 | |
| 12121 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 3091 | Subarray Sorting | data structures sortings | Statement | D | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2200 | |
| 729 | Gang Up | flows graphs | Statement | G | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 1200 | Expected Square Beauty | dp math probabilities | Statement | F | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 15683 | Stickers and Toys | math | Statement | A | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 900 | |
| 9069 | Add on a Tree | trees | Statement | A1 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 1600 | |
| 5424 | Count Pairs | math matrices number theory two pointers | Statement | B | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2200 | |
| 1335 | Add on a Tree: Revolution | constructive algorithms dfs and similar implementation trees | Statement | A2 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2500 | |
| 2233 | Array Beauty | dp | Statement | C | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2700 | |
| 1114 | Make Equal | dp | Statement | D | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 3000 | |
| 319 | Problem from Red Panda | combinatorics | Statement | E | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 3200 | |
| 15488 | Number Circle | greedy math sortings | Statement | B | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1100 | |
| 11145 | Candies! | data structures dp implementation math | Statement | C | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1400 |