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 |
|---|---|---|---|---|---|---|---|---|---|
| 1812 | Flawed Flow | constructive algorithms flows graphs greedy | Statement | C | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 910 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 2248 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 2300 | |
| 1278 | Anti-Palindromize | flows graphs greedy | Statement | F | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 1873 | 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 | ||
| 2289 | 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 | |
| 26631 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 Editorial | |
| 621 | Bridge Club | flows graphs greedy | Statement | D | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 2800 |
| 392 | 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 | |
| 678 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 1311 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 4506 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 103 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 146 | Variance Challenge | flows graphs greedy | Statement | I | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5500.0 | Refact.ai Match 1 (Codeforces Round 985) 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 |