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 |
|---|---|---|---|---|---|---|---|---|---|
| 558 | Help Shrek and Donkey | dp games math probabilities | Statement | E | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 2500 | |
| 8845 | Bag of mice | dp games math probabilities | Statement | D | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 1900 | |
| 589 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 |