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 |
|---|---|---|---|---|---|---|---|---|---|
| 15528 | Modified GCD | binary search number theory | Statement | C | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2), my solutions | 1600 | |
| 371 | Archer's Shot | binary search geometry math two pointers | Statement | D | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2400 | |
| 1890 | Doctor | binary search math sortings | Statement | B | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 1900 | ||
| 353 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 1596 | Hot Bath | binary search brute force math | Statement | A | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1900 | |
| 13783 | Another Problem on Strings | binary search brute force dp math strings two pointers | Statement | C | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1600 | |
| 11550 | Funky Numbers | binary search brute force implementation | Statement | A | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | tutorial | 1300 | |
| 10118 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1100 | |
| 95160 | T-primes | binary search implementation math number theory | Statement | B | Codeforces Round 142 (Div. 2) {230} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1300 | |
| 8265 | Non-square Equation | binary search brute force math | Statement | B | Codeforces Round 144 (Div. 2) {233} | PROGRAMMING | Editorial for Codeforces Round #144 | 1500 | |
| 980 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 2173 | Mr. Bender and Square | binary search implementation math | Statement | D | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1900 | |
| 1951 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 15353 | Prime Matrix | binary search brute force math number theory | Statement | B | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1400 | |
| 11493 | Pipeline | binary search math | Statement | B | Codeforces Round 176 (Div. 2) {287} | PROGRAMMING | Разбор задач | 1700 | |
| 1102 | Empire Strikes Back | binary search math number theory | Statement | E | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2400 | |
| 529 | Morning run | binary search math two pointers | Statement | A | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2000 | |
| 3893 | Ciel and Robot | binary search implementation math | Statement | A | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 1700 | |
| 1672 | Stadium and Games | binary search math | Statement | B | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1800 | |
| 5222 | Quiz | binary search greedy math matrices number theory | Statement | C | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1700 | |
| 14638 | Mafia | binary search math sortings | Statement | A | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 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 | |
| 2784 | Making Sequences is Fun | binary search implementation math | Statement | B | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1600 | |
| 1504 | Number Busters | binary search math | Statement | B | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2000 | |
| 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 | |
| 2523 | Fly, freebies, fly! | binary search brute force implementation | Statement | B | Testing Round 9 {386} | PROGRAMMING | 1500 | ||
| 6683 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 2871 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 2736 | Hack it! | binary search constructive algorithms math | Statement | C | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2800 | |
| 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 | |
| 4310 | Friends and Presents | binary search math | Statement | B | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1800 | |
| 7709 | Maximum Value | binary search math sortings two pointers | Statement | B | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2100 | |
| 89767 | Vanya and Lanterns | binary search implementation math sortings | Statement | B | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1200 | |
| 3317 | Vanya and Computer Game | binary search implementation math sortings | Statement | D | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1800 | |
| 4157 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 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 | |
| 2090 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 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 | |
| 930 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 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 | |
| 2024 | Chip 'n Dale Rescue Rangers | binary search geometry math | Statement | B | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2100 | |
| 558 | Max and Bike | binary search geometry | Statement | B | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 2400 | |
| 3091 | Pasha and Phone | binary search math | Statement | B | Codeforces Round 330 (Div. 2) {595} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 1600 | |
| 1060 | Hexagons | binary search implementation math | Statement | E | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 2200 | |
| 1582 | Simple Skewness | binary search math ternary search | Statement | E | 8VC Venture Cup 2016 - Elimination Round {626} | PROGRAMMING | 23522 | 2400 | |
| 646 | Optimal Point | binary search math | Statement | C | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2800 | |
| 6161 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1700 | |
| 3346 | As Fast As Possible | binary search math | Statement | A | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 1900 | |
| 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 | |
| 6984 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 92149 | New Year and Hurry | binary search brute force implementation math | Statement | A | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 800 | |
| 4050 | Unfair Poll | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1700 | |
| 4987 | Voltage Keepsake | binary search math | Statement | A | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 1800 | |
| 4781 | Success Rate | binary search math | Statement | A | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 1700 | |
| 994 | Prairie Partition | binary search constructive algorithms greedy math | Statement | C | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2300 | |
| 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 | |
| 7806 | Anton and Fairy Tale | binary search math | Statement | C | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 1600 | |
| 8446 | Really Big Numbers | binary search brute force dp math | Statement | C | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1600 | |
| 1924 | Level Generation | binary search math ternary search | Statement | F | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2200 | |
| 479 | Strange Radiation | binary search implementation math | Statement | C | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 2500 | |
| 2057 | Vasya's Function | binary search implementation math | Statement | E | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2200 | |
| 1078 | Prefix Sums | binary search brute force combinatorics math matrices | Statement | F | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2500 | |
| 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 | |
| 667 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 3808 | XK Segments | binary search math sortings two pointers | Statement | B | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 1700 | |
| 2037 | Prime Gift | binary search dfs and similar math meet-in-the-middle number theory two pointers | Statement | E | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2600 | |
| 1980 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 4635 | Save Energy! | binary search implementation math | Statement | A | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 1700 | |
| 2886 | Sad powers | binary search math number theory | Statement | C | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2100 | |
| 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 |
| 2743 | Sand Fortress | binary search constructive algorithms math | Statement | D | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2100 | |
| 536 | A Shade of Moonlight | binary search geometry math sortings two pointers | Statement | D | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2500 | |
| 9889 | World Cup | binary search math | Statement | B | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1300 | |
| 8991 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 2749 | Multicolored Markers | binary search brute force math number theory | Statement | F | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 703 | Write The Contest | binary search dp math | Statement | F | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2400 | |
| 13390 | Meme Problem | binary search math | Statement | C | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1300 | |
| 2814 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 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 | |
| 11472 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 10858 | NN and the Optical Illusion | binary search geometry math | Statement | C | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 6878 | Creative Snap | binary search brute force divide and conquer math | Statement | C | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1700 | |
| 5521 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 8308 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 193 | Strange device | binary search interactive math trees | Statement | E | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3300 | |
| 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 | |
| 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 | |
| 15024 | Computer Game | binary search math | Statement | C | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 21868 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 32761 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 540 | You Are Given Some Letters... | binary search implementation math | Statement | F | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2800 | |
| 252 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 3718 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 1648 | Numerical Sequence (hard version) | binary search math | Statement | E2 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 15814 | Creating a Character | binary search math | Statement | A | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1300 | |
| 24601 | Perfect Team | binary search math | Statement | C | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1200 | |
| 276 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 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 | ||
| 16679 | Obtain Two Zeroes | binary search math | Statement | B | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1200 | |
| 14650 | Everyone is a Winner! | binary search math meet-in-the-middle number theory | Statement | C | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 3706 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 19311 | Deadline | binary search brute force math ternary search | Statement | A | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 | |
| 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 |
| 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 |
| 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 | |
| 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 |
| 1289 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 28217 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 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 |
| 69363 | K-th Not Divisible by n | binary search math | Statement | C | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 16354 | Simple Polygon Embedding | binary search geometry math ternary search | Statement | C1 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1400 | |
| 6368 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 11912 | Count Triangles | binary search implementation math two pointers | Statement | C | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 1250.0 | Codeforces Round #643 (Div. 2) Editorial | 1800 |
| 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 |
| 15255 | Mixing Water | binary search math | Statement | C | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1700 | |
| 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 | |
| 4405 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 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 | ||
| 2510 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 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 | ||
| 13175 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 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 |
| 349 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 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 | |
| 15449 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 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 | ||
| 11678 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 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 | |
| 9264 | Discrete Acceleration | binary search implementation math two pointers | Statement | C | Grakn Forces 2020 {1408} | PROGRAMMING | 1250.0 | Grakn Forces -- Editorial | |
| 2174 | Solo mid Oracle | binary search math ternary search | Statement | E | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2250.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 2183 | Expected Damage | binary search combinatorics math probabilities | Statement | E | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 5433 | Lonely Numbers | binary search math number theory | Statement | K | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 20523 | Increase and Copy | binary search constructive algorithms math | Statement | C | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1100 | |
| 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 | |
| 15460 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 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 | |
| 11337 | Close Tuples (hard version) | binary search combinatorics implementation math sortings two pointers | Statement | E2 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 15198 | Close Tuples (easy version) | binary search combinatorics math sortings two pointers | Statement | E1 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 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 | |
| 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 | ||
| 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 |
| 20504 | Pythagorean Triples | binary search math number theory | Statement | D | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 477 | Two Policemen | *special binary search brute force math | Statement | C | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 38691 | Sum of Cubes | binary search brute force brute force math | Statement | C | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 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 | ||
| 2306 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 4414 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 6802 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) 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 | |
| 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 | ||
| 22146 | Interesting Function | binary search dp math | Statement | F | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) 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 | ||
| 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 | |
| 458 | Guess the Perimeter | binary search interactive number theory | Statement | H | Codeforces Global Round 15 {1552} | PROGRAMMING | 2750.0 | Editorial of Global Round 15 | |
| 1209 | Common Divisor Graph | binary search dsu graphs math number theory | Statement | G | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 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) | |
| 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 | ||
| 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 | |
| 3983 | Guess the Permutation | binary search combinatorics interactive math | Statement | D | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2000 |
| 2551 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 | |
| 275 | Two Sorts | binary search math | Statement | F | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 3000.0 | 95865 | 3400 |
| 1181 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 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 | |
| 31856 | Team Composition: Programmers and Mathematicians | binary search constructive algorithms math | Statement | B | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 25628 | Chat Ban | binary search math | Statement | C | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 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 | ||
| 19038 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 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 | |
| 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 | ||
| 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 | ||
| 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 | |
| 5282 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 11426 | Maximum Product Strikes Back | binary search implementation math | Statement | D | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 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 | ||
| 5599 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 25213 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 7281 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 731 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 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 | |
| 12020 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.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 | ||
| 2457 | LCM Sum (easy version) | binary search brute force combinatorics math number theory two pointers | Statement | E1 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 232 | Deducing Sortability | binary search bitmasks math | Statement | D | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1920 | Circular Mirror | binary search combinatorics math two pointers | Statement | C | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 6681 | Garage | binary search math | Statement | G | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 2025 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 17163 | Meeting on the Line | binary search greedy implementation math ternary search | Statement | B | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1000.0 | Codeforces Round #823 — editorial | 1600 |
| 10163 | Ela's Fitness and the Luxury Number | binary search implementation math | Statement | B | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1000.0 | Editorial of Dytechlab Cup 2022 | |
| 2888 | Multi-Colored Segments | binary search data structures math sortings | Statement | F | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 38271 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 1688 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 1655 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 8457 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 5478 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4493 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 697 | Doremy's Perfect DS Class (Easy Version) | binary search interactive | Statement | G1 | Codeforces Global Round 24 {1764} | PROGRAMMING | 2000.0 | Codeforces Global Round 24 Editorial | |
| 636 | Doremy's Perfect DS Class (Medium Version) | binary search interactive | Statement | G2 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 558 | Doremy's Perfect DS Class (Hard Version) | binary search interactive | Statement | G3 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 1519 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 1599 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 14097 | Interesting Sequence | binary search bitmasks math | Statement | C | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 11440 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 5814 | Bit Guessing Game | binary search bitmasks interactive | Statement | D | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1500.0 | 111841 | |
| 14732 | Going to the Cinema | binary search math sortings two pointers | Statement | B | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1000.0 | Tutorial | |
| 4635 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 16705 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 8009 | Fixed Prefix Permutations | binary search data structures math sortings strings | Statement | D | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 21919 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 2375 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12143 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 14148 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 16582 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 1066 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22309 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 8516 | Climbing the Tree | binary search math | Statement | D | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1250.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2117 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14374 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 5525 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 4300 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 3372 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2332 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 2761 | MEX of LCM | binary search brute force data structures implementation math number theory two pointers | Statement | E | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 2500.0 | Codeforces Round #879 Editorial | |
| 1071 | Lottery | binary search brute force greedy math sortings two pointers | Statement | B | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1250.0 | Codeforces Round 880 Editorial | |
| 25022 | Rudolf and Snowflakes (simple version) | binary search brute force implementation math | Statement | E1 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 8480 | Rudolf and Snowflakes (hard version) | binary search brute force implementation math | Statement | E2 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 1026 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 2028 | Vika and Wiki | binary search bitmasks combinatorics math | Statement | F | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2750.0 | Codeforces Round #885 (Div.2) Editorial | |
| 2973 | Vika and Bonuses | binary search brute force math ternary search | Statement | D | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 24201 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 2174 | Max to the Right of Min | binary search data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 34755 | Cardboard for Pictures | binary search geometry implementation math | Statement | E | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 9207 | Ntarsis' Set | binary search implementation math two pointers | Statement | A | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 19686 | Fibonaccharsis | binary search brute force math | Statement | B | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 1000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 18834 | Fancy Coins | binary search brute force greedy math | Statement | B | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 19775 | Ice Cream Balls | binary search combinatorics constructive algorithms math | Statement | D | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 13084 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial |