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 |
|---|---|---|---|---|---|---|---|---|---|
| 537 | Mashtali and Hagh Trees | combinatorics dp trees | Statement | E | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2750.0 | Codeforces Round #722 Editorial | |
| 1880 | Equidistant Vertices | combinatorics dfs and similar dp trees | Statement | F | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 1080 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 2798 | Preorder | combinatorics divide and conquer dp ds hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 1008 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 685 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 505 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1404 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 18684 | Apple Tree | combinatorics dfs and similar dp trees | Statement | D | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 1193 | Travel Plan | combinatorics divide and conquer dp math trees | Statement | C | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 4969 | Sasha and a Walk in the City | combinatorics dfs and similar dp math trees | Statement | D | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 388 | Nested Segments | combinatorics dp math trees | Statement | E | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2250.0 |