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 |
|---|---|---|---|---|---|---|---|---|---|
| 3974 | Exposition | binary search data structures dsu trees two pointers | Statement | E | Codeforces Beta Round 6 (Div. 2 Only) {6} | PROGRAMMING | Beta Round #6 - Разбор задач | 1900 | |
| 1958 | Beard Graph | data structures dsu trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2200 | |
| 360 | Alien DNA | data structures dsu trees | Statement | E | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2700 | |
| 6618 | Vessels | data structures dsu implementation trees | Statement | D | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1900 | |
| 1143 | Campus | binary search data structures dsu trees | Statement | D | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3000 | |
| 19036 | Lomsat gelral | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2300 | |
| 1260 | Acyclic Organic Compounds | data structures dfs and similar dsu hashing strings trees | Statement | D | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2400 | |
| 1562 | Pastoral Oddities | data structures divide and conquer dsu math trees | Statement | E | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | Codeforces Round #334 Bonus Editorial: More Ideas on Div. 1 E | 2900 | |
| 10657 | Minimum spanning tree for each edge | data structures dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 1025 | Clockwork Bomb | data structures dfs and similar dsu greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 3100 | |
| 693 | ...Wait for it... | data structures dsu trees | Statement | E | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2900 | |
| 1387 | Drivers Dissatisfaction | data structures dsu graphs trees | Statement | F | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 2500 | |
| 3199 | Imbalance Value of a Tree | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 261 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 232 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 2233 | 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 |
| 2544 | Shark | brute force data structures dsu trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 8063 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 1573 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 689 | Daleks' Invasion (hard) | data structures dsu graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 738 | Forced Online Queries Problem | data structures divide and conquer dsu graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 4404 | Segment Tree | data structures dsu graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 2444 | Merging Towers | data structures dsu implementation trees | Statement | E | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 2818 | Graph and Queries | data structures dfs and similar dsu graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 6776 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 937 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 1122 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 763 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 9811 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 588 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 1148 | Narrow Components | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 2423 | Unique Occurrences | data structures dfs and similar divide and conquer dp dsu trees | Statement | F | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2300 | |
| 3892 | Qpwoeirut and Vertices | binary search data structures dsu trees | Statement | E | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 2250.0 | Codeforces Round #809 Editorial | |
| 1961 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 4147 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 1444 | Comfortably Numb | binary search bitmasks data structures divide and conquer dsu strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 638 | Li Hua and Path | data structures dfs and similar divide and conquer dsu trees | Statement | F | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 3000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 733 | Gasoline prices | data structures divide and conquer dsu trees | Statement | E | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 2500.0 | Codeforces Round #857 Editorial | |
| 1947 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 3977 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 1717 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 4162 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 4089 | Unusual Entertainment | data structures dfs and similar dsu shortest paths sortings trees | Statement | G | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 662 | Smooth Sailing (Hard Version) | binary search data structures dsu graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 5308 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 5505 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 44 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 1305 | Turtle and Intersected Segments | data structures dsu graphs greedy | Statement | E | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2500.0 | Simplified Chinese Tutorial | |
| 4425 | Iris and the Tree | brute force data structures dfs and similar dsu math trees | Statement | B | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1250.0 | Tutorial | |
| 1959 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1245 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 4000 | Cool Graph | constructive algorithms data structures dfs and similar dsu graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 10040 | Penchick and Desert Rabbit | data structures dfs and similar dp dsu greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 943 | Counting Is Not Fun (Hard Version) | combinatorics data structures dfs and similar dsu trees | Statement | F2 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 2411 | Triangle Tree | data structures dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 550 | Modulo 3 | data structures divide and conquer dsu trees | Statement | G | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 3989 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 743 | Juan's Colorful Tree | data structures data structures dfs and similar dfs and similar dsu graphs graphs trees | Statement | F | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 3000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 7549 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12230 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 2050 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 2197 | Vessels, Heights and Two Versions (Hard Version) | data structures dfs and similar dsu greedy implementation trees | Statement | F | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 |