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 |
|---|---|---|---|---|---|---|---|---|---|
| 1645 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 751 | ALT | data structures flows graphs trees | Statement | E | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3200 | |
| 682 | Yet Another Maxflow Problem | data structures flows graphs | Statement | G | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2700 | |
| 949 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 1875 | Network Coverage | binary search data structures flows graph matchings graphs greedy | Statement | F | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 2290 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 393 | MCMF? | data structures flows graphs greedy sortings two pointers | Statement | F | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 565 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 260 | Hanabi | data structures dp flows graph matchings graphs greedy | Statement | F | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial |