Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 910 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 8588 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 18868 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 3048 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 3983 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1801 | Tenzing and Tree | brute force dfs and similar greedy trees | Statement | F | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2500.0 | CodeTON Round 5 Editorial | |
| 508 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 7474 | Paint the Tree | brute force dfs and similar dp greedy shortest paths trees | Statement | D | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1500.0 | editorial_zh.pdf | 1700 |
| 4059 | Wonderful Tree! | brute force dfs and similar dp flows greedy trees | Statement | E | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 9526 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 5833 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 520 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 3770 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 3520 | Apple Tree Traversing | brute force dfs and similar greedy implementation trees | Statement | D | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2000.0 | Codeforces Round 1023 (Div 2) Editorial |