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 |
|---|---|---|---|---|---|---|---|---|---|
| 335 | Inquisition | geometry implementation sortings | Statement | C | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 1354 | Mice problem | geometry implementation math sortings | Statement | C | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2200 | |
| 2001 | Rooter's Song | constructive algorithms data structures geometry implementation sortings two pointers | Statement | B | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2100 | |
| 5034 | Rectangles | geometry implementation sortings | Statement | C | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1600 | |
| 2628 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 4666 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- 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 |