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 |
|---|---|---|---|---|---|---|---|---|---|
| 81 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 3300 | |
| 9126 | Maximum Subsequence | bitmasks divide and conquer meet-in-the-middle | Statement | E | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1800 | |
| 1895 | Number of k-good subarrays | bitmasks combinatorics divide and conquer dp math meet-in-the-middle | Statement | E | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 2500.0 | 130839 |