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 4 5 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 241 | Show Must Go On | binary search brute force greedy shortest paths | Statement | I | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 6765 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 3122 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 2456 | Cheap Robot | binary search dsu graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 8362 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 16932 | Obtain Two Zeroes | binary search math | Statement | B | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1200 | |
| 4316 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 14860 | Everyone is a Winner! | binary search math meet-in-the-middle number theory | Statement | C | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 2034 | K Integers | binary search data structures | Statement | C | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2300 | |
| 3847 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 93 | Шардирование постов | *special binary search interactive | Statement | F | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 3000.0 | ||
| 14539 | Verse For Santa | binary search brute force implementation | Statement | B | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1300 | |
| 1378 | New Year and Handle Change | binary search dp | Statement | F | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2800 | |
| 11622 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 3462 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 1411 | Classical? | binary search combinatorics number theory | Statement | F | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2800 | |
| 19509 | Deadline | binary search brute force math ternary search | Statement | A | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 | |
| 8772 | Minimax Problem | binary search bitmasks | Statement | D | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2000 | |
| 7511 | Irreducible Anagrams | binary search constructive algorithms data structures strings two pointers | Statement | B | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1900 |
| 16276 | ConneR and the A.R.C. Markland-N | binary search brute force implementation | Statement | A | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1100 |
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 15202 | Motarack's Birthday | binary search greedy ternary search | Statement | B | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1000.0 | Codeforces Round #619 (Div. 2) Editorial | 1500 |
| 9995 | Ayoub's function | binary search combinatorics greedy math strings | Statement | C | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1250.0 | Codeforces Round #619 (Div. 2) Editorial | 1700 |
| 1682 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 223 | Kuroni the Private Tutor | binary search greedy | Statement | H | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 4000.0 | Ozon Tech Challenge 2020 Editorial | 3600 |
| 7621 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 1475 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 794 | Au Pont Rouge | binary search dp strings | Statement | C | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2800 |
| 7085 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 9731 | Homecoming | binary search dp greedy strings | Statement | B | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1300 |
| 4749 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 31061 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 35641 | Pair of Topics | binary search data structures sortings two pointers | Statement | D | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 354 | Dreamoon Loves AA | binary search greedy | Statement | E | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2500.0 | Codeforces Round #631 Editorial | 3300 |
| 13726 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 40062 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 | |
| 11891 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 12373 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 6420 | Multiple Testcases | binary search constructive algorithms data structures greedy sortings two pointers | Statement | D | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1900 | |
| 1352 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 28564 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 9434 | Phoenix and Science | binary search bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2000.0 | Codeforces Round #638 (Div. 2) Editorial | 1900 |
| 74697 | K-th Not Divisible by n | binary search math | Statement | C | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 36287 | Ternary String | binary search dp implementation two pointers | Statement | B | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1200 | |
| 16437 | Simple Polygon Embedding | binary search geometry math ternary search | Statement | C1 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1400 | |
| 10739 | Multiset | binary search data structures | Statement | D | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1900 | |
| 6446 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 1103 | Find a Gift | binary search interactive probabilities | Statement | G | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2600 | |
| 12426 | Count Triangles | binary search implementation math two pointers | Statement | C | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1250.0 | Codeforces Round #643 (Div. 2) Editorial | 1800 |
| 6163 | Restorer Distance | binary search greedy math sortings ternary search | Statement | E | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 2000.0 | Codeforces Round #643 (Div. 2) Editorial | 2100 |
| 8860 | The Best Vacation | binary search brute force greedy implementation two pointers | Statement | D | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 1500.0 | Codeforces Round #645 (Div. 2) Editorial | 1900 |
| 567 | Tasty Cookie | binary search constructive algorithms greedy implementation | Statement | F | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2500.0 | Codeforces Round #645 (Div. 2) Editorial | 2700 |
| 15641 | Mixing Water | binary search math | Statement | C | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1700 | |
| 633 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 2175 | Johnny and Megan's Necklace | binary search bitmasks constructive algorithms dfs and similar dsu graphs | Statement | C | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2000.0 | Codeforces Round #647 Editorial | 2500 |
| 4485 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 4702 | Two Arrays | binary search brute force combinatorics dp greedy implementation two pointers | Statement | E | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 950 | Jog Around The Graph | binary search dp geometry graphs | Statement | F | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 33475 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5968 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 2032 | Flying Sort (Hard Version) | binary search dp greedy two pointers | Statement | F2 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 5313 | Binary Subsequence Rotation | binary search data structures dp greedy implementation | Statement | E | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #651 | |
| 1863 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1751 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 11378 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 2554 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 1930 | Network Coverage | binary search data structures flows graph matchings graphs greedy | Statement | F | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 19582 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 1142 | Reading Books (hard version) | binary search data structures greedy sortings ternary search two pointers | Statement | E2 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 13249 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 6236 | Choosing flowers | binary search data structures greedy math sortings two pointers | Statement | C | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1250.0 | Codeforces Round #657 Editorial | 2000 |
| 758 | Chess Strikes Back (easy version) | binary search data structures | Statement | F1 | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2700 |
| 29406 | Make It Good | binary search greedy | Statement | C | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1200 | |
| 366 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 272 | Viruses | *special | Statement | C | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | |||
| 4600 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2732 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 11124 | 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 | |
| 1298 | Boboniu and String | binary search geometry ternary search | Statement | C | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1500.0 | Codeforces Round #664 Editorial | 2600 |
| 443 | 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 | |
| 15607 | 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 | |
| 1502 | 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 | ||
| 39982 | 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 | ||
| 2650 | 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 | ||
| 2616 | 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 | ||
| 11786 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 2028 | 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 | |
| 364 | 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 | ||
| 3142 | Fixed Point Removal | binary search data structures greedy | Statement | C | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1500.0 | Codeforces Round #668 Editorial | |
| 2003 | 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 | |
| 3887 | 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 | |
| 6041 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 4756 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 9402 | Discrete Acceleration | binary search implementation math two pointers | Statement | C | Grakn Forces 2020 {1408} | PROGRAMMING | 1250.0 | Grakn Forces -- Editorial | |
| 8564 | Two Platforms | binary search dp sortings two pointers | Statement | E | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 2324 | 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 | |
| 17887 | 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 |
| 2411 | 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) | ||
| 17725 | 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 | |
| 685 | 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 | |
| 26743 | 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 | |
| 2269 | Valuable Paper | binary search flows graph matchings graphs | Statement | B | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 5530 | Lonely Numbers | binary search math number theory | Statement | K | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 20827 | Increase and Copy | binary search constructive algorithms math | Statement | C | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1100 | |
| 98 | Prison Break | binary search games geometry ternary search | Statement | H | Codeforces Global Round 11 {1427} | PROGRAMMING | 4500.0 | Editorial of Global Round 11 | 3500 |
| 2669 | 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 | |
| 4429 | 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 | |
| 131 | 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 | |
| 165 | Neural Network Problem | *special binary search greedy | Statement | F | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 11910 | Binary Search | binary search combinatorics | Statement | C | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 1500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 3009 | Complicated Computations | binary search data structures sortings two pointers | Statement | E | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 6589 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 2367 | Greedy Shopping | binary search data structures greedy | Statement | C | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1750.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 17169 | The Delivery Dilemma | binary search greedy sortings | Statement | C | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 4220 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 489 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 15641 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 2267 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 5018 | Array Partition | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 10461 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 11841 | Close Tuples (hard version) | binary search combinatorics implementation math sortings two pointers | Statement | E2 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 15716 | Close Tuples (easy version) | binary search combinatorics math sortings two pointers | Statement | E1 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 8931 | The Treasure of The Segments | binary search data structures greedy sortings | Statement | F | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 4948 | Pairs | binary search constructive algorithms greedy | Statement | D | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 251 | The Riddle of the Sphinx | binary search data structures data structures interactive | Statement | I | Good Bye 2020 {1466} | PROGRAMMING | 4000.0 | Good Bye 2020 Editorial | |
| 5418 | Firecrackers | binary search sortings | Statement | D | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 1138 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 1487 | Strange Shuffle | binary search brute force constructive algorithms interactive probabilities | Statement | C | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1000.0 | 86464 | |
| 996 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 9188 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 43703 | Different Divisors | binary search constructive algorithms greedy math number theory | Statement | B | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1000.0 | Codeforces Round #696 Editorial | |
| 11407 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 21921 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 46220 | K-divisible Sum | binary search constructive algorithms greedy math | Statement | A | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 13463 | Searching Local Minimum | binary search interactive ternary search | Statement | A | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 364 | Vabank | binary search interactive | Statement | G | Технокубок 2021 - Финал {1482} | PROGRAMMING | 3500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 41 | Vabank | binary search interactive | Statement | E | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 11274 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 3585 | Paired Payment | binary search constructive algorithms dp graphs shortest paths | Statement | E | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 2250.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 10550 | Max Median | binary search data structures dp two pointers | Statement | D | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 14560 | Guessing the Greatest (easy version) | binary search interactive | Statement | C1 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 10303 | Guessing the Greatest (hard version) | binary search interactive | Statement | C2 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 21044 | Pythagorean Triples | binary search math number theory | Statement | D | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 518 | Two Policemen | *special binary search brute force math | Statement | C | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 360 | Problemsolving Marathon | *special binary search greedy | Statement | D | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 194 | Dogecoin | *special *special binary search data structures | Statement | F | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 40043 | Sum of Cubes | binary search brute force brute force math | Statement | C | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 21493 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 18822 | Equalize the Array | binary search data structures greedy math sortings | Statement | F | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 6326 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 1183 | Magnets | binary search constructive algorithms interactive | Statement | F | Codeforces Global Round 13 {1491} | PROGRAMMING | 2000.0 | Codeforces Global Round 13 Editorial | |
| 5033 | K-beautiful Strings | binary search brute force greedy implementation strings | Statement | C | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 15534 | Berland Crossword | binary search bitmasks brute force greedy implementation | Statement | B | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 5783 | 1D Sokoban | binary search implementation two pointers | Statement | C | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 25293 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2396 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 433 | Subset Trick | binary search data structures | Statement | E | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2500.0 | Codeforces Round #707 Editorial | 3300 |
| 3943 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 4523 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 6929 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 5115 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial | |
| 722 | Baby Ehab's Hyper Apartment | binary search graphs interactive sortings | Statement | E | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2500.0 | Codeforces round #716 editorial | |
| 450 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 5413 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 1070 | Group Photo | binary search combinatorics implementation two pointers | Statement | E | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 2500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 3455 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 15191 | Guess the K-th Zero (Easy version) | binary search interactive | Statement | F1 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 770 | Nastia and a Beautiful Matrix | binary search constructive algorithms greedy math | Statement | E | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2750.0 | 90477 | |
| 3146 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |
| 15781 | Pursuit | binary search greedy sortings | Statement | C | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1000.0 | Codeforces Round #733 Editorial (all problems) | |
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 224 | Binary String Partition | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 3187 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 737 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 17196 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 6454 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 36401 | Number of Pairs | binary search data structures math two pointers | Statement | C | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 22812 | Interesting Function | binary search dp math | Statement | F | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 5463 | Gift Set | binary search geometry greedy math ternary search | Statement | G | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 12957 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1119 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 413 | Inverse Inversions | binary search brute force data structures | Statement | D | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 3000.0 | Tutorial | |
| 7380 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 11776 | Integers Have Friends | binary search data structures math number theory two pointers | Statement | B | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 1974 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 16875 | Wonderful Coloring - 2 | binary search constructive algorithms data structures greedy | Statement | B2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 3431 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 472 | Guess the Perimeter | binary search interactive number theory | Statement | H | Codeforces Global Round 15 {1552} | PROGRAMMING | 2750.0 | Editorial of Global Round 15 | |
| 1318 | Common Divisor Graph | binary search dsu graphs math number theory | Statement | G | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 9949 | Mikasa | binary search bitmasks greedy implementation | Statement | C | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #735 (Div. 2) | 1800 |
| 4847 | Boring Segments | binary search data structures sortings two pointers | Statement | E | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2100 | |
| 777 | Down Below | binary search dfs and similar graphs meet-in-the-middle shortest paths | Statement | E | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 3000.0 | Codeforces Round #740 Editorial | 3000 |
| 8962 | Polycarp and String Transformation | binary search implementation sortings strings | Statement | E | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1800 | |
| 6870 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 23475 | Deep Down Below | binary search greedy sortings | Statement | C | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1300 |
| 2308 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 67 | Physical Examination | *special binary search data structures | Statement | I | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 10787 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 389 | Polygon | binary search dp | Statement | E | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 3000 |
| 18866 | Slay the Dragon | binary search greedy sortings | Statement | C | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 566 | Building an Amusement Park | binary search geometry | Statement | B | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1472 | Labyrinth | binary search dsu | Statement | L | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 5456 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2836 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2207 | Korney Korneevich and XOR (hard version) | binary search brute force dp two pointers | Statement | F2 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 4342 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 4063 | Guess the Permutation | binary search combinatorics interactive math | Statement | D | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2000 |
| 1509 | Game with Stones | binary search data structures games greedy | Statement | E | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2300 |
| 2681 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 | |
| 28434 | Save More Mice | binary search greedy greedy | Statement | C | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1696 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 373 | Two Sorts | binary search math | Statement | F | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 3000.0 | 95865 | 3400 |
| 1225 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 826 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 325 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 532 | The Cells on the Paper | binary search data structures implementation sortings | Statement | E | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 10596 | Complex Market Analysis | binary search dp implementation number theory schedules two pointers | Statement | C | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1500.0 | Deltix Round, Autumn 2021. Editorial | 1400 |
| 1089 | Interesting Sections | binary search data structures divide and conquer geometry meet-in-the-middle | Statement | F | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3000.0 | Deltix Round, Autumn 2021. Editorial | 2800 |
| 2154 | AmShZ and G.O.A.T. | binary search brute force greedy math | Statement | E | Codeforces Global Round 17 {1610} | PROGRAMMING | 2500.0 | Codeforces Global Round 17 Editorial | |
| 16728 | Keshi Is Throwing a Party | binary search greedy | Statement | C | Codeforces Global Round 17 {1610} | PROGRAMMING | 1500.0 | Codeforces Global Round 17 Editorial | |
| 7677 | ATM and Students | binary search data structures two pointers | Statement | F | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 32394 | Team Composition: Programmers and Mathematicians | binary search constructive algorithms math | Statement | B | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 28258 | Chat Ban | binary search math | Statement | C | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 31486 | Poisoned Dagger | binary search | Statement | C | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 1001 | Divan and a Cottage | binary search data structures | Statement | E | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 2750.0 | Tutorial | 2600 |
| 2041 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 8800 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2831 | Unusual Minesweeper | binary search dfs and similar dsu implementation sortings | Statement | G | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4916 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1965 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 15988 | Set or Decrease | binary search greedy ternary search | Statement | C | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 14750 | Balanced Stone Heaps | binary search greedy | Statement | C | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 3939 | Interacdive Problem | binary search constructive algorithms interactive | Statement | F | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 19485 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 2388 | Binary Spiders | bitmasks data structures implementation sortings trees | Statement | D | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 4451 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 123 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 6577 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 14290 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 5491 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1829 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 3937 | Best Pair | binary search brute force | Statement | E | Codeforces Global Round 19 {1637} | PROGRAMMING | 2500.0 | Tutorial | |
| 2917 | Anonymity Is Important | binary search data structures dsu sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 4513 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 541 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 6873 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 1296 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 5397 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 12404 | Maximum Product Strikes Back | binary search implementation math | Statement | D | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 10868 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial |