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 |
|---|---|---|---|---|---|---|---|---|---|
| 204 | Long sequence | brute force math matrices | Statement | E | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2600 | |
| 403 | Fibonacci Number | brute force math matrices | Statement | E | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2900 | |
| 1078 | Prefix Sums | binary search brute force combinatorics math matrices | Statement | F | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2500 | |
| 713 | Matrix Rank (Easy Version) | brute force combinatorics dp math matrices | Statement | H1 | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 9709 | Beauty of the mountains | brute force data structures implementation math number theory | Statement | D | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1750.0 | 130839 |