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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 439 | Forward, march! | binary search dp greedy | Statement | E | Codeforces Beta Round 11 {11} | PROGRAMMING | 2800 | ||
| 916 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Tutorial for problem A | 2700 | |
| 2774 | Three Base Stations | binary search greedy | Statement | C | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1800 | |
| 547 | Need For Brake | binary search greedy sortings | Statement | B | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2000 | |
| 1096 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 4743 | New Year Snowmen | binary search data structures greedy | Statement | C | Codeforces Round 100 {140} | PROGRAMMING | Codeforces Round #100: problem analysis | 1800 | |
| 5463 | Dress'em in Vests! | binary search brute force greedy two pointers | Statement | A | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1300 | |
| 19686 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 2338 | Olympiad | binary search greedy sortings two pointers | Statement | D | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 1800 | |
| 3391 | Well-known Numbers | binary search greedy number theory | Statement | B | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1600 | ||
| 2824 | Cycles | binary search constructive algorithms graphs greedy | Statement | A | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 1800 | |
| 528 | Sweets for Everyone! | binary search greedy implementation | Statement | D | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2400 | |
| 10793 | k-Multiple Free Set | binary search greedy sortings | Statement | A | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 1600 | |
| 1492 | Memory for Arrays | binary search bitmasks greedy | Statement | C | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 1900 | |
| 299 | Sheep | binary search greedy | Statement | E | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2900 | |
| 2842 | Banana | binary search constructive algorithms greedy | Statement | A | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1500 | |
| 5222 | Quiz | binary search greedy math matrices number theory | Statement | C | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1700 | |
| 3205 | Read Time | binary search greedy two pointers | Statement | C | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 4314 | Renting Bikes | binary search greedy | Statement | D | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1800 | |
| 15371 | Counting Kangaroos is Fun | binary search greedy sortings two pointers | Statement | A | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 1700 | |
| 2446 | Preparing for the Contest | binary search data structures greedy sortings | Statement | B | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2100 | |
| 637 | Maze 1D | binary search greedy implementation | Statement | E | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2700 | |
| 747 | Mashmokh and Water Tanks | binary search data structures greedy trees two pointers | Statement | D | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2300 | |
| 6683 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 8690 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1600 | |
| 8455 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 6749 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 3732 | MUH and House of Cards | binary search brute force greedy math | Statement | C | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1700 | |
| 5002 | Long Jumps | binary search greedy implementation | Statement | D | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1800 | |
| 1698 | Restoring Increasing Sequence | binary search brute force greedy implementation | Statement | E | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2100 | |
| 1559 | Mr. Kitayuta vs. Bamboos | binary search greedy | Statement | E | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2800 | |
| 485 | Berland Miners | binary search data structures dfs and similar greedy trees | Statement | A | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 2572 | Handshakes | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2000 | ||
| 3983 | Tavas and Karafs | binary search greedy math | Statement | C | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1900 | |
| 6126 | Tourist's Notes | binary search brute force greedy implementation math | Statement | C | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1600 | |
| 3979 | GukiZ hates Boxes | binary search greedy | Statement | C | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2200 | |
| 2263 | Kyoya and Permutation | binary search combinatorics constructive algorithms greedy implementation math | Statement | B | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2200 | |
| 1081 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 5234 | One-Dimensional Battle Ships | binary search data structures greedy sortings | Statement | D | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1800 | |
| 8977 | More Cowbell | binary search greedy | Statement | B | Codeforces Round 334 (Div. 2) {604} | PROGRAMMING | 21885 | 1400 | |
| 3154 | Gadgets for dollars and pounds | binary search greedy two pointers | Statement | D | Educational Codeforces Round 3 {609} | PROGRAMMING | 2000 | ||
| 2472 | Skills | binary search brute force dp greedy sortings two pointers | Statement | B | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2200 | |
| 979 | Preorder Test | binary search dfs and similar dp graphs greedy trees | Statement | D | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 2600 | |
| 156 | Автобус | binary search data structures greedy sortings | Statement | E | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2500.0 | 2100 | |
| 3255 | Robin Hood | binary search greedy | Statement | B | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 2000 | |
| 2223 | Bear and Tower of Cubes | binary search dp greedy | Statement | B | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2300 | |
| 6161 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1700 | |
| 3344 | Generating Sets | binary search data structures dfs and similar greedy strings trees | Statement | D | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1900 | |
| 954 | Polycarp's problems | binary search dp greedy | Statement | F | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 2300 | |
| 4174 | Road to Cinema | binary search greedy sortings | Statement | C | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 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 | |
| 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 | |
| 6984 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 4027 | Magazine Ad | binary search greedy | Statement | D | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1900 | |
| 2176 | Selling Souvenirs | binary search dp greedy ternary search | Statement | E | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 5125 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 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 | |
| 3536 | Maximize! | binary search greedy ternary search two pointers | Statement | E | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1900 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 832 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 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 | |
| 4029 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 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 | |
| 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 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 6715 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 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 | |
| 3541 | MST Unification | binary search dsu graphs greedy | Statement | F | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 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 | |
| 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 | |
| 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 | |
| 5521 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 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 | |
| 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 | |
| 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 | |
| 7579 | Increasing by Modulo | binary search greedy | Statement | A | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 1800 | |
| 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 | |
| 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 | |
| 262 | Tokitsukaze and Explosion | binary search greedy | Statement | E | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3100 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 4532 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 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 | ||
| 171 | 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 | ||
| 6456 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 2947 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 8144 | 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 | |
| 4180 | 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 | |
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 14956 | 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 |
| 9860 | 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 |
| 172 | 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 |
| 7159 | 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 |
| 1362 | 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 |
| 7006 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 9599 | 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 |
| 30424 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 264 | 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 |
| 38877 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 | |
| 12116 | 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 |
| 6362 | 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 | |
| 1289 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 9335 | 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 |
| 5824 | 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 |
| 8701 | 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 |
| 501 | 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 |
| 4616 | 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 | ||
| 32954 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5803 | 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 | ||
| 1863 | 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 | ||
| 5216 | 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 | |
| 10812 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1873 | 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 | ||
| 19332 | 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 | ||
| 1063 | Reading Books (hard version) | binary search data structures greedy sortings ternary search two pointers | Statement | E2 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 6072 | 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 |
| 28854 | Make It Good | binary search greedy | Statement | C | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1200 | |
| 4546 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2391 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 11042 | 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 | |
| 2592 | 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 | ||
| 2515 | 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 | ||
| 11678 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 3043 | Fixed Point Removal | binary search data structures greedy | Statement | C | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1500.0 | Codeforces Round #668 Editorial | |
| 3804 | 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 | |
| 5687 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 17367 | 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 | |
| 26357 | 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 | |
| 4193 | 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 | |
| 161 | Neural Network Problem | *special binary search greedy | Statement | F | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 6486 | 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 | |
| 2201 | 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 | |
| 16744 | 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 | |
| 15460 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 2216 | 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 | |
| 4643 | 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 | ||
| 8371 | 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 | ||
| 4826 | Pairs | binary search constructive algorithms greedy | Statement | D | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 1078 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 40032 | 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 | |
| 11170 | 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 | ||
| 21491 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 44736 | K-divisible Sum | binary search constructive algorithms greedy math | Statement | A | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 360 | Problemsolving Marathon | *special binary search greedy | Statement | D | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 20950 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 18297 | 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 | ||
| 4941 | 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 | |
| 15296 | 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 | ||
| 23152 | 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 | |
| 3838 | 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 |
| 6802 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 4803 | 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 | |
| 729 | Nastia and a Beautiful Matrix | binary search constructive algorithms greedy math | Statement | E | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2750.0 | 90477 | |
| 15546 | 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 | ||
| 3059 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 16236 | 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 | |
| 6133 | 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 | |
| 5192 | Gift Set | binary search geometry greedy math ternary search | Statement | G | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 12703 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1833 | 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 | ||
| 16636 | 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) | ||
| 9670 | 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 |
| 6741 | 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 | |
| 21213 | 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 |
| 18538 | Slay the Dragon | binary search greedy sortings | Statement | C | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 5337 | 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 | ||
| 2744 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 4196 | 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 | |
| 1465 | 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 |
| 27827 | Save More Mice | binary search greedy greedy | Statement | C | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1921 | 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 | |
| 15525 | Keshi Is Throwing a Party | binary search greedy | Statement | C | Codeforces Global Round 17 {1610} | PROGRAMMING | 1500.0 | Codeforces Global Round 17 Editorial | |
| 1922 | 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 | ||
| 8439 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4795 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1914 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 15495 | 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 | ||
| 14286 | Balanced Stone Heaps | binary search greedy | Statement | C | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 19038 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4324 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 6472 | 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 | |
| 14048 | 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 | |
| 5313 | 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 | |
| 4457 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 1212 | 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 | |
| 10480 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 805 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1793 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 9835 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 881 | Even Split | binary search constructive algorithms greedy | Statement | E | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 39261 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 25213 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 2514 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 7281 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 32825 | Eating Queries | binary search greedy sortings | Statement | E | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 4314 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 11087 | Binary String | binary search greedy two pointers | Statement | C | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 16948 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 6004 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 1782 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 6976 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 6260 | Permutation Restoration | binary search data structures greedy math sortings | Statement | D | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 23669 | Schedule Management | binary search greedy | Statement | C | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 29784 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 2446 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7706 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 15414 | Doremy's IQ | binary search greedy implementation | Statement | A | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 500.0 | 104930 |