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 |
|---|---|---|---|---|---|---|---|---|---|
| 1135 | Playlist | math probabilities sortings | Statement | E | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Problems Analysis | 2100 | |
| 728 | Wilbur and Trees | dp math probabilities sortings | Statement | D | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 2500 | |
| 2617 | Gosha is hunting | brute force data structures dp flows math probabilities sortings | Statement | E | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2900 | |
| 2805 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 1012 | Hidden Single (Version 1) | divide and conquer interactive math probabilities sortings | Statement | E1 | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) |