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 4Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1637 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 18108 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 10653 | Rank Subsequence | brute force greedy implementation | Statement | A | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 3622 | Hypercarp and Interdimensional Jumps | binary search brute force geometry greedy implementation math | Statement | D | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 2197 | Busy Beaver | brute force divide and conquer dp greedy implementation sortings | Statement | E | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2250.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 1734 | MEX Replacement | binary search brute force greedy implementation math sortings | Statement | F | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial |