Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
646 | FreeDiv | dfs and similar graphs greedy | Statement | D | Codeforces Beta Round 66 {73} | PROGRAMMING | 2200 | ||
357 | Road Repairs | dfs and similar graphs greedy | Statement | E | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2800 | ||
1891 | Dispute | dfs and similar graphs greedy | Statement | D | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | 2100 | ||
2038 | Table Compression | dfs and similar dp ds graphs greedy | Statement | C | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 2300 | ||
7092 | Socks | dfs and similar ds graphs greedy | Statement | C | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 1600 | ||
24052 | Rumor | dfs and similar graphs greedy | Statement | C | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 1300 | ||
2140 | Coprocessor | dfs and similar dp graphs greedy | Statement | E | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | 2100 | ||
6828 | Reachability from the Capital | dfs and similar graphs greedy | Statement | E | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
3363 | Gourmet choice | dfs and similar dp ds graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
1607 | Wires | dfs and similar graphs greedy | Statement | N | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2200 |