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 |
|---|---|---|---|---|---|---|---|---|---|
| 2118 | Mike and Geometry Problem | combinatorics data structures dp geometry implementation | Statement | E | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2300 | |
| 11446 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 1897 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 1428 | Looking at Towers (difficult version) | combinatorics data structures dp implementation | Statement | E2 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial |