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 |
|---|---|---|---|---|---|---|---|---|---|
| 1503 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | 2300 | ||
| 669 | CNF 2 | constructive algorithms dfs and similar graphs greedy | Statement | C | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | 2600 | ||
| 1998 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 2300 | ||
| 3388 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar ds graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 2000 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |