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 |
|---|---|---|---|---|---|---|---|---|---|
| 3181 | Arithmetic Progression | binary search interactive number theory probabilities | Statement | E | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2100 | |
| 1864 | Deleting Numbers | binary search brute force interactive number theory | Statement | E | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2750.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 458 | Guess the Perimeter | binary search interactive number theory | Statement | H | Codeforces Global Round 15 {1552} | PROGRAMMING | 2750.0 | Editorial of Global Round 15 | |
| 2551 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 |