Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1027 | Hitchhiking in the Baltic States | data structures dp | Statement | D | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 2800 | |
| 976 | Vladik and Entertaining Flags | data structures dsu graphs | Statement | E | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | Editorial | 2600 | |
| 3048 | Army Creation | binary search data structures | Statement | E | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2300 | |
| 1696 | Bipartite Checking | data structures dsu graphs | Statement | F | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2600 | |
| 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 | |
| 6217 | Imbalanced Array | data structures divide and conquer dsu sortings | Statement | D | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2000 | |
| 3695 | Choosing The Commander | bitmasks data structures trees | Statement | E | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2100 | |
| 3340 | MEX Queries | binary search data structures trees | Statement | F | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2400 | |
| 3778 | Multicolored Cars | data structures implementation | Statement | D | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 1700 | |
| 2673 | Card Game Again | binary search data structures number theory two pointers | Statement | E | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2000 | |
| 1791 | Mister B and PR Shifts | data structures implementation math | Statement | B | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 2100 | |
| 7905 | Okabe and Boxes | data structures greedy trees | Statement | C | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1600 | |
| 4281 | Minimal Labels | data structures dfs and similar graphs greedy | Statement | E | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2400 | |
| 4320 | String Reconstruction | data structures greedy sortings strings | Statement | A | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 1700 | |
| 1783 | DNA Evolution | data structures strings | Statement | C | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2200 | |
| 1368 | Best Edge Weight | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2700 | |
| 565 | Dirty Arkady's Kitchen | data structures dp graphs shortest paths | Statement | F | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 3100 | |
| 3048 | Cards Sorting | data structures implementation sortings | Statement | B | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 1800 | |
| 1306 | Bamboo Partition | brute force data structures implementation math number theory sortings two pointers | Statement | C | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 2500 | |
| 6456 | The Bakery | binary search data structures divide and conquer dp two pointers | Statement | B | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2200 | |
| 482 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2800 | |
| 275 | Caramel Clouds | data structures dp sortings | Statement | E | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 3100 | |
| 9363 | The Festive Evening | data structures implementation | Statement | B | Codeforces Round 426 (Div. 2) {834} | PROGRAMMING | Codeforces Round #426 Editorial | 1100 | |
| 893 | Functions On The Segments | data structures | Statement | G | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2600 | |
| 1066 | Diverging Directions | data structures dfs and similar trees | Statement | B | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2100 | |
| 2803 | Leha and another game about graph | constructive algorithms data structures dfs and similar dp graphs | Statement | B | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2100 | |
| 3936 | Destiny | data structures probabilities | Statement | D | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2400 | |
| 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 | |
| 13623 | Two TVs | data structures greedy sortings | Statement | C | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1500 | |
| 2574 | Driving Test | data structures dp greedy | Statement | D | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1800 | |
| 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 | |
| 2966 | Four Segments | brute force data structures dp | Statement | C | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 2641 | Random Query | data structures math probabilities two pointers | Statement | F | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2000 | |
| 3862 | Union of Doubly Linked Lists | implementation | Statement | A | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1500 | ||
| 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 | ||
| 1383 | Dog Show | data structures greedy | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2300 | ||
| 2001 | Rooter's Song | constructive algorithms data structures geometry implementation sortings two pointers | Statement | B | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2100 | |
| 1574 | Goodbye Souvenir | data structures divide and conquer | Statement | C | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2800 | |
| 1582 | Boredom | data structures | Statement | C | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 2200 | |
| 81 | Lada Malina | data structures geometry | Statement | E | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 3400 | |
| 9929 | Marvolo Gaunt's Ring | brute force data structures dp | Statement | B | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 1500 | |
| 576 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 4174 | Polycarp's phone book | data structures implementation sortings | Statement | D | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1700 | |
| 504 | Arkady and a Nobody-men | data structures dfs and similar trees | Statement | E | Codeforces Round 434 (Div. 1, based on Technocup 2018 Elimination Round 1) {860} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2600 | |
| 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 | |
| 250 | Mahmoud and Ehab and the final stage | data structures strings | Statement | F | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2800 | |
| 3795 | Yet Another Array Queries Problem | data structures implementation | Statement | D | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 1800 | |
| 4046 | Turn Off The TV | data structures sortings | Statement | E | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 2000 | |
| 7951 | Buy Low Sell High | constructive algorithms data structures greedy | Statement | D | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2300 | |
| 2053 | The Untended Antiquity | data structures hashing | Statement | E | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2300 | |
| 679 | Paths | data structures number theory | Statement | F | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2600 | |
| 788 | Awards For Contestants | brute force data structures dp | Statement | E | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2500 | |
| 2483 | High Cry | binary search bitmasks combinatorics data structures divide and conquer | Statement | D | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2200 | |
| 1005 | Delivery Club | binary search data structures dp | Statement | E | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2600 | |
| 5061 | Olya and Energy Drinks | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1900 | |
| 5456 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2000 | |
| 2320 | Ann and Books | data structures flows hashing | Statement | F | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2500 | |
| 1116 | Teams Formation | data structures implementation | Statement | B | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2400 | |
| 1024 | Tournament | data structures graphs | Statement | C | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2800 | |
| 14300 | Table Tennis | data structures implementation | Statement | B | Codeforces Round 443 (Div. 2) {879} | PROGRAMMING | Codeforces Round #443. Editorial | 1300 | |
| 259 | Berland.Taxi | data structures | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 2218 | Boxes And Balls | data structures greedy | Statement | D | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2300 | |
| 547 | Ratings and Reality Shows | data structures two pointers | Statement | D | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2500 | |
| 5818 | Xor-MST | bitmasks constructive algorithms data structures | Statement | G | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2300 | |
| 2976 | Envy | data structures dsu graphs | Statement | C | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2500 | |
| 3326 | Credit Card | data structures dp greedy implementation | Statement | D | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1800 | |
| 2488 | Subtree Minimum Query | data structures trees | Statement | F | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2300 | |
| 1203 | Ralph And His Tour in Binary Country | brute force data structures trees | Statement | D | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2300 | |
| 1264 | Eyes Closed | data structures probabilities | Statement | E | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2500 | |
| 4391 | Willem, Chtholly and Seniorious | data structures probabilities | Statement | C | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2700 | |
| 2500 | Welcome home, Chtholly | data structures dsu | Statement | E | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 3100 | |
| 3512 | Segments Removal | data structures dsu flows implementation two pointers | Statement | E | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 2100 | |
| 2026 | Letters Removing | data structures strings | Statement | F | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 2200 | |
| 4997 | Remove Extra One | brute force data structures math | Statement | C | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 1700 | |
| 1388 | Maximum Questions | data structures dp strings | Statement | E | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2300 | |
| 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 | |
| 4461 | Almost Difference | data structures math | Statement | D | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2200 | |
| 681 | Yet Another Maxflow Problem | data structures flows graphs | Statement | G | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2700 | |
| 2099 | Colorful Points | data structures greedy implementation | Statement | D | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 2847 | Stack Sorting | constructive algorithms data structures greedy implementation | Statement | E | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | 2000 | ||
| 3765 | Mass Change Queries | data structures | Statement | G | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2600 | |
| 2138 | Fishes | data structures graphs greedy probabilities shortest paths | Statement | D | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2100 | |
| 5125 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 6322 | Bash and a Tough Math Puzzle | data structures number theory | Statement | D | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1900 | |
| 1904 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2400 | |
| 2121 | Substrings in a String | bitmasks brute force data structures string suffix structures strings | Statement | F | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 5527 | Physical Education Lessons | data structures implementation sortings | Statement | E | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2300 | |
| 3035 | Imbalance Value of a Tree | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 562 | Jamie and To-do List | data structures interactive trees | Statement | D | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 2086 | Jamie and Tree | data structures trees | Statement | E | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 185 | Upside Down | data structures string suffix structures strings trees | Statement | E | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 3000 | |
| 8525 | SUM and REPLACE | brute force data structures dsu number theory | Statement | F | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2000 | |
| 7681 | Connected Components? | data structures dfs and similar dsu graphs | Statement | E | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2100 | |
| 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 | |
| 4709 | Perfect Security | data structures greedy strings trees | Statement | C | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1900 | |
| 4215 | Riverside Curio | data structures dp greedy | Statement | C | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1800 | |
| 540 | May Holidays | data structures trees | Statement | E | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2900 | |
| 563 | Segments | data structures | Statement | J | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2500 | |
| 2369 | Teodor is not a liar! | data structures dp | Statement | C | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2100 | |
| 444 | Game with Tokens | data structures games implementation | Statement | D | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2600 | |
| 511 | Coins Exhibition | data structures dp math | Statement | E | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2700 | |
| 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 | |
| 4087 | Escape Through Leaf | data structures dp geometry | Statement | F | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2700 | |
| 431 | Fafa and Array | data structures greedy | Statement | F | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2800 | |
| 252 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 6896 | Buy a Ticket | data structures graphs shortest paths | Statement | D | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2000 | |
| 1082 | Shortest Path Queries | bitmasks data structures dsu graphs | Statement | G | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2900 | |
| 1188 | Cutlet | data structures dp | Statement | F | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 2700 | |
| 4380 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 3355 | Machine Learning | brute force data structures | Statement | F | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2600 | |
| 789 | Almost Increasing Array | data structures dp | Statement | G | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2600 | |
| 2394 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 744 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2400 | |
| 715 | Encryption (hard) | data structures dp | Statement | C3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 12283 | Minimize the error | data structures greedy sortings | Statement | B | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1500 | |
| 3376 | Pathwalks | data structures dp graphs | Statement | F | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2000 | |
| 347 | Santa's Gift | data structures trees | Statement | H | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 3000 | |
| 26206 | Lecture Sleep | data structures dp implementation two pointers | Statement | B | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1300 | |
| 4222 | Tufurama | data structures | Statement | E | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1900 | |
| 7353 | Merge Equals | data structures implementation | Statement | D | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1600 | |
| 207 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 1872 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 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 |
| 2113 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 2521 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 759 | Magic multisets | data structures | Statement | G | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2400 | |
| 288 | K Paths | combinatorics data structures dp fft math | Statement | H | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2900 | |
| 8936 | Bus of Characters | data structures greedy implementation | Statement | B | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1300 | |
| 2510 | Shark | brute force data structures dsu trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 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 | |
| 512 | Arkady and Rectangles | data structures | Statement | D | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 3300 | |
| 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 | |
| 893 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 1673 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2600 | |
| 2049 | Leaving the Bar | brute force data structures geometry greedy math sortings | Statement | C | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2200 | |
| 1658 | Good Subsegments | data structures | Statement | E | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 3000 | |
| 4879 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 8355 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 4813 | One Occurrence | data structures divide and conquer | Statement | F | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2400 | |
| 711 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 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 | |
| 927 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 25179 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 13039 | Reorder the Array | combinatorics data structures math sortings two pointers | Statement | A | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1300 | |
| 321 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 7683 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 386 | Store | data structures | Statement | E | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2700 | |
| 3945 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 1204 | The Tree | data structures | Statement | G | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3200 | |
| 406 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 4277 | Array Restoration | constructive algorithms data structures | Statement | D | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1700 | |
| 188 | Pisces | data structures flows trees | Statement | G | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 3300 | |
| 1821 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 904 | Putting Boxes Together | data structures | Statement | F | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2600 | |
| 585 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 1268 | Maximum Reduction | combinatorics data structures math | Statement | F | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2400 | |
| 1206 | Security | data structures string suffix structures | Statement | H | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 851 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 2296 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 318 | Summer Oenothera Exhibition | data structures | Statement | E | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 3400 | |
| 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 | |
| 3850 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 1614 | Ray in the tube | data structures divide and conquer dp math | Statement | F | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 2400 | |
| 7235 | Petya and Array | data structures divide and conquer two pointers | Statement | D | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1800 | |
| 1466 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 320 | Speckled Band | data structures divide and conquer hashing string suffix structures strings | Statement | G | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 3500 | |
| 678 | DFS | data structures | Statement | F | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 1183 | Deduction Queries | data structures dsu | Statement | D | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 1982 | AI robots | data structures | Statement | G | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2200 | |
| 574 | Last chance | data structures flows graph matchings trees | Statement | A | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 210 | Moonwalk challenge | data structures strings trees | Statement | J | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 3000 | |
| 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 | |
| 480 | Distinctification | data structures dsu greedy | Statement | G | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2700 | |
| 2791 | Check Transcription | brute force data structures hashing strings | Statement | E | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2100 | |
| 299 | Take Metro | brute force data structures graphs | Statement | G | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2800 | |
| 253 | Detect Robots | data structures strings | Statement | H | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 3100 | |
| 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 | |
| 259 | Balls and Pockets | data structures | Statement | G | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 3300 | |
| 10690 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 2558 | TV Shows | data structures greedy implementation sortings | Statement | D | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2000 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 1009 | String Journey | data structures dp string suffix structures | Statement | F | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 6556 | Binary Numbers AND Sum | data structures implementation math | Statement | E | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 2281 | Cloud Computing | data structures greedy | Statement | C | 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 | 2000 | |
| 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 | |
| 678 | Berkomnadzor | data structures greedy | Statement | B | 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 | 2500 | |
| 6715 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 1108 | Yet Another LCP Problem | data structures string suffix structures | Statement | G | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2700 | |
| 4138 | Vasya and a Tree | data structures trees | Statement | E | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1900 | |
| 720 | Array Game | data structures games | Statement | G | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2700 | |
| 4148 | Pictures with Kittens (hard version) | data structures dp | Statement | F2 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2300 | |
| 913 | Katya and Segments Sets | data structures interactive sortings | Statement | F | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2700 | |
| 130 | Palindromic Magic | data structures hashing strings | Statement | H | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3500 | |
| 6239 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 5572 | The Fair Nut and Rectangles | data structures dp geometry | Statement | E | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2400 | |
| 1110 | Max Mex | data structures trees | Statement | C | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2800 | |
| 315 | The Fair Nut and Amusing Xor | data structures | Statement | F | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3100 | |
| 355 | The Fair Nut's getting crazy | data structures implementation | Statement | D | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3400 | |
| 708 | Beautiful Matrix | combinatorics data structures dp | Statement | G | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2600 | |
| 592 | Ehab and a weird weight formula | data structures trees | Statement | F | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 3000 | |
| 1242 | King Kog's Reception | data structures | Statement | K | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2400 | |
| 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 | |
| 3368 | Great Vova Wall (Version 2) | data structures implementation | Statement | D2 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2200 | |
| 2214 | Multidimensional Queries | bitmasks data structures | Statement | G | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2200 | |
| 1849 | Intersection of Permutations | data structures | Statement | E | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2300 | |
| 879 | Eels | data structures | Statement | D | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2700 | |
| 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 | |
| 11740 | Build a Contest | data structures implementation | Statement | B | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 3657 | Ivan and Burgers | data structures divide and conquer greedy math | Statement | F | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2600 | |
| 5406 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 16768 | Game with string | data structures implementation math | Statement | B | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 1300 | |
| 19527 | Lunar New Year and a Wander | data structures dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 6992 | Lunar New Year and Food Ordering | data structures implementation | Statement | B | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 2813 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 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 | |
| 2509 | Array and Segments (Hard version) | data structures implementation | Statement | E2 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 598 | Sasha and a Very Easy Test | data structures number theory | Statement | E | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2700 | |
| 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 | |
| 364 | Sasha and Algorithm of Silence's Sounds | data structures trees | Statement | F | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 3200 | |
| 2038 | Nearest Leaf | data structures trees | Statement | F | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2600 | |
| 1091 | Tree | data structures dfs and similar dp graphs trees | Statement | E | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2800 | |
| 2419 | Please, another Queries on Array? | bitmasks data structures divide and conquer math number theory | Statement | F | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2500 | |
| 911 | Recursive Queries | data structures | Statement | G | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2500 | |
| 875 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 328 | Secret Letters | data structures dp greedy | Statement | F | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2900 | |
| 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 | |
| 1301 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 539 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 1226 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 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 | |
| 598 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 523 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 509 | Dish Shopping | data structures divide and conquer | Statement | F | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2800 | |
| 10383 | Playlist | brute force data structures sortings | Statement | C | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1600 | |
| 1545 | Extending Set of Points | data structures divide and conquer dsu | Statement | F | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2700 | |
| 610 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 4570 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 3718 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 1015 | Hot is Cold | bitmasks data structures divide and conquer implementation | Statement | E | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 320 | Holy Diver | data structures | Statement | H | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 3600 | |
| 1667 | Tree Generator™ | data structures implementation trees | Statement | C | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 3762 | Number of Components | combinatorics data structures dp math | Statement | E | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2100 | |
| 6932 | Two Teams | data structures implementation sortings | Statement | E | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1800 | |
| 7702 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
| 4003 | Special Segments of Permutation | data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2400 |