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 |
|---|---|---|---|---|---|---|---|---|---|
| 18475 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 5869 | Unusual Matrix | 2-sat constructive algorithms greedy | Statement | F | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 1255 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |