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 |
|---|---|---|---|---|---|---|---|---|---|
| 5933 | Ilya and Matrix | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1400 | |
| 617 | Colored Cubes | constructive algorithms implementation matrices | Statement | E | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2600 | |
| 7174 | Ramesses and Corner Inversion | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1500 |