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 |
|---|---|---|---|---|---|---|---|---|---|
| 2238 | Subordinates | constructive algorithms data structures graphs greedy sortings | Statement | E | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2000 | |
| 1953 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 3591 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 9311 | Harmonious Graph | constructive algorithms dfs and similar ds graphs greedy sortings | Statement | D | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1700 | |
| 7532 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 8443 | Johnny and Contribution | constructive algorithms graphs greedy sortings | Statement | A | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 500.0 | Codeforces Round #647 Editorial | 1700 |