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 |
|---|---|---|---|---|---|---|---|---|---|
| 4270 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 10073 | Secret Santa | constructive algorithms flows graphs math probabilities | Statement | D | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1500.0 | Codeforces Round #733 Editorial (all problems) | |
| 678 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 270 | Penguin Steps | binary search dfs and similar flows graphs shortest paths | Statement | F | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 3000.0 | Codeforces Round 1025 (Div. 2) Editorial |