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 |
|---|---|---|---|---|---|---|---|---|---|
| 5229 | Two Sets | 2-sat dfs and similar dsu graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 |