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 |
|---|---|---|---|---|---|---|---|---|---|
| 15973 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3048 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 13965 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 |