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 | |
| 6420 | Makes And The Product | combinatorics implementation math sortings | Statement | B | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1500 | |
| 5523 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 11337 | Close Tuples (hard version) | binary search combinatorics implementation math sortings two pointers | Statement | E2 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 17561 | Advertising Agency | combinatorics implementation math sortings | Statement | E | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 15373 | The Morning Star | combinatorics data structures geometry implementation math sortings | Statement | G | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial |