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 |
|---|---|---|---|---|---|---|---|---|---|
| 414 | Tree or not Tree | data structures divide and conquer implementation trees | Statement | E | Codeforces Beta Round 88 {117} | PROGRAMMING | Codeforces Beta Round #88 (Editorial) | 2800 | |
| 1034 | Freezing with Style | binary search data structures divide and conquer trees | Statement | E | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 3000 | |
| 1963 | Close Vertices | data structures divide and conquer trees | Statement | E | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 10765 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 2737 | New Year Tree | data structures divide and conquer trees | Statement | F | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2400 | |
| 449 | Tavas on the Path | data structures divide and conquer trees | Statement | E | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 3100 | |
| 1539 | 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 | |
| 646 | Can Bash Save the Day? | data structures divide and conquer graphs trees | Statement | G | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2500 | |
| 551 | Timofey and our friends animals | data structures divide and conquer dsu | Statement | E | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2800 | |
| 511 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 482 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2800 | |
| 1904 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2400 | |
| 252 | 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 | |
| 406 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 610 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 4517 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 1539 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 716 | 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 | |
| 1005 | Sum of Prefix Sums | data structures divide and conquer geometry trees | Statement | G | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2700 | |
| 278 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 2813 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 5029 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 4077 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 895 | 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 | ||
| 626 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 1148 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 504 | 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 | |
| 2290 | 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 | |
| 2645 | Yet Another Array Counting Problem | data structures divide and conquer dp trees | Statement | E | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2250.0 | Codeforces Round #833 (Div. 2) Editorial | 2300 |
| 1334 | 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 | |
| 587 | Weighed Tree Radius | data structures divide and conquer trees | Statement | G | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 560 | 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 | |
| 614 | Gasoline prices | data structures divide and conquer dsu trees | Statement | E | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 2500.0 | Codeforces Round #857 Editorial | |
| 2105 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 877 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 519 | Teleportation in Byteland | data structures divide and conquer graphs shortest paths trees | Statement | F | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 3000.0 | Video solutions from Geothermal. | |
| 4117 | Array Collapse | data structures divide and conquer dp trees | Statement | D | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 4555 | 01 Tree | data structures divide and conquer greedy implementation sortings trees | Statement | D | Hello 2024 {1919} | PROGRAMMING | 1500.0 | 2100 | |
| 5114 | 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 | ||
| 43 | 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 | |||
| 660 | Frequency Mismatch (Easy Version) | binary search data structures divide and conquer hashing probabilities trees | Statement | F1 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2600 |
| 397 | Bermart Ice Cream | data structures dfs and similar divide and conquer dp implementation trees | Statement | F | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1307 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 522 | 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 | ||
| 204 | Al Fine (Maximizing Version) | binary search data structures divide and conquer greedy trees | Statement | F1 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 4713 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial |