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 |
|---|---|---|---|---|---|---|---|---|---|
| 5930 | Tournament | bitmasks brute force dfs and similar greedy | Statement | B | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Codeforces Beta #27 - Tutorial | 2000 | |
| 862 | Sweets Game | bitmasks dfs and similar dp games implementation | Statement | E | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 2200 | |
| 9539 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
| 275 | Bitonix' Patrol | bitmasks brute force combinatorics dfs and similar math | Statement | D | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2800 | |
| 1057 | Snake | bitmasks dfs and similar graphs implementation | Statement | D | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2300 | |
| 4945 | Undoubtedly Lucky Numbers | bitmasks brute force dfs and similar | Statement | B | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1600 | |
| 569 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 689 | Sereja and Sets | bitmasks dfs and similar | Statement | D | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2400 | |
| 9200 | Tree Requests | binary search bitmasks constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2400 | |
| 877 | Yash And Trees | bitmasks data structures dfs and similar math number theory | Statement | G | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2700 | |
| 3011 | Persistent Bookcase | bitmasks data structures dfs and similar implementation | Statement | D | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 2100 | |
| 3521 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 2544 | Bitwise Formula | bitmasks brute force dfs and similar expression parsing implementation | Statement | B | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2000 | |
| 2729 | AND Graph | bitmasks dfs and similar dsu graphs | Statement | C | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2300 | |
| 431 | Sources and Sinks | bitmasks brute force dfs and similar | Statement | G | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2800 | |
| 1106 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 9384 | Neko Performs Cat Furrier Transform | bitmasks constructive algorithms dfs and similar math | Statement | B | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1300 | |
| 3336 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 1957 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 8678 | 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 | |
| 530 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 1850 | Johnny and Megan's Necklace | binary search bitmasks constructive algorithms dfs and similar dsu graphs | Statement | C | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2000.0 | Codeforces Round #647 Editorial | 2500 |
| 683 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 2779 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 918 | Matrix Sorting | bitmasks constructive algorithms dfs and similar greedy hashing string suffix structures two pointers | Statement | C | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 1500.0 | Codeforces Round #707 Editorial | 2600 |
| 671 | A Serious Referee | bitmasks brute force dfs and similar sortings | Statement | G | Codeforces Global Round 15 {1552} | PROGRAMMING | 2500.0 | Editorial of Global Round 15 | |
| 6785 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 5018 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 9220 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 4444 | Robot Factory | bitmasks dfs and similar | Statement | J | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2) {1600} | PROGRAMMING | BubbleCup2021.pdf | ||
| 3275 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 2140 | X(or)-mas Tree | 2-sat bitmasks dfs and similar graphs trees | Statement | D | Codeforces Global Round 18 {1615} | PROGRAMMING | 2250.0 | Global Round 18 Editorial | |
| 7721 | MinOr Tree | bitmasks dfs and similar dsu greedy | Statement | G | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 1988 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 1945 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 1377 | ANDfinity | bitmasks brute force constructive algorithms dfs and similar dsu graphs | Statement | E | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1144 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 5901 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 10505 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 4770 | Score of a Tree | bitmasks combinatorics dfs and similar dp probabilities trees | Statement | D | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1129 | The Tree Has Fallen! | bitmasks dfs and similar math trees | Statement | E | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 401 | Tree Cutting | bitmasks dfs and similar dp | Statement | H | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3500.0 | Codeforces Round #854 Editorial | |
| 1192 | 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 | |
| 1036 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 1472 | wxhtzdy ORO Tree | binary search bitmasks data structures dfs and similar math trees | Statement | G | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 7194 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1501 | Trees and XOR Queries Again | bitmasks data structures dfs and similar implementation math trees | Statement | F | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 2112 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 940 | Maximize the Difference | bitmasks brute force dfs and similar | Statement | F | think-cell Round 1 {1930} | PROGRAMMING | 2750.0 | think-cell Round 1 Editorial | |
| 554 | Min-Fund Prison (Hard) | bitmasks dfs and similar dp graphs trees | Statement | G3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 1051 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 1730 | Yasya and the Mysterious Tree | bitmasks data structures dfs and similar graphs strings trees | Statement | G | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 2913 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 2045 | Best Subsequence | bitmasks dfs and similar flows graph matchings graphs | Statement | E | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1853 | Matrix Transformation | bitmasks brute force dfs and similar graphs implementation | Statement | E | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 140 | RGB Walking | bitmasks chinese remainder theorem dfs and similar graphs number theory | Statement | G | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 3000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 1686 | Zebra-like Numbers | bitmasks brute force dfs and similar dp math | Statement | E | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 5560 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 4383 | By the Assignment | bitmasks dfs and similar dsu graphs | Statement | C | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1750.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 3460 | Maple and Tree Beauty (Hard Version) | bitmasks brute force dfs and similar divide and conquer dp fft trees | Statement | C2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 185 | Again Trees... (hard version) | bitmasks data structures dfs and similar dp fft trees | Statement | F2 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 929 | Again Trees... (Easy Version) | bitmasks dfs and similar dp fft trees | Statement | F1 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial |