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 |
|---|---|---|---|---|---|---|---|---|---|
| 1497 | Two Arrays | bitmasks brute force combinatorics hashing probabilities two pointers | Statement | D | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1750.0 | Codeforces Round #773 editorial | |
| 8350 | Problem with Random Tests | brute force hashing probabilities | Statement | D | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1700 |