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 |
|---|---|---|---|---|---|---|---|---|---|
| 10157 | Sanatorium | binary search constructive algorithms greedy implementation math | Statement | C | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 1300 | |
| 5909 | Exams | binary search greedy sortings | Statement | D | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 1700 | |
| 5681 | Anton and Making Potions | binary search dp greedy two pointers | Statement | C | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 1600 | |
| 5098 | Alyona and a tree | binary search data structures dfs and similar graphs trees | Statement | B | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2000 | |
| 16037 | Chloe and the sequence | binary search bitmasks constructive algorithms implementation | Statement | B | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1200 | |
| 1626 | Vladik and cards | binary search bitmasks brute force dp | Statement | E | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 2300 | |
| 1596 | Santa Claus and Tangerines | binary search data structures greedy two pointers | Statement | E | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 2705 | Leaving Auction | binary search data structures | Statement | D | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | 2000 | ||
| 6984 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 92149 | New Year and Hurry | binary search brute force implementation math | Statement | A | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 800 | |
| 2685 | Fedor and coupons | binary search data structures greedy sortings | Statement | D | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2000 | ||
| 12865 | PolandBall and Game | binary search data structures games greedy sortings strings | Statement | B | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1200 | |
| 4530 | Travel Card | binary search dp | Statement | B | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1700 | |
| 4050 | Unfair Poll | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1700 | |
| 7758 | Frodo and pillows | binary search greedy | Statement | B | Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition) {760} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1500 | |
| 4196 | Dasha and Very Difficult Problem | binary search brute force constructive algorithms greedy sortings | Statement | D | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1700 | |
| 2984 | Two strings | binary search hashing strings two pointers | Statement | C | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2100 | |
| 1629 | Radio stations | binary search data structures | Statement | E | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 2411 | Cartons of milk | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 402 | The Winds of Winter | binary search data structures | Statement | G | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 3000 | |
| 4987 | Voltage Keepsake | binary search math | Statement | A | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 1800 | |
| 219 | Verifying Kingdom | binary search divide and conquer interactive trees | Statement | E | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 3200 | |
| 4781 | Success Rate | binary search math | Statement | A | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 1700 | |
| 994 | Prairie Partition | binary search constructive algorithms greedy math | Statement | C | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2300 | |
| 387 | Bars | *special binary search | Statement | L | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2200 | |
| 293 | Significant Cups | *special binary search data structures two pointers | Statement | B | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2300 | |
| 152 | Pens And Days Of Week | *special binary search number theory | Statement | F | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2600 | |
| 6237 | Molly's Chemicals | binary search brute force data structures implementation math | Statement | C | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 1800 | |
| 6815 | Alyona and Spreadsheet | binary search data structures dp greedy implementation two pointers | Statement | C | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1600 | |
| 5249 | Cloud of Hashtags | binary search greedy implementation strings | Statement | D | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1800 | |
| 12787 | String Game | binary search greedy strings | Statement | A | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 1600 | |
| 12587 | The Meeting Place Cannot Be Changed | binary search | Statement | B | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1600 | |
| 132 | Intranet of Buses | binary search geometry implementation two pointers | Statement | H | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 3000 | |
| 7806 | Anton and Fairy Tale | binary search math | Statement | C | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 1600 | |
| 729 | Exam Cheating | binary search dp | Statement | E | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2800 | |
| 2176 | Broken BST | data structures dfs and similar | Statement | D | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 2200 | |
| 4049 | Fountains | binary search data structures implementation | Statement | C | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 1700 | |
| 122 | Cut the pie | binary search data structures geometry | Statement | G | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 2600 | |
| 1486 | April Fools' Problem (medium) | binary search flows graphs | Statement | M2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 1464 | April Fools' Problem (medium) | binary search flows graphs | Statement | N | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2500 | |
| 1292 | April Fools' Problem (hard) | binary search data structures flows | Statement | M3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2900 | |
| 1264 | April Fools' Problem (hard) | binary search data structures flows | Statement | O | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 3200 | |
| 4027 | Magazine Ad | binary search greedy | Statement | D | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1900 | |
| 1552 | Expected diameter of a tree | binary search brute force dfs and similar dp sortings trees | Statement | D | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 2600 | |
| 8067 | Array Division | binary search data structures implementation | Statement | D | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1900 | |
| 2176 | Selling Souvenirs | binary search dp greedy ternary search | Statement | E | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 | |
| 1560 | Card Game | binary search flows graphs | Statement | F | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2500 | |
| 1772 | Glad to see you! | binary search interactive | Statement | B | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 2200 | |
| 17414 | Sagheer and Nubian Market | binary search sortings | Statement | C | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 1500 | |
| 3048 | Army Creation | binary search data structures | Statement | E | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2300 | |
| 749 | Karen and Cards | binary search combinatorics data structures geometry | Statement | D | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2700 | |
| 244 | Karen and Neighborhood | binary search constructive algorithms implementation | Statement | E | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2900 | |
| 27058 | Karen and Coffee | binary search data structures implementation | Statement | B | Codeforces Round 419 (Div. 2) {816} | PROGRAMMING | Codeforces Round #419 Editorial | 1400 | |
| 8446 | Really Big Numbers | binary search brute force dp math | Statement | C | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1600 | |
| 3340 | MEX Queries | binary search data structures trees | Statement | F | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2400 | |
| 2673 | Card Game Again | binary search data structures number theory two pointers | Statement | E | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2000 | |
| 1924 | Level Generation | binary search math ternary search | Statement | F | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2200 | |
| 4930 | Hacker, pack your bags! | binary search greedy implementation sortings | Statement | C | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 1600 | |
| 1059 | Liar | binary search dp hashing string suffix structures | Statement | E | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2500 | |
| 3717 | Suitable Replacement | binary search greedy implementation | Statement | D | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 1600 | |
| 8206 | Office Keys | binary search brute force dp greedy sortings | Statement | A | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 1900 | |
| 479 | Strange Radiation | binary search implementation math | Statement | C | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 2500 | |
| 6456 | The Bakery | binary search data structures divide and conquer dp two pointers | Statement | B | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2200 | |
| 1346 | The penguin's game | binary search constructive algorithms interactive | Statement | E | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | 2400 | ||
| 2057 | Vasya's Function | binary search implementation math | Statement | E | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2200 | |
| 1078 | Prefix Sums | binary search brute force combinatorics math matrices | Statement | F | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2500 | |
| 4449 | Vitya and Strange Lesson | binary search data structures | Statement | D | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2100 | |
| 500 | Nikita and game | binary search dfs and similar divide and conquer graphs trees | Statement | E | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 3000 | |
| 691 | Fire in the City | binary search data structures | Statement | E | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2500 | |
| 2834 | Monitor | binary search data structures | Statement | D | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 6261 | Preparing for Merge Sort | binary search data structures | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | ||
| 3653 | Packmen | binary search dp | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 776 | Students Initiation | binary search flows | Statement | J | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2400 | ||
| 1232 | Exploration plan | binary search flows graph matchings shortest paths | Statement | D | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2400 | |
| 712 | Michael and Charging Stations | binary search dp greedy | Statement | D | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 2400 | |
| 576 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 2036 | Mahmoud and Ehab and the binary string | binary search divide and conquer interactive | Statement | D | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2000 | |
| 2166 | Mahmoud and Ehab and the function | binary search data structures sortings | Statement | E | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2200 | |
| 1932 | Ordering Pizza | binary search sortings ternary search | Statement | B | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 1900 | |
| 936 | Gotta Go Fast | binary search dp | Statement | C | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2500 | |
| 2483 | High Cry | binary search bitmasks combinatorics data structures divide and conquer | Statement | D | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2200 | |
| 1005 | Delivery Club | binary search data structures dp | Statement | E | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2600 | |
| 2310 | Photo Processing | binary search dp | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 658 | Downloading B++ | binary search | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2400 | ||
| 487 | Packmen Strike Back | binary search dp | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 181 | Little Brother | binary search geometry sortings | Statement | E | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2700 | |
| 8965 | K-Dominant Character | binary search implementation two pointers | Statement | C | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1400 | |
| 667 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 3808 | XK Segments | binary search math sortings two pointers | Statement | B | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 1700 | |
| 3787 | Nephren gives a riddle | binary search dfs and similar | Statement | A | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 1700 | |
| 2294 | Ithea Plays With Chtholly | binary search constructive algorithms games greedy interactive | Statement | B | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2000 | |
| 1296 | Bipartite Segments | binary search data structures dfs and similar dsu graphs two pointers | Statement | C | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 2500 | |
| 12781 | Two Cakes | binary search brute force implementation | Statement | B | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 1200 | |
| 2037 | Prime Gift | binary search dfs and similar math meet-in-the-middle number theory two pointers | Statement | E | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2600 | |
| 5125 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 31548 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 1980 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 7741 | Producing Snow | binary search data structures | Statement | B | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1600 | |
| 5613 | Three-level Laser | binary search greedy two pointers | Statement | B | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1600 | |
| 3860 | Stairs and Elevators | binary search | Statement | A | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1700 | |
| 2341 | Resource Distribution | binary search implementation sortings | Statement | B | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1800 | |
| 167 | Parametric Circulation | binary search flows | Statement | F | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 3300 | |
| 9151 | Recursive Queries | binary search data structures dfs and similar | Statement | B | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 1300 | |
| 1966 | Tree | binary search dp trees | Statement | D | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2200 | |
| 4635 | Save Energy! | binary search implementation math | Statement | A | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 1700 | |
| 3468 | Constructing Tests | binary search brute force constructive algorithms | Statement | C | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1700 | |
| 4918 | Convenient For Everybody | binary search two pointers | Statement | C | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1600 | |
| 3536 | Maximize! | binary search greedy ternary search two pointers | Statement | E | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1900 | |
| 3756 | Alena And The Heater | binary search implementation | Statement | D | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1600 | |
| 881 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 2400 | |
| 2088 | Water Taps | binary search greedy sortings | Statement | E | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2000 | |
| 2394 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 2886 | Sad powers | binary search math number theory | Statement | C | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2100 | |
| 1437 | Lightsabers (medium) | binary search two pointers | Statement | F2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1900 | |
| 1149 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2300 | |
| 944 | k-substrings | binary search hashing string suffix structures | Statement | F | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 3343 | Single-use Stones | binary search flows greedy two pointers | Statement | D | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 11027 | Valhalla Siege | binary search | Statement | C | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1400 | |
| 29693 | Letters | binary search implementation two pointers | Statement | C | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1000 | |
| 9198 | Mentors | binary search data structures implementation | Statement | F | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 2171 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 900 | Round Marriage | binary search graph matchings greedy | Statement | F | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2500 | |
| 1188 | NN country | binary search data structures trees | Statement | E | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2700 | |
| 4142 | Pencils and Boxes | binary search data structures dp greedy two pointers | Statement | E | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2000 | |
| 2743 | Sand Fortress | binary search constructive algorithms math | Statement | D | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2100 | |
| 536 | A Shade of Moonlight | binary search geometry math sortings two pointers | Statement | D | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2500 | |
| 11488 | Candies | binary search implementation | Statement | C | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 1673 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2600 | |
| 832 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 9889 | World Cup | binary search math | Statement | B | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1300 | |
| 1232 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 25179 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 527 | Guess two numbers | binary search interactive | Statement | C | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2800 | |
| 8991 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 6370 | Rocket | binary search interactive | Statement | B | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 11014 | Planning The Expedition | binary search brute force implementation | Statement | B | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1200 | |
| 4029 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 1295 | Rest In The Shades | binary search geometry | Statement | E | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2400 | |
| 2110 | The hat | binary search interactive | Statement | B | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2200 | |
| 724 | Large Triangle | binary search geometry sortings | Statement | D | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2700 | |
| 4113 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 1945 | Session in BSU | binary search dfs and similar dsu graph matchings graphs | Statement | F | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2400 | |
| 2749 | Multicolored Markers | binary search brute force math number theory | Statement | F | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 787 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 | |
| 585 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 2582 | Subway Pursuit | binary search interactive probabilities | Statement | B | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2100 | |
| 10217 | Coffee Break | binary search data structures greedy two pointers | Statement | C | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1500 | |
| 6413 | Glider | binary search data structures two pointers | Statement | D | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1700 | |
| 14059 | Benches | binary search implementation | Statement | A | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 3073 | The Tower is Going Home | binary search two pointers | Statement | A | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1700 | |
| 1205 | Vasya and Big Integers | binary search data structures dp hashing strings | Statement | E | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2500 | |
| 886 | Segments on the Line | binary search dp | Statement | E | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2400 | |
| 703 | Write The Contest | binary search dp math | Statement | F | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2400 | |
| 2991 | Nature Reserve | binary search geometry ternary search | Statement | D | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2200 | |
| 1619 | Split the Tree | binary search data structures dp greedy trees | Statement | E | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2400 | |
| 5205 | Maximum Subrectangle | binary search implementation two pointers | Statement | C | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 1600 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 3275 | Dwarves, Hats and Extrasensory Abilities | binary search constructive algorithms geometry interactive | Statement | C | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | 1900 | ||
| 5935 | Boxes Packing | binary search implementation | Statement | D | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 1456 | Getting Deals Done | binary search data structures | Statement | E | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2300 | |
| 159 | Rain Protection | binary search geometry | Statement | E | Codeforces Round 517 (Div. 1, based on Technocup 2019 Elimination Round 2) {1071} | PROGRAMMING | Разбор задач Отборочного Раунда 2 Технокубка 2019 и Codeforces Round #517 | 3500 | |
| 6715 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 5417 | Vasya and Robot | binary search two pointers | Statement | C | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1800 | |
| 13390 | Meme Problem | binary search math | Statement | C | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1300 | |
| 10437 | Cutting Out | binary search sortings | Statement | D | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1600 | |
| 2814 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 6293 | Increasing Frequency | binary search dp greedy | Statement | E | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2000 | |
| 1086 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 | |
| 1161 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 273 | Fedya the Potter | binary search implementation math number theory | Statement | E | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3400 | |
| 11472 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 1033 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 10858 | NN and the Optical Illusion | binary search geometry math | Statement | C | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 2609 | Andrew and Taxi | binary search dfs and similar graphs | Statement | E | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2200 | |
| 1627 | Trucks and Cities | binary search dp | Statement | F | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2500 | |
| 2348 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 3521 | Game with modulo | binary search constructive algorithms interactive | Statement | B | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2000 | |
| 1240 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp dsu | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 3541 | MST Unification | binary search dsu graphs greedy | Statement | F | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 287 | Sasha and a Patient Friend | binary search data structures implementation | Statement | C | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2800 | |
| 6878 | Creative Snap | binary search brute force divide and conquer math | Statement | C | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1700 | |
| 3181 | Arithmetic Progression | binary search interactive number theory probabilities | Statement | E | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2100 | |
| 9088 | Magic Ship | binary search | Statement | C | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1800 | |
| 6774 | Coffee and Coursework (Hard Version) | binary search greedy | Statement | D2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1900 | |
| 16252 | Alyona and a Narrow Fridge | binary search flows greedy sortings | Statement | B | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1300 | |
| 5166 | Frets On Fire | binary search sortings | Statement | D | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1700 | |
| 1000 | Morse Code | binary search data structures dp hashing sortings string suffix structures strings | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2300 | |
| 565 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 15631 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 2256 | Stressful Training | binary search greedy | Statement | D | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2300 | |
| 1187 | Nastya Hasn't Written a Legend | binary search data structures | Statement | E | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 2500 | |
| 21939 | Sushi for Two | binary search greedy implementation | Statement | A | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 900 | |
| 2542 | Privatization of Roads in Treeland | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | G | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2500 | |
| 7922 | Born This Way | binary search brute force two pointers | Statement | B | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1700 | |
| 5521 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 1754 | Serval and Snake | binary search brute force interactive | Statement | E | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 2100 | |
| 6654 | Match Points | binary search greedy sortings ternary search two pointers | Statement | C | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2000 | |
| 9173 | Minimum Array | binary search data structures greedy | Statement | E | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 8308 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 193 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 | |
| 2144 | Microtransactions (easy version) | binary search greedy | Statement | F1 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 2446 | Microtransactions (hard version) | binary search greedy implementation | Statement | F2 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 11013 | A Tale of Two Lands | binary search sortings two pointers | Statement | C | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1600 | |
| 2282 | Cute Sequences | binary search brute force greedy math | Statement | D | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2100 | |
| 2923 | Range Deleting | binary search combinatorics data structures two pointers | Statement | E | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2100 | |
| 7579 | Increasing by Modulo | binary search greedy | Statement | A | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 1800 | |
| 274 | Sliding Doors | *special binary search | Statement | E | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 135 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 7256 | Electrification | binary search brute force greedy | Statement | C | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 2932 | Digits Sequence (Hard Edition) | binary search divide and conquer implementation | Statement | B | Testing Round 15 (Unrated) {1177} | PROGRAMMING | 1800 | ||
| 297 | Stock Exchange | binary search flows graphs | Statement | H | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 3500 | |
| 2444 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 2791 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 398 | Maximum Sine | binary search data structures number theory | Statement | F | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2900 | |
| 15024 | Computer Game | binary search math | Statement | C | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 6214 | The Doctor Meets Vader (Easy) | binary search sortings | Statement | B1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1400 | |
| 12871 | Letters Shop | binary search implementation strings | Statement | B | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1300 | |
| 262 | Tokitsukaze and Explosion | binary search greedy | Statement | E | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3100 | |
| 21868 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 1848 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 9952 | Welfare State | binary search brute force data structures sortings | Statement | B | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1600 | |
| 32761 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 2531 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 540 | You Are Given Some Letters... | binary search implementation math | Statement | F | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2800 | |
| 8099 | Remove the Substring (hard version) | binary search greedy implementation two pointers | Statement | D2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1800 | |
| 11626 | Uniqueness | binary search brute force implementation two pointers | Statement | B | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1500 | |
| 5439 | Restore Permutation | binary search data structures greedy implementation | Statement | D | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1900 | |
| 216 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 252 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 57 | Road Repair in Treeland | *special binary search dp trees | Statement | H | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 3718 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 1648 | Numerical Sequence (hard version) | binary search math | Statement | E2 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 15814 | Creating a Character | binary search math | Statement | A | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1300 | |
| 7849 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 845 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 24601 | Perfect Team | binary search math | Statement | C | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1200 | |
| 1235 | Choose a Square | binary search data structures sortings | Statement | F | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2500 | |
| 9744 | Save the Nature | binary search greedy | Statement | C | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1600 | |
| 276 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 2082 | Rock Is Push | binary search dp | Statement | E | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2200 | |
| 1639 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 | |
| 730 | Alice and the Unfair Game | binary search data structures dp dsu | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 4532 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 4771 | Balanced Playlist | binary search data structures implementation | Statement | D | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 1519 | Balanced Binary Search Trees | dp math | Statement | E | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2400 | |
| 6438 | AB-string | binary search combinatorics dp strings | Statement | D | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1800 | |
| 6385 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 | |
| 13511 | Good Numbers (hard version) | binary search greedy math meet-in-the-middle | Statement | C2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1500 | |
| 4684 | Divide The Students | binary search greedy math | Statement | L | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1700 | ||
| 3242 | The Parade | binary search greedy | Statement | J | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 |