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 ... 24 25 26 27 28 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5537 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 2622 | Koa and the Beach (Hard Version) | constructive algorithms greedy | Statement | B2 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 750.0 | Codeforces Round #659 Editorial | |
| 4128 | Koa and the Beach (Easy Version) | dp greedy | Statement | B1 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 19798 | Common Prefixes | constructive algorithms greedy strings | Statement | A | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 29040 | Make It Good | binary search greedy | Statement | C | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1200 | |
| 22130 | a-Good String | bitmasks brute force divide and conquer dp implementation | Statement | D | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1500 | |
| 9263 | Directing Edges | dfs and similar graphs | Statement | E | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2000 | |
| 2832 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 1851 | Columns Swaps | 2-sat dfs and similar dsu graphs implementation | Statement | G | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 43662 | Three Pairwise Maximums | math | Statement | A | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 800 | |
| 39763 | Restore the Permutation by Merger | greedy | Statement | B | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 800 | |
| 141 | Mixture | *special data structures geometry math sortings | Statement | B | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 662 | Joker | *special bitmasks data structures divide and conquer dsu | Statement | C | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 353 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 209 | Viruses | *special | Statement | C | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | |||
| 1907 | Village (Minimum) | *special greedy | Statement | B1 | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 1293 | Village (Maximum) | *special | Statement | B2 | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 918 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 22852 | Captain Flint and a Long Voyage | greedy math | Statement | B | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1000.0 | Codeforces Round #660 Editorial | 1000 |
| 10438 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 6924 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 649 | Uncle Bogdan and Projections | data structures geometry sortings | Statement | E | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2750.0 | Codeforces Round #660 Editorial | 2700 |
| 25995 | Captain Flint and Crew Recruitment | brute force math number theory | Statement | A | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 750.0 | Codeforces Round #660 Editorial | 800 |
| 4559 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 50505 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20667 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 496 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 3734 | Calendar Ambiguity | math number theory | Statement | E | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1250 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20658 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 25091 | Suborrays | constructive algorithms math | Statement | A | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 500.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 1946 | Pairs of Pairs | constructive algorithms dfs and similar graphs trees | Statement | E | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 29923 | Fix You | brute force greedy implementation | Statement | B | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 16064 | Cyclic Permutations | combinatorics graphs math | Statement | C | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 1250.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 5787 | 505 | bitmasks brute force dp implementation | Statement | D | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2000.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 993 | ZS Shuffles Cards | combinatorics math probabilities | Statement | H | Codeforces Global Round 10 {1392} | PROGRAMMING | 3500.0 | Codeforces Global Round 10 — Editorial | |
| 19656 | Omkar and Waterslide | greedy implementation | Statement | C | Codeforces Global Round 10 {1392} | PROGRAMMING | 1000.0 | Codeforces Global Round 10 — Editorial | |
| 682 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 21779 | Omkar and Password | greedy | Statement | A | Codeforces Global Round 10 {1392} | PROGRAMMING | 500.0 | Codeforces Global Round 10 — Editorial | |
| 2410 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 18923 | Omkar and Infinity Clock | implementation math | Statement | B | Codeforces Global Round 10 {1392} | PROGRAMMING | 750.0 | Codeforces Global Round 10 — Editorial | |
| 3768 | Omkar and Duck | bitmasks constructive algorithms interactive math | Statement | E | Codeforces Global Round 10 {1392} | PROGRAMMING | 2000.0 | Codeforces Global Round 10 — Editorial | |
| 9903 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 233 | Kevin and Grid | fft graphs math | Statement | I | Codeforces Global Round 10 {1392} | PROGRAMMING | 4000.0 | Codeforces Global Round 10 — Editorial | |
| 446 | Twilight and Ancient Scroll (harder version) | dp implementation string suffix structures strings | Statement | E2 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 449 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 4197 | Rarity and New Dress | data structures dp graphs implementation | Statement | D | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1750.0 | Codeforces Round #662 Editorial | |
| 20846 | Rainbow Dash, Fluttershy and Chess Coloring | greedy math | Statement | A | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 500.0 | Codeforces Round #662 Editorial | |
| 11070 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 17401 | Applejack and Storages | data structures greedy implementation | Statement | B | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1000.0 | Codeforces Round #662 Editorial | |
| 7138 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 2151 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 1227 | Boboniu and String | binary search geometry ternary search | Statement | C | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1500.0 | Codeforces Round #664 Editorial | 2600 |
| 1245 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 166 | Boboniu and Banknote Collection | Statement | E | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 2500.0 | Codeforces Round #664 Editorial | 3500 | |
| 25574 | Boboniu Likes to Color Balls | brute force | Statement | A | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1000 |
| 16402 | Boboniu Plays Chess | constructive algorithms | Statement | B | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 750.0 | Codeforces Round #664 Editorial | 1100 |
| 15297 | Boboniu and Bit Operations | bitmasks brute force dp | Statement | C | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 1600 |
| 13052 | Stoned Game | brute force constructive algorithms games greedy | Statement | B | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 344 | Rainbow Rectangles | data structures | Statement | D | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2250.0 | Codeforces Round #666 — Editorial | |
| 16758 | Multiples of Length | constructive algorithms greedy number theory | Statement | A | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 2794 | Monster Invaders | dp greedy | Statement | C | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1750.0 | Codeforces Round #666 — Editorial | |
| 436 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 15527 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 29887 | Juggling Letters | greedy strings | Statement | A | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 2604 | Two Types of Spells | binary search data structures greedy implementation math sortings | Statement | E | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 26021 | Substring Removal Game | games greedy sortings strings | Statement | B | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1290 | Running Competition | bitmasks fft math number theory | Statement | G | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 37479 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1403 | Controversial Rounds | binary search data structures dp dsu two pointers | Statement | F | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 12597 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 28849 | Bad Triangle | geometry math | Statement | A | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1880 | Yet Another Segments Subset | dp sortings | Statement | F | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 2535 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6359 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 81590 | Remove Smallest | greedy sortings | Statement | A | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 47030 | Gifts Fixing | greedy | Statement | B | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 32961 | Boats Competition | brute force | Statement | C | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 19969 | Binary String To Subsequences | constructive algorithms data structures greedy | Statement | D | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 11448 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1188 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 28002 | String Similarity | brute force constructive algorithms strings | Statement | A | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11719 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1168 | Mercenaries | bitmasks combinatorics data structures math two pointers | Statement | G | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 6367 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 18551 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 21805 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1966 | Reverse and Swap | binary search bitmasks data structures divide and conquer | Statement | F | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 27003 | Mere Array | constructive algorithms math number theory number theory sortings sortings | Statement | C | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 10611 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 2650 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 28717 | Distance and Axis | math number theory | Statement | A | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 237 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 133 | Roads | *special geometry sortings | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 1361 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 358 | The Potion of Great Power | *special binary search data structures graphs interactive sortings two pointers | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 395 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 8247 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 1283 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 3062 | Fixed Point Removal | binary search data structures greedy | Statement | C | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1500.0 | Codeforces Round #668 Editorial | |
| 1612 | Bricks | flows graph matchings graphs | Statement | E | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 3000.0 | Codeforces Round #668 Editorial | |
| 19708 | Balanced Bitstring | implementation strings | Statement | A | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
| 21930 | Permutation Forgery | constructive algorithms | Statement | A | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
| 23136 | Array Cancellation | constructive algorithms | Statement | B | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 3827 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 23102 | Subset Mex | greedy implementation math | Statement | A | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 24555 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 11838 | Link Cut Centroids | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 1894 | Deleting Numbers | binary search brute force interactive number theory | Statement | E | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2750.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 1913 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 5816 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 15031 | Chocolate Bunny | constructive algorithms interactive math two pointers | Statement | C | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1500.0 | Codeforces Round #669 Editorial | |
| 18116 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 21458 | Ahahahahahahahaha | constructive algorithms math | Statement | A | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 500.0 | Codeforces Round #669 Editorial | |
| 2686 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 4693 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 557 | Rainbow Triples | greedy | Statement | H | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 9300 | Discrete Acceleration | binary search implementation math two pointers | Statement | C | Grakn Forces 2020 {1408} | PROGRAMMING | 1250.0 | Grakn Forces -- Editorial | |
| 1345 | Clusterization Counting | combinatorics dp dsu fft graphs | Statement | G | Grakn Forces 2020 {1408} | PROGRAMMING | 3000.0 | Grakn Forces -- Editorial | |
| 12802 | Circle Coloring | constructive algorithms | Statement | A | Grakn Forces 2020 {1408} | PROGRAMMING | 500.0 | Grakn Forces -- Editorial | |
| 201 | Bitwise Magic | dp math | Statement | I | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 2197 | Avoid Rainbow Cycles | dsu graphs greedy sortings | Statement | E | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 10473 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 81255 | Yet Another Two Integers Problem | math | Statement | A | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 24733 | Yet Another Array Restoration | brute force math | Statement | C | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 8496 | Two Platforms | binary search dp sortings two pointers | Statement | E | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 5193 | Subsequences of Length Two | dp greedy | Statement | F | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 31041 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 21507 | Decrease the Sum of Digits | greedy math | Statement | D | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 436 | The Thorny Path | greedy math matrices | Statement | F | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 1834 | Poman Numbers | greedy implementation math | Statement | E | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 8618 | Peaceful Rooks | dfs and similar dsu graphs | Statement | C | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 898 | No Game No Life | games math matrices | Statement | G | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 3250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 21807 | In-game Chat | implementation | Statement | A | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 500.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2725 | Grime Zoo | constructive algorithms greedy implementation | Statement | D | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 31369 | Fair Numbers | brute force number theory | Statement | B | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2187 | Solo mid Oracle | binary search math ternary search | Statement | E | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2250.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 6933 | Shurikens | data structures greedy implementation | Statement | D | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 967 | Roads and Ramen | data structures | Statement | F | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 3000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 6276 | Perform Easily | data structures dp implementation sortings two pointers | Statement | C | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 15306 | Finding Sasuke | constructive algorithms math | Statement | A | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 12074 | A New Technique | implementation | Statement | B | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 6183 | XOR-gun | bitmasks brute force constructive algorithms | Statement | D | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 12555 | Repainting Street | brute force brute force greedy | Statement | B | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 15898 | Prison Break | brute force brute force math | Statement | A | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 3009 | New Game Plus! | constructive algorithms greedy math | Statement | E | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 566 | Cakes for Clones | dp | Statement | F | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 11753 | Bouncing Ball | brute force dp implementation | Statement | C | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 17063 | k-Amazing Numbers | binary search data structures implementation two pointers | Statement | A | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 1500 |
| 5102 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 6722 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 2740 | Graph and Queries | data structures dfs and similar dsu graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 435 | Split | data structures dp greedy | Statement | E | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2250.0 | Codeforces Round #673 Editorial | 3200 |
| 605 | Showing Off | flows graph matchings greedy | Statement | F | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2750.0 | Codeforces Round #673 Editorial | 3300 |
| 15093 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 18763 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 4763 | Trash Problem | data structures hashing implementation two pointers | Statement | D | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 2790 | Three Occurrences | data structures hashing two pointers | Statement | G | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17662 | Negative Prefixes | greedy sortings | Statement | B | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 28929 | Mortal Kombat Tower | dp greedy | Statement | C | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 2210 | Expected Damage | binary search combinatorics math probabilities | Statement | E | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 436 | Equal Product | data structures math number theory two pointers | Statement | F | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 34867 | Buying Torches | math | Statement | A | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17040 | Stairs | brute force constructive algorithms greedy implementation math two pointers | Statement | B | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 17520 | Sage's Birthday (hard version) | binary search constructive algorithms greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1000.0 | Codeforces Round #671 Editorial | |
| 26505 | Sage's Birthday (easy version) | binary search greedy implementation sortings | Statement | D1 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 566 | Rain of Fire | binary search dfs and similar dsu graphs implementation sortings | Statement | F | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 3000.0 | Codeforces Round #671 Editorial | |
| 16336 | Killjoy | greedy implementation math | Statement | C | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1250.0 | Codeforces Round #671 Editorial | |
| 20598 | Digit Game | games implementation | Statement | A | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 500.0 | Codeforces Round #671 Editorial | |
| 3527 | Decryption | bitmasks constructive algorithms implementation math number theory | Statement | E | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 2250.0 | Codeforces Round #671 Editorial | |
| 36691 | Rock and Lever | bitmasks math | Statement | B | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 8389 | Rescue Nibel! | combinatorics data structures sortings | Statement | D | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 2000.0 | Editorial | |
| 5208 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 19078 | Pokémon Army (easy version) | constructive algorithms dp greedy | Statement | C1 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 25288 | Cubes Sorting | math sortings | Statement | A | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 500.0 | Editorial | |
| 1047 | Battle Lemmings | brute force dp geometry | Statement | E | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 3000.0 | Editorial | |
| 35968 | XORwice | bitmasks greedy math | Statement | A | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 974 | Swedish Heroes | brute force dp implementation | Statement | E | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 13493 | Putting Bricks in the Wall | constructive algorithms implementation | Statement | B | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 1000.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 13578 | Palindromifier | constructive algorithms strings | Statement | C | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 1500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 4388 | Hexagons | brute force implementation math shortest paths ternary search | Statement | D | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2000.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 3208 | Returning Home | data structures graphs implementation shortest paths sortings | Statement | D | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1500.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 15103 | Nice Matrix | greedy implementation ternary search | Statement | B | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 856 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 21897 | Fence | geometry math | Statement | A | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 500.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 1298 | Boring Queries | data structures number theory trees | Statement | F | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 8857 | Bargain | dp math probabilities | Statement | C | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 125 | Wakanda Forever | Statement | A | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | |||
| 631 | Virus | data structures dsu graphs | Statement | H | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 2125 | Valuable Paper | binary search flows graph matchings graphs | Statement | B | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 328 | Milutin's Plums | interactive | Statement | M | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 158 | Lookup Tables | bitmasks | Statement | I | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 5470 | Lonely Numbers | binary search math number theory | Statement | K | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 589 | Light switches | meet-in-the-middle | Statement | L | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 262 | Growing flowers | data structures | Statement | G | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 214 | Dušan's Railway | graphs trees | Statement | C | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 50 | Does anyone else hate the wind? | Statement | D | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | |||
| 449 | Coins | math | Statement | F | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 172 | BubbleSquare Tokens | Statement | N | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | |||
| 893 | Bubble Cup hypothesis | constructive algorithms dp math | Statement | J | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 98 | 5G Antenna Towers | geometry | Statement | E | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 6721 | Years | sortings | Statement | G | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] {1424} | PROGRAMMING | |||
| 617 | Ancient Language | graphs sortings | Statement | M | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] {1424} | PROGRAMMING | |||
| 4414 | Huge Boxes of Animal Toys | constructive algorithms | Statement | H | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 1300 | |
| 7239 | Flamingoes of Mystery | interactive | Statement | F | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 1400 | |
| 7236 | Arena of Greed | games greedy | Statement | A | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 1400 | |
| 1014 | Excitation of Atoms | greedy implementation | Statement | E | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2200 | |
| 902 | Danger of Mad Snakes | combinatorics dp math | Statement | D | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2300 | |
| 361 | Blue and Red of Our Faculty! | dp | Statement | B | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2600 | |
| 268 | Impressive Harvesting of The Orchard | data structures | Statement | I | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2800 | |
| 56 | Captain of Knights | math | Statement | C | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 3100 | |
| 20622 | Increase and Copy | binary search constructive algorithms math | Statement | C | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1100 | |
| 17676 | Non-zero Segments | constructive algorithms data structures greedy | Statement | D | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1500 | |
| 8158 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 6210 | Number of Subsequences | combinatorics dp strings | Statement | F | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 2000 | |
| 55347 | Floor Number | implementation math | Statement | A | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 800 | |
| 21872 | Symmetric Matrix | implementation | Statement | B | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 900 | |
| 11498 | Chess Cheater | greedy implementation sortings | Statement | B | Codeforces Global Round 11 {1427} | PROGRAMMING | 750.0 | Editorial of Global Round 11 | 1400 |
| 3710 | Unshuffling a Deck | constructive algorithms implementation | Statement | D | Codeforces Global Round 11 {1427} | PROGRAMMING | 1000.0 | Editorial of Global Round 11 | 2000 |
| 6100 | The Hard Work of Paparazzi | brute force dp | Statement | C | Codeforces Global Round 11 {1427} | PROGRAMMING | 1000.0 | Editorial of Global Round 11 | 2000 |
| 1660 | Xum | bitmasks constructive algorithms math number theory | Statement | E | Codeforces Global Round 11 {1427} | PROGRAMMING | 1500.0 | Editorial of Global Round 11 | 2500 |
| 402 | Boring Card Game | data structures greedy trees | Statement | F | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3200 |
| 499 | One Billion Shades of Grey | flows graphs | Statement | G | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3300 |
| 96 | Prison Break | binary search games geometry ternary search | Statement | H | Codeforces Global Round 11 {1427} | PROGRAMMING | 4500.0 | Editorial of Global Round 11 | 3500 |
| 18077 | Avoiding Zero | math sortings | Statement | A | Codeforces Global Round 11 {1427} | PROGRAMMING | 500.0 | Editorial of Global Round 11 | 900 |
| 128 | Rotary Laser Lock | binary search interactive | Statement | H | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 4000.0 | Codeforces Raif Round 1 Editorial | |
| 743 | Lucky Numbers (Hard Version) | dp greedy | Statement | G2 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 750.0 | Codeforces Raif Round 1 Editorial | |
| 660 | Lucky Numbers (Easy Version) | dp greedy | Statement | G1 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 2250.0 | Codeforces Raif Round 1 Editorial | |
| 2619 | Fruit Sequences | binary search data structures divide and conquer dp | Statement | F | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 4253 | Carrots for Rabbits | binary search data structures greedy math | Statement | E | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 17039 | Box is Pull | math | Statement | A | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 500.0 | Codeforces Raif Round 1 Editorial | |
| 4744 | Bouncing Boomerangs | constructive algorithms greedy | Statement | D | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1500.0 | Codeforces Raif Round 1 Editorial | |
| 15228 | Belted Rooms | graphs implementation | Statement | B | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1000.0 | Codeforces Raif Round 1 Editorial | |
| 22751 | ABBB | greedy strings | Statement | C | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1000.0 | Codeforces Raif Round 1 Editorial | |
| 883 | Yet Another DAG Problem | bitmasks dp flows math | Statement | G | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 7371 | String Reversal | data structures greedy strings | Statement | E | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 9377 | String Deletion | greedy two pointers | Statement | D | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 1047 | Realistic Gameplay | dp greedy | Statement | F | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 28493 | Numbers on Whiteboard | constructive algorithms data structures games implementation math | Statement | C | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 21882 | Number of Apartments | brute force dp math | Statement | A | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 20338 | Barrels | greedy implementation sortings | Statement | B | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 51 | Zero-XOR Array | *special dp | Statement | J | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 488 | Used Markers | *special greedy | Statement | D | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 2164 | Selling Hamburgers | *special | Statement | A | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 77 | Rogue-like Game | *special brute force greedy | Statement | H | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 1055 | Polycarp and the Language of Gods | *special implementation two pointers | Statement | B | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 204 | Number Deletion Game | *special dp games greedy | Statement | G | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 161 | Neural Network Problem | *special binary search greedy | Statement | F | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 52 | Cyclic Shifts | *special strings | Statement | I | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 |