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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 998 | Superset | constructive algorithms divide and conquer | Statement | B | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Yandex.Algorithm final: Problem D tutorial | 2300 | |
| 1039 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 309 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 1574 | Practice | constructive algorithms divide and conquer implementation | Statement | G | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1800 | ||
| 9337 | Ciel the Commander | constructive algorithms dfs and similar divide and conquer greedy trees | Statement | C | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2500 | |
| 567 | Fox And Polygon | constructive algorithms divide and conquer | Statement | E | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2800 | ||
| 4152 | Points on Plane | constructive algorithms divide and conquer geometry greedy sortings | Statement | C | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 6950 | Code For 1 | constructive algorithms dfs and similar divide and conquer | Statement | B | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 1600 | |
| 511 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | 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 | 2700 | |
| 409 | Finding lines | constructive algorithms divide and conquer interactive | Statement | D | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2900 | |
| 4015 | Merge Sort | constructive algorithms divide and conquer | Statement | D | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1800 | |
| 89 | Algoland and Berland | constructive algorithms divide and conquer geometry | Statement | M | 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 | 3100 | |
| 1956 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 4532 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 391 | SmartGarden | constructive algorithms divide and conquer | Statement | M | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2700 | ||
| 2041 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 3436 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 493 | Set Merging | constructive algorithms data structures divide and conquer | Statement | H | Codeforces Global Round 9 {1375} | PROGRAMMING | 2750.0 | 79731 | |
| 472 | Inverse Genealogy | constructive algorithms divide and conquer dp math trees | Statement | E | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 2500.0 | Codeforces Round #657 Editorial | 2400 |
| 2675 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 2814 | Dogeforces | brute force constructive algorithms divide and conquer dsu greedy implementation trees | Statement | D | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 215 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 1528 | Defender of Childhood Dreams | bitmasks constructive algorithms divide and conquer | Statement | F | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2750.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 954 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 275 | Hard Cut | constructive algorithms divide and conquer math | Statement | H | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 3250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 3400 |
| 7447 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 2397 | Merge Not Sort | constructive algorithms dp | Statement | E | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 4753 | Nene and the Mex Operator | bitmasks brute force constructive algorithms divide and conquer dp greedy implementation | Statement | D | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 11001 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 128 | Colorful Polygon | constructive algorithms divide and conquer geometry | Statement | F | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 3250.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 4004 | Max Sum OR (Hard Version) | bitmasks constructive algorithms divide and conquer greedy | Statement | D2 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 10346 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 402 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 1275 | Git Gud | constructive algorithms data structures divide and conquer | Statement | F | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 2251 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 49 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 37 | Bowser's Castle (Medium Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 53 | Bowser's Castle (Hard Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H3 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 2563 | Unique Values (Hard version) | binary search constructive algorithms divide and conquer interactive math | Statement | B2 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 |