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 |
|---|---|---|---|---|---|---|---|---|---|
| 1127 | Divisor Tree | brute force number theory trees | Statement | E | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2400 | |
| 2280 | Apple Tree | dfs and similar number theory trees | Statement | B | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2400 | |
| 1739 | Caisa and Tree | brute force dfs and similar math number theory trees | Statement | E | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2400 | |
| 168 | New Year Running | number theory trees | Statement | G | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 3000 | |
| 1500 | Xor-matic Number of the Graph | bitmasks graphs math number theory trees | Statement | G | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2600 | |
| 853 | Surprise me! | divide and conquer math number theory trees | Statement | E | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 3000 | |
| 3753 | Ilya And The Tree | dfs and similar graphs math number theory trees | Statement | C | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2000 | |
| 2171 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 893 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 2295 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 4113 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 992 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 5406 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 1499 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 3588 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 966 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 10501 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1262 | Boring Queries | data structures number theory trees | Statement | F | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 2551 | Hemose in ICPC ? | binary search dfs and similar divide and conquer interactive math number theory trees | Statement | D | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 2000.0 | 95583 | |
| 1008 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 16207 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 3057 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 595 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1174 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 234 | Optimizations From Chelsu | divide and conquer dp number theory trees | Statement | G | Good Bye 2023 {1916} | PROGRAMMING | 3750.0 | ||
| 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 | |
| 941 | Prufer Vertex | combinatorics dsu number theory probabilities trees | Statement | D | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2250.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 429 | Six Seven | divide and conquer math number theory strings trees | Statement | H | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 807 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial |