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 |
|---|---|---|---|---|---|---|---|---|---|
| 1995 | Tree Modification | dfs and similar greedy trees | Statement | G | Codeforces Global Round 9 {1375} | PROGRAMMING | 2250.0 | 79731 | |
| 9836 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 404 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 4221 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 12848 | Gardener and Tree | dfs and similar greedy implementation trees | Statement | E | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1007 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 5493 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 8715 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 4738 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 3589 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 6904 | A Wide, Wide Graph | dfs and similar dp ds greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 5566 | Ksyusha and Chinchilla | dfs and similar dp ds greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 1613 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 4278 | Programming Competition | dfs and similar greedy trees | Statement | F | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 3766 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 1873 | Annual Ants' Gathering | dfs and similar greedy trees | Statement | C | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 760 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
| 3559 | Tree Destruction | dfs and similar dp greedy trees | Statement | G | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING |