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 |
|---|---|---|---|---|---|---|---|---|---|
| 12715 | Pashmak and Parmida's problem | data structures divide and conquer sortings | Statement | D | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1800 | |
| 6217 | Imbalanced Array | data structures divide and conquer dsu sortings | Statement | D | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2000 | |
| 2683 | Tokitsukaze and Strange Rectangle | data structures divide and conquer sortings two pointers | Statement | D | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2200 | |
| 4810 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 | |
| 2628 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 10169 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 1696 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 2335 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 13193 | Maximum Crossings (Hard Version) | data structures divide and conquer sortings | Statement | H2 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 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) | |
| 2731 | Permutation Sorting | data structures divide and conquer sortings | Statement | E | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 21907 | Greetings | data structures divide and conquer sortings | Statement | F | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 4555 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 43 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 237 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 203 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 597 | Another Folding Strip | combinatorics data structures divide and conquer dp math sortings | Statement | E | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 5331 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial |