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 ... 20 21 22 23 24 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 16100 | Keanu Reeves | strings | Statement | A | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 800 | |
| 9803 | Tokitsukaze and Discard Items | implementation two pointers | Statement | A | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 1500 | |
| 6825 | Tokitsukaze, CSL and Stone Game | games | Statement | B | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 1800 | |
| 2683 | Tokitsukaze and Strange Rectangle | data structures divide and conquer sortings two pointers | Statement | D | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2200 | |
| 2217 | Tokitsukaze and Duel | brute force games greedy | Statement | C | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2400 | |
| 262 | Tokitsukaze and Explosion | binary search greedy | Statement | E | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3100 | |
| 108 | Tokitsukaze and Powers | number theory probabilities | Statement | F | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3300 | |
| 9861 | Tokitsukaze and Mahjong | brute force implementation | Statement | B | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 1200 | |
| 18970 | Tokitsukaze and Enhancement | brute force | Statement | A | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 700 | |
| 1543 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 367 | Cubeword | *special brute force dp meet-in-the-middle | Statement | C | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 80 | Building Skyscrapers | *special | Statement | A | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 48 | Scissors and Tape | *special constructive algorithms geometry | Statement | C | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 508 | Magic Tree | *special data structures dp trees | Statement | B | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 463 | Amusement Park | *special dp math | Statement | A | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 10699 | Yet Another Crosses Problem | implementation | Statement | B | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1300 | |
| 14587 | From S To T | implementation strings | Statement | C | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1300 | |
| 7165 | 1-2-K Game | games math | Statement | D | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1700 | |
| 2042 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 1207 | Crossword Expert | combinatorics dp number theory probabilities two pointers | Statement | F | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2500 | |
| 330 | Another Meme Problem | dp | Statement | G | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 3000 | |
| 17365 | Remove a Progression | math | Statement | A | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 800 | |
| 21876 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 14184 | Drinks Choosing | greedy math | Statement | A | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 34674 | Basketball Exercise | dp | Statement | C | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1400 | |
| 8194 | Submarine in the Rybinsk Sea (easy edition) | combinatorics math number theory | Statement | D1 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1500 | |
| 4897 | Submarine in the Rybinsk Sea (hard edition) | combinatorics math number theory | Statement | D2 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1700 | |
| 3544 | OpenStreetMap | data structures two pointers | Statement | E | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2100 | |
| 1035 | Geometers Anonymous Club | data structures geometry math sortings | Statement | F | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2700 | |
| 17533 | Odd Sum Segments | constructive algorithms math | Statement | B | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1200 | |
| 9771 | Robot Breakout | implementation | Statement | C | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1500 | |
| 11127 | RGB Substring (easy version) | implementation | Statement | D1 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1500 | |
| 10430 | RGB Substring (hard version) | data structures dp implementation two pointers | Statement | D2 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1600 | |
| 3914 | Connected Component on a Chessboard | constructive algorithms implementation | Statement | E | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1900 | |
| 3145 | K-th Path | brute force constructive algorithms shortest paths sortings | Statement | F | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 2500 | |
| 29118 | Three Piles of Candies | brute force constructive algorithms math | Statement | A | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 700 | |
| 14499 | Pillars | greedy implementation | Statement | B | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 14031 | DIY Wooden Ladder | greedy math sortings | Statement | A | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 15234 | Array Splitting | greedy sortings | Statement | C | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1400 | |
| 5775 | Yet Another Subarray Problem | dp greedy math | Statement | D | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1900 | |
| 1849 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 341 | Coloring Game | dp games matrices | Statement | F | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2500 | |
| 9953 | Welfare State | binary search brute force data structures sortings | Statement | B | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1600 | |
| 10123 | MP3 | sortings two pointers | Statement | A | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1700 | |
| 4051 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 3740 | Rectangle Painting 1 | dp | Statement | D | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2400 | |
| 1296 | Rectangle Painting 2 | flows graph matchings graphs | Statement | E | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2500 | |
| 1075 | GCD Groups 2 | greedy number theory probabilities | Statement | F | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2900 | |
| 22386 | Water Lily | geometry math | Statement | B | Codeforces Round 576 (Div. 2) {1199} | PROGRAMMING | E | 1000 | |
| 16273 | City Day | implementation | Statement | A | Codeforces Round 576 (Div. 2) {1199} | PROGRAMMING | E | 1000 | |
| 21796 | Hotelier | brute force data structures implementation | Statement | A | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1000 | |
| 14653 | Block Adventure | dp greedy | Statement | B | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1300 | |
| 10630 | Round Corridor | math number theory | Statement | C | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1500 | |
| 4399 | White Lines | brute force data structures dp implementation two pointers | Statement | D | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1900 | |
| 9320 | Compress Words | brute force hashing implementation string suffix structures strings | Statement | E | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2000 | |
| 1163 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 32934 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 25360 | Zero Array | greedy math | Statement | B | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1500 | |
| 2531 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 146 | Knightmare (easy) | graphs interactive shortest paths | Statement | E1 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2900 | |
| 165 | Knightmare (hard) | graphs interactive shortest paths | Statement | E2 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 3000 | |
| 17016 | Important Exam | implementation strings | Statement | A | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 900 | |
| 10710 | You Are Given Two Binary Strings... | bitmasks greedy | Statement | A | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1100 | |
| 4840 | You Are Given a Decimal String... | brute force dp shortest paths | Statement | B | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1700 | |
| 5459 | Print a 1337-string... | combinatorics constructive algorithms math strings | Statement | D | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1900 | |
| 2763 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 | |
| 2746 | You Are Given Some Strings... | brute force string suffix structures strings | Statement | E | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2500 | |
| 540 | You Are Given Some Letters... | binary search implementation math | Statement | F | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2800 | |
| 17667 | Circle of Students | implementation | Statement | A | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1100 | |
| 16908 | Equal Rectangles | greedy math | Statement | B | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1200 | |
| 24155 | Common Divisors | implementation math | Statement | C | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1300 | |
| 14942 | Boxers | greedy sortings | Statement | E | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1500 | |
| 9477 | Remove the Substring (easy version) | greedy implementation | Statement | D1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1600 | |
| 8106 | Remove the Substring (hard version) | binary search greedy implementation two pointers | Statement | D2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1800 | |
| 4045 | Complete the Projects (easy version) | greedy | Statement | F1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2100 | |
| 3302 | Complete the Projects (hard version) | dp greedy | Statement | F2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2400 | |
| 18326 | Mislove Has Lost an Array | greedy math | Statement | B | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1000 | |
| 22301 | BowWow and the Timetable | math | Statement | A | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1100 | |
| 7205 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 3219 | Kirk and a Binary String (easy version) | brute force greedy strings | Statement | D1 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2000 | |
| 3392 | Kirk and a Binary String (hard version) | data structures greedy math strings | Statement | D2 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2100 | |
| 2063 | Natasha, Sasha and the Prefix Sums | combinatorics dp math number theory | Statement | E | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2400 | |
| 14698 | Almost Equal | constructive algorithms greedy math | Statement | A | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1300 | |
| 7420 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 | |
| 1261 | Palindromic Paths | implementation interactive | Statement | C | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2500 | |
| 763 | Almost All | constructive algorithms trees | Statement | D | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2800 | |
| 373 | Expected Value Again | combinatorics strings | Statement | E | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 3100 | |
| 139 | Beauty of a Permutation | constructive algorithms math | Statement | F | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 3400 | |
| 26020 | Choose Two Numbers | math sortings | Statement | A | Codeforces Round 580 (Div. 2) {1206} | PROGRAMMING | Editorial of Codeforces Round #580 | 800 | |
| 29488 | Make Product Equal One | dp implementation | Statement | B | Codeforces Round 580 (Div. 2) {1206} | PROGRAMMING | Editorial of Codeforces Round #580 | 900 | |
| 13752 | Square Filling | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1200 | |
| 10422 | Gas Pipeline | dp greedy | Statement | C | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1500 | |
| 6639 | XOR Guessing | bitmasks interactive math | Statement | E | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1800 | |
| 6695 | Number Of Permutations | combinatorics | Statement | D | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1800 | |
| 6730 | Remainder Problem | brute force data structures implementation | Statement | F | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2100 | |
| 1220 | Indie Album | data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2600 | |
| 23378 | There Are Two Types Of Burgers | brute force greedy implementation math | Statement | A | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 700 | |
| 11647 | Uniqueness | binary search brute force implementation two pointers | Statement | B | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1500 | |
| 6357 | Magic Grid | constructive algorithms | Statement | C | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1800 | |
| 5444 | Restore Permutation | binary search data structures greedy implementation | Statement | D | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1900 | |
| 2181 | Let Them Slide | data structures implementation | Statement | E | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2200 | |
| 3297 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 926 | Polygons | greedy math number theory | Statement | G | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2700 | |
| 188 | Red Blue Tree | data structures implementation trees | Statement | H | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 3500 | |
| 18005 | XORinacci | math | Statement | A | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 900 | |
| 8512 | Koala and Lights | implementation math number theory | Statement | B | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1300 | |
| 7853 | Paint the Digits | constructive algorithms greedy implementation | Statement | C | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1600 | |
| 10713 | Cow and Snacks | dfs and similar dsu graphs | Statement | D | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1700 | |
| 3247 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 3937 | Into Blocks (easy version) | data structures dsu greedy implementation two pointers | Statement | G1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 2298 | Rotate Columns (hard version) | bitmasks dp greedy sortings | Statement | E2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2400 | |
| 1362 | Koala and Notebook | data structures dfs and similar graphs shortest paths strings trees | Statement | F | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2600 | |
| 526 | Into Blocks (hard version) | data structures | Statement | G2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3200 | |
| 228 | Moving Walkways | data structures greedy math | Statement | H | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3300 | |
| 12833 | Paint the Numbers | greedy implementation math | Statement | A | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 900 | |
| 5534 | Anadi and Domino | brute force graphs | Statement | A | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1600 | |
| 6037 | Marcin and Training Camp | brute force greedy | Statement | B | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1800 | |
| 3590 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 1623 | Konrad and Company Evaluation | graphs | Statement | D | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2300 | |
| 439 | Wojtek and Card Tricks | math | Statement | E | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2700 | |
| 348 | Marek and Matching (easy version) | brute force probabilities | Statement | F1 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2900 | |
| 426 | Marek and Matching (hard version) | brute force probabilities | Statement | F2 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3100 | |
| 303 | Mateusz and Escape Room | dp | Statement | G | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3400 | |
| 1582 | Three Problems | *special implementation | Statement | A | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 1300 | |
| 800 | Traveling Around the Golden Ring of Berland | *special implementation | Statement | B | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 1500 | |
| 566 | Ice Cream | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2000 | |
| 252 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 216 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 149 | kotlinkotlinkotlinkotlin... | *special graphs implementation strings | Statement | F | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2400 | |
| 83 | King's Path | *special math trees | Statement | G | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2500 | |
| 52 | Unusual Graph | *special graphs | Statement | I | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 57 | Road Repair in Treeland | *special binary search dp trees | Statement | H | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 31451 | Bad Prices | data structures implementation | Statement | B | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1100 | |
| 19608 | Book Reading | math | Statement | C | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1200 | |
| 12059 | Equalizing by Division (easy version) | brute force implementation | Statement | D1 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1500 | |
| 12173 | Equalizing by Division (hard version) | brute force math sortings | Statement | D2 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1600 | |
| 5455 | Two Small Strings | brute force constructive algorithms | Statement | E | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 9473 | Path Queries | divide and conquer dsu graphs sortings trees | Statement | G | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 3016 | Unstable String Sort | data structures dfs and similar dsu graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 | |
| 25583 | Chips Moving | math | Statement | A | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 900 | |
| 11471 | Badges | brute force math | Statement | B | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1100 | |
| 14183 | Bad Sequence | data structures greedy | Statement | C | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1200 | |
| 9489 | Optimal Currency Exchange | brute force math | Statement | A | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1300 | |
| 7168 | Treasure Island | dfs and similar dp flows hashing | Statement | D | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1800 | |
| 2862 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 458 | Tiles Placement | constructive algorithms dfs and similar trees | Statement | H | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 502 | Employment | greedy sortings | Statement | F | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 330 | Feeling Good | bitmasks data structures | Statement | G | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 3100 | |
| 12175 | Yellow Cards | greedy implementation math | Statement | A | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1000 | |
| 18260 | The Number of Products | combinatorics dp implementation | Statement | B | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 11926 | Swap Letters | constructive algorithms greedy | Statement | C | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 6557 | Ticket Game | games greedy math | Statement | D | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1700 | |
| 3450 | Marbles | bitmasks dp | Statement | E | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2200 | |
| 1185 | Radio Stations | 2-sat | Statement | F | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2800 | |
| 19648 | Shooting | greedy implementation sortings | Statement | B | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1000 | |
| 12195 | Swords | math | Statement | D | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1300 | |
| 10337 | White Sheet | geometry math | Statement | C | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1500 | |
| 3719 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 3097 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 1649 | Numerical Sequence (hard version) | binary search math | Statement | E2 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 19534 | Prefixes | strings | Statement | A | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 900 | |
| 15817 | Creating a Character | binary search math | Statement | A | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1300 | |
| 11848 | Zmei Gorynich | greedy math | Statement | B | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 7853 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 5935 | Coloring Edges | constructive algorithms dfs and similar graphs | Statement | D | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2000 | |
| 2062 | Sum Queries? | data structures greedy implementation math | Statement | E | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2300 | |
| 717 | Forced Online Queries Problem | data structures divide and conquer dsu graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 3189 | Workout plan | data structures greedy | Statement | F | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 1500 | |
| 736 | The Light Square | 2-sat dfs and similar greedy | Statement | I | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2200 | |
| 473 | Product Tuples | divide and conquer fft | Statement | E | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2500 | |
| 596 | Xor Spanning Tree | divide and conquer fft graphs | Statement | D | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2600 | |
| 95 | Guarding warehouses | data structures geometry | Statement | B | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2700 | |
| 157 | Function Composition | dfs and similar | Statement | H | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2700 | |
| 216 | Jumping Transformers | dp | Statement | C | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 180 | BubbleReactor | dp graphs | Statement | A | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 162 | Alpha planetary system | constructive algorithms graphs shortest paths | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 3300 | |
| 2476 | Periodic integer number | implementation strings | Statement | C | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 2] {1219} | PROGRAMMING | E | 1700 | |
| 820 | Harvester | implementation | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 2] {1219} | PROGRAMMING | E | 2000 | |
| 10806 | Substring Game in the Lesson | games greedy strings | Statement | C | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 12128 | Multiplication Table | math number theory | Statement | B | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 4137 | Alex and Julian | bitmasks math number theory | Statement | D | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1900 | |
| 2999 | Tourism | dfs and similar dp dsu graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 846 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 73 | Geolocation | geometry | Statement | G | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 3200 | |
| 32763 | Cards | implementation sortings strings | Statement | A | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 600 | |
| 18148 | 2048 Game | brute force greedy math | Statement | A | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1000 | |
| 12518 | Knights | constructive algorithms greedy | Statement | B | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1100 | |
| 24629 | Perfect Team | binary search math | Statement | C | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1200 | |
| 10178 | Make The Fence Great Again | dp | Statement | D | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1700 | |
| 1169 | Game With String | games | Statement | E | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2400 | |
| 1237 | Choose a Square | binary search data structures sortings | Statement | F | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2500 | |
| 876 | Graph And Numbers | bitmasks brute force combinatorics dp meet-in-the-middle | Statement | G | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2900 | |
| 15881 | Strings Equalization | strings | Statement | B | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1000 | |
| 9752 | Save the Nature | binary search greedy | Statement | C | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1600 | |
| 4462 | Sequence Sorting | dp greedy two pointers | Statement | D | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2000 | |
| 2889 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 2266 | Stack Exterminable Arrays | data structures divide and conquer dp hashing | Statement | F | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2600 | |
| 276 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 22279 | CME | math | Statement | A | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 600 | |
| 12513 | TV Subscriptions (Easy Version) | implementation | Statement | B1 | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1000 | |
| 12183 | TV Subscriptions (Hard Version) | implementation two pointers | Statement | B2 | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1300 | |
| 9779 | p-binary | bitmasks brute force math | Statement | C | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1600 | |
| 10013 | Power Products | hashing math number theory | Statement | D | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1900 | |
| 2082 | Rock Is Push | binary search dp | Statement | E | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2200 | |
| 991 | Tree Factory | constructive algorithms greedy trees | Statement | F | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2500 | |
| 659 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 16612 | Forgetting Things | math | Statement | A | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 900 | |
| 10262 | Math Problem | math | Statement | A | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1100 | |
| 10429 | Box | constructive algorithms | Statement | B | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1200 | |
| 6825 | Optimal Subsequences (Easy Version) | data structures greedy | Statement | D1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1600 | |
| 5785 | Messy | constructive algorithms | Statement | C | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1700 | |
| 4723 | Optimal Subsequences (Hard Version) | data structures greedy | Statement | D2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1800 | |
| 2051 | Wrong Answer on test 233 (Easy Version) | dp | Statement | F1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2100 | |
| 1639 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 | |
| 1916 | Wrong Answer on test 233 (Hard Version) | combinatorics math | Statement | F2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2400 | |
| 1188 | Not Same | constructive algorithms | Statement | G | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2500 | |
| 11887 | Filling the Grid | implementation math | Statement | B | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1300 | |
| 9634 | Primes and Multiplication | math number theory | Statement | C | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1600 | |
| 5414 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 3446 | Another Filling the Grid | combinatorics dp math | Statement | E | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2300 | |
| 479 | One Node is Gone | constructive algorithms implementation trees | Statement | F | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2700 | |
| 23282 | Distinct Digits | brute force implementation | Statement | A | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 800 | |
| 19620 | Ania and Minimizing | greedy implementation | Statement | B | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 1000 | |
| 22896 | Dawid and Bags of Candies | brute force implementation | Statement | A | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 800 | |
| 4361 | Increasing Matrix | greedy | Statement | C | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1100 | |
| 932 | Middle-Out | constructive algorithms greedy strings | Statement | E | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2000 | |
| 19732 | Social Network (easy version) | implementation | Statement | B1 | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1000 | |
| 18405 | Social Network (hard version) | data structures implementation | Statement | B2 | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1200 | |
| 13477 | Pipes | dp implementation | Statement | C | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1400 | |
| 18519 | Distinct Characters Queries | data structures | Statement | D | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1600 | |
| 2974 | Special Permutations | math | Statement | E | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2000 | |
| 2972 | Yet Another Substring Reverse | bitmasks dp | Statement | F | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2400 | |
| 29521 | Equalize Prices Again | math | Statement | A | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 900 | |
| 10545 | Labs | constructive algorithms greedy implementation | Statement | C | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1300 | |
| 12045 | Alice and the List of Presents | combinatorics math | Statement | B | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1400 | |
| 1737 | Alice and the Doll | brute force data structures greedy implementation | Statement | D | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2100 | |
| 731 | Alice and the Unfair Game | binary search data structures dp dsu | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 211 | Alice and the Cactus | dfs and similar graphs math probabilities | Statement | F | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2900 | |
| 17242 | Stones | brute force greedy math | Statement | A | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 800 | |
| 22079 | Balanced Rating Changes | implementation math | Statement | A | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1100 | |
| 22671 | Balanced Tunnel | data structures sortings two pointers | Statement | B | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1300 | |
| 6300 | Balanced Removals (Easier) | constructive algorithms geometry greedy | Statement | C1 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1600 | |
| 4534 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 4774 | Balanced Playlist | binary search data structures implementation | Statement | D | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 1519 | Balanced Binary Search Trees | dp math | Statement | E | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2400 | |
| 1092 | Balanced Domino Placements | combinatorics dp | Statement | F | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2600 | |
| 437 | Balanced Reversals | constructive algorithms | Statement | H | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3200 | |
| 165 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 14763 | Kill `Em All | greedy sortings | Statement | B | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1300 | |
| 7843 | Standard Free2play | dp greedy math | Statement | C | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1600 |