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 |
|---|---|---|---|---|---|---|---|---|---|
| 2212 | PLEASE | combinatorics dp implementation math matrices | Statement | C | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2200 | |
| 1793 | Intersection and Union | combinatorics data structures dp math matrices | Statement | F | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2300 | |
| 713 | Matrix Rank (Easy Version) | brute force combinatorics dp math matrices | Statement | H1 | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 628 | Matrix Rank (Hard Version) | combinatorics dp math matrices | Statement | H2 | Good Bye 2023 {1916} | PROGRAMMING | 1750.0 |