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 |
|---|---|---|---|---|---|---|---|---|---|
| 5925 | Number of Simple Paths | combinatorics data structures dfs and similar ds graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 696 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 1354 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 1947 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 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 | ||
| 231 | Imitating the Key Tree | combinatorics ds trees | Statement | I | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 698 | Tree Sum | combinatorics trees | Statement | E | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 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 | |
| 4788 | LuoTianyi and the Floating Islands (Easy Version) | combinatorics math probabilities trees | Statement | B1 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1800 |
| 2807 | LuoTianyi and the Floating Islands (Hard Version) | combinatorics dfs and similar math probabilities trees | Statement | B2 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2300 |
| 2263 | Playoff Fixing | combinatorics trees | Statement | E | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 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. | |
| 1842 | Sasha and the Wedding Binary Search Tree | combinatorics dfs and similar math sortings trees | Statement | F | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 3000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 1095 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 1829 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | ||
| 388 | Nested Segments | combinatorics dp math trees | Statement | E | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2250.0 |