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 |
|---|---|---|---|---|---|---|---|---|---|
| 8362 | Seating Arrangements (hard version) | data structures greedy implementation sortings two pointers | Statement | D2 | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 20527 | Longest Strike | data structures greedy implementation sortings two pointers | Statement | F | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 5826 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 5864 | New Year's Gifts | data structures greedy implementation sortings two pointers | Statement | E | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1431 | Minimum Influence | binary search data structures geometry greedy implementation math sortings two pointers | Statement | E | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial |