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 |
|---|---|---|---|---|---|---|---|---|---|
| 3858 | Exposition | binary search data structures dsu trees two pointers | Statement | E | Codeforces Beta Round 6 (Div. 2 Only) {6} | PROGRAMMING | Beta Round #6 - Разбор задач | 1900 | |
| 674 | Don't fear, DravDe is kind | binary search data structures dp hashing | Statement | D | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2600 | |
| 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 | |
| 2831 | Domino Principle | binary search data structures sortings | Statement | E | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 1773 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 629 | Lucky Tickets | binary search data structures sortings two pointers | Statement | C | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2200 | |
| 768 | Tourist | binary search data structures dp | Statement | F | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2400 | |
| 2415 | Sum of Medians | binary search brute force data structures implementation | Statement | D | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 7705 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 3191 | Buses | binary search data structures dp | Statement | B | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 1900 | |
| 4097 | Petya and Divisors | binary search data structures number theory | Statement | B | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 1900 | |
| 960 | Mushroom Gnomes - 2 | binary search data structures probabilities sortings | Statement | C | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2500 | |
| 4743 | New Year Snowmen | binary search data structures greedy | Statement | C | Codeforces Round 100 {140} | PROGRAMMING | Codeforces Round #100: problem analysis | 1800 | |
| 1034 | Freezing with Style | binary search data structures divide and conquer trees | Statement | E | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 3000 | |
| 3199 | String Manipulation 1.0 | *special binary search brute force data structures strings | Statement | C | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
| 681 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2400 | |
| 173 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2900 | |
| 956 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 550 | Gripping Story | binary search data structures sortings | Statement | E | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2400 | |
| 5876 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 8832 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 613 | Cutting a Fence | binary search data structures dsu | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 5773 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1900 | |
| 522 | Fence | binary search data structures string suffix structures | Statement | D | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 980 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 4470 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 2300 | |
| 583 | Printer | binary search data structures implementation sortings | Statement | E | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 2300 | |
| 503 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2600 | |
| 576 | Sereja and Straight Lines | binary search data structures geometry sortings two pointers | Statement | D | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2400 | |
| 7887 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 295 | Looking for Owls | binary search data structures geometry hashing sortings | Statement | D | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2600 | |
| 5705 | Pair of Numbers | binary search brute force data structures math two pointers | Statement | D | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2100 | |
| 1720 | Dima and Trap Graph | binary search data structures dfs and similar dsu shortest paths two pointers | Statement | D | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 2400 | |
| 2672 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 2764 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 1127 | Choosing Subtree is Fun | binary search data structures dfs and similar trees two pointers | Statement | D | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2600 | |
| 987 | Inna and Sequence | binary search data structures dp trees | Statement | D | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2300 | |
| 206 | Inna and Babies | binary search data structures dsu geometry implementation | Statement | E | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2600 | |
| 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 | |
| 10545 | Bear and Prime Numbers | binary search brute force data structures dp implementation math number theory | Statement | C | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1800 | |
| 987 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2500 | |
| 1038 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 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 | |
| 693 | Bug in Code | binary search data structures sortings | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2100 | |
| 607 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2200 | |
| 1625 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 1184 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 6749 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 41723 | Number of Ways | binary search brute force data structures dp two pointers | Statement | C | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1700 | |
| 4143 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 3013 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2700 | |
| 4186 | Strip | binary search data structures dp two pointers | Statement | B | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2300 | |
| 7496 | Vasya and Basketball | binary search brute force data structures implementation sortings two pointers | Statement | C | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 8082 | Watto and Mechanism | binary search data structures hashing string suffix structures strings | Statement | C | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1900 | |
| 5331 | R2D2 and Droid Army | binary search data structures two pointers | Statement | D | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 2100 | |
| 8296 | A and B and Lecture Rooms | binary search data structures dfs and similar dp trees | Statement | E | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | 2300 | ||
| 7528 | Glass Carving | binary search data structures implementation | Statement | C | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1800 | |
| 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 | ||
| 2486 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 10819 | Mike and Feet | binary search data structures dp dsu | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 2139 | GukiZ and GukiZiana | binary search data structures implementation | Statement | E | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2600 | |
| 10419 | Geometric Progression | binary search data structures dp | Statement | C | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1700 | |
| 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 | |
| 806 | Campus | binary search data structures dsu trees | Statement | D | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3000 | |
| 6311 | Bear and Blocks | binary search data structures dp math | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1800 | |
| 1499 | Painting Edges | binary search data structures | Statement | E | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 3200 | |
| 38710 | Queries about less or equal elements | binary search data structures sortings two pointers | Statement | B | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 1300 | |
| 12260 | Longest k-Good Segment | binary search data structures two pointers | Statement | D | Educational Codeforces Round 5 {616} | PROGRAMMING | Editorial of Educational Codeforces Round 5 | 1700 | |
| 620 | Startup Funding | binary search constructive algorithms data structures probabilities two pointers | Statement | E | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2400 | |
| 22465 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 1000 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 156 | Автобус | binary search data structures greedy sortings | Statement | E | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2500.0 | 2100 | |
| 1592 | Zip-line | binary search data structures dp hashing | Statement | D | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2600 | |
| 2280 | Bear and Bowling 4 | binary search data structures geometry ternary search | Statement | F | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 2500 | |
| 4086 | Friends and Subsequences | binary search data structures | Statement | D | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2200 | |
| 12434 | Vasiliy's Multiset | binary search bitmasks data structures trees | Statement | D | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1800 | |
| 1354 | Animals and Puzzle | binary search data structures | Statement | D | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2700 | |
| 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 | |
| 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 | |
| 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 | ||
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 8067 | Array Division | binary search data structures implementation | Statement | D | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1900 | |
| 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 | |
| 27058 | Karen and Coffee | binary search data structures implementation | Statement | B | Codeforces Round 419 (Div. 2) {816} | PROGRAMMING | Codeforces Round #419 Editorial | 1400 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | ||
| 576 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 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 | |
| 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 | |
| 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 | |
| 5125 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 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 | |
| 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 | |
| 2394 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 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 |
| 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 | |
| 1673 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2600 | |
| 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 | |
| 585 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 6715 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 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 | |
| 273 | Fedya the Potter | binary search implementation math number theory | Statement | E | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3400 | |
| 1033 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 9173 | Minimum Array | binary search data structures greedy | Statement | E | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 2923 | Range Deleting | binary search combinatorics data structures two pointers | Statement | E | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2100 | |
| 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 | |
| 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 | |
| 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 | |
| 845 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 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 | |
| 730 | Alice and the Unfair Game | binary search data structures dp dsu | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 4771 | Balanced Playlist | binary search data structures implementation | Statement | D | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 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 | |
| 1950 | K Integers | binary search data structures | Statement | C | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2300 | |
| 11446 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 3390 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 7075 | Irreducible Anagrams | binary search constructive algorithms data structures strings two pointers | Statement | B | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1900 |
| 1612 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 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 |
| 4622 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 30424 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 33919 | Pair of Topics | binary search data structures sortings two pointers | Statement | D | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 13285 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 11728 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 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 | |
| 10101 | Multiset | binary search data structures | Statement | D | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1900 | |
| 583 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 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 | |
| 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 | ||
| 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 |
| 680 | Chess Strikes Back (easy version) | binary search data structures | Statement | F1 | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2700 |
| 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 | |
| 1384 | Controversial Rounds | binary search data structures dp dsu two pointers | Statement | F | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 36156 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 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 | ||
| 1950 | Reverse and Swap | binary search bitmasks data structures divide and conquer | Statement | F | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 312 | The Potion of Great Power | *special binary search data structures graphs interactive sortings two pointers | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 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 | |
| 4666 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 16619 | k-Amazing Numbers | binary search data structures implementation two pointers | Statement | A | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 1500 |
| 2580 | Fruit Sequences | binary search data structures divide and conquer dp | Statement | F | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 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 | |
| 2646 | Complicated Computations | binary search data structures sortings two pointers | Statement | E | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 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 | |
| 4077 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 372 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 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 | ||
| 10169 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 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 | ||
| 232 | The Riddle of the Sphinx | binary search data structures data structures interactive | Statement | I | Good Bye 2020 {1466} | PROGRAMMING | 4000.0 | Good Bye 2020 Editorial | |
| 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 | ||
| 375 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 8836 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 10974 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 9679 | Max Median | binary search data structures dp two pointers | Statement | D | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 190 | Dogecoin | *special *special binary search data structures | Statement | F | 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 | ||
| 6161 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) 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 | |
| 382 | Subset Trick | binary search data structures | Statement | E | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2500.0 | Codeforces Round #707 Editorial | 3300 |
| 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 |
| 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 | |
| 421 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 5152 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 3332 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2884 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | 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 | ||
| 605 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 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 | |
| 34236 | Number of Pairs | binary search data structures math two pointers | Statement | C | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 12703 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1053 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 385 | Inverse Inversions | binary search brute force data structures | Statement | D | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 3000.0 | Tutorial | |
| 6913 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 11305 | Integers Have Friends | binary search data structures math number theory two pointers | Statement | B | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 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) | ||
| 3297 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 4515 | Boring Segments | binary search data structures sortings two pointers | Statement | E | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2100 | |
| 2240 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 65 | Physical Examination | *special binary search data structures | Statement | I | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 10406 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 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 |
| 1623 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 661 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 243 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 483 | The Cells on the Paper | binary search data structures implementation sortings | Statement | E | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 955 | Interesting Sections | binary search data structures divide and conquer geometry meet-in-the-middle | Statement | F | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3000.0 | Deltix Round, Autumn 2021. Editorial | 2800 |
| 7362 | ATM and Students | binary search data structures two pointers | Statement | F | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 947 | Divan and a Cottage | binary search data structures | Statement | E | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 2750.0 | Tutorial | 2600 |
| 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 | ||
| 1914 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 97 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 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 | |
| 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 | |
| 1736 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2837 | Anonymity Is Important | binary search data structures dsu sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 4457 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 480 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 6462 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 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 | |
| 39261 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 4107 | Count the Trains | binary search data structures sortings | Statement | G | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 2000 | |
| 7447 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 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 | |
| 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 |