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 |
|---|---|---|---|---|---|---|---|---|---|
| 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 | |
| 2643 | The Number of Subpermutations | brute force data structures divide and conquer hashing math | Statement | F | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2600 | |
| 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 | |
| 1103 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 10329 | Monoblock | brute force combinatorics data structures divide and conquer greedy implementation | Statement | C | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 747 | Field Should Not Be Empty | brute force data structures divide and conquer | Statement | F | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 2277 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 895 | Eliminating Balls With Merging (Hard Version) | binary search brute force data structures divide and conquer implementation | Statement | E2 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 1307 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 3627 | Unique Median | brute force data structures divide and conquer | Statement | D | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2000.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 2635 | Buratsuta 3 | binary search brute force data structures divide and conquer probabilities | Statement | G | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose |