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 |
|---|---|---|---|---|---|---|---|---|---|
| 1850 | Phoenix and Earthquake | constructive algorithms dfs and similar ds graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 3520 | Permutation Addicts | constructive algorithms dfs and similar ds graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 889 | XOR, Tree, and Queries | constructive algorithms dfs and similar ds graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 2989 | Cool Graph | constructive algorithms data structures dfs and similar ds graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 |