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 |
|---|---|---|---|---|---|---|---|---|---|
| 2430 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1800 | |
| 7484 | Pasha and Tea | constructive algorithms implementation math sortings | Statement | B | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1500 | |
| 8308 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 10616 | Nezzar and Symmetric Array | constructive algorithms implementation math sortings | Statement | C | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1500.0 | Tutorial | 1700 |
| 9828 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |