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
< 1 2 3 4 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3168 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 219 | Modernization of Treeland | *special dfs and similar trees | Statement | E | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 723 | 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 |
| 1474 | Super Jaber | dfs and similar graphs implementation shortest paths | Statement | F | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2700 |
| 13081 | Perfect Keyboard | dfs and similar greedy implementation | Statement | C | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1500 | |
| 6201 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 5433 | Kuroni and the Celebration | constructive algorithms dfs and similar graphs interactive trees | Statement | D | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1750.0 | Ozon Tech Challenge 2020 Editorial | 1900 |
| 7551 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 717 | Cow and Vacation | dfs and similar dsu trees | Statement | F | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3200 |
| 20191 | WeirdSort | dfs and similar sortings | Statement | B | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1200 | |
| 2963 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 1177 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 3670 | Nash Matrix | constructive algorithms dfs and similar graphs implementation | Statement | D | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1750.0 | Codecraft-20 (Div.2) Editorial | 2000 |
| 6542 | Navigation System | dfs and similar shortest paths | Statement | B | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1000.0 | Codeforces Round #625 Editorial | |
| 13965 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 18121 | Ehab and Path-etic MEXs | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1250.0 | 74235 | 1500 |
| 2475 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |
| 2441 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 3603 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 12674 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 1241 | Jordan Smiley | dfs and similar geometry implementation | Statement | E | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 21963 | K-Complete Word | dfs and similar dsu greedy implementation strings | Statement | C | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1500 |
| 1209 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 2465 | Robots on a Grid | data structures dfs and similar dsu graphs greedy matrices | Statement | F | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2600 | |
| 25800 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 1165 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 1100 | Nastya and Time Machine | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1750.0 | Codeforces Round #637 Editorial | |
| 6412 | Monopole Magnets | constructive algorithms dfs and similar dsu graphs | Statement | B | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 2000 |
| 2035 | Quantifier Question | dfs and similar dp graphs math | Statement | C | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1500.0 | Codeforces Round #639 Editorial | 2600 |
| 971 | Phoenix and Memory | data structures dfs and similar graphs greedy | Statement | F | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 3000.0 | Codeforces Round #638 (Div. 2) Editorial | 2600 |
| 4931 | Orac and Game of Life | dfs and similar graphs implementation shortest paths | Statement | C | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1250.0 | Codeforces Round #641 Editorial | 2000 |
| 19906 | Binary String Reconstruction | constructive algorithms dfs and similar math | Statement | F | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1500 | |
| 3844 | Graph Coloring | dfs and similar dp graphs | Statement | E | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2100 | |
| 2166 | 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 |
| 1071 | James and the Chase | dfs and similar graphs probabilities trees | Statement | E | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3000.0 | Codeforces Round #647 Editorial | 3000 |
| 7632 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 5183 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 21576 | Solve The Maze | constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 2440 | Ski Accidents | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Global Round 8 {1368} | PROGRAMMING | 2500.0 | Codeforces Global Round 8: editorial | |
| 751 | BareLee | dfs and similar dp games | Statement | F | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 3000.0 | Codeforces Round #652 (Div. 2) Editorial | 2700 |
| 1856 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 1746 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 2318 | Tree Modification | dfs and similar greedy trees | Statement | G | Codeforces Global Round 9 {1375} | PROGRAMMING | 2250.0 | 79731 | |
| 839 | The Majestic Brown Tree Snake | dfs and similar dp greedy trees two pointers | Statement | D | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2500.0 | Codeforces Round #658 Editorial | 3000 |
| 9703 | Directing Edges | dfs and similar graphs | Statement | E | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2000 | |
| 1989 | Columns Swaps | 2-sat dfs and similar dsu graphs implementation | Statement | G | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 2967 | 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 | |
| 983 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 10522 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 6997 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 564 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 2100 | Pairs of Pairs | constructive algorithms dfs and similar graphs trees | Statement | E | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 789 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 443 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 2604 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6446 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 10830 | 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 | |
| 271 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 440 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 1320 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 8397 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 12225 | Link Cut Centroids | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 2016 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 8685 | Peaceful Rooks | dfs and similar dsu graphs | Statement | C | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2938 | 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 |
| 685 | Rain of Fire | binary search dfs and similar dsu graphs implementation sortings | Statement | F | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 3000.0 | Codeforces Round #671 Editorial | |
| 32507 | Districts Connection | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 5415 | Reducing Delivery Cost | dfs and similar graphs shortest paths | Statement | G | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 6581 | Bandit in a City | binary search dfs and similar greedy trees | Statement | D | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2000.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 1964 | Team-Building | 2-sat dfs and similar dsu graphs | Statement | C | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 1500.0 | Codeforces Round #680 Editorial | |
| 172 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.0 | Codeforces Round #680 Editorial | |
| 130 | Long Recovery | constructive algorithms dfs and similar | Statement | E | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 1572 | Capitalism | constructive algorithms dfs and similar graphs shortest paths | Statement | E | Codeforces Global Round 12 {1450} | PROGRAMMING | 2500.0 | Codeforces Global Round 12 Editorial | |
| 2267 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 7014 | 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 | ||
| 1793 | Plan of Lectures | dfs and similar dsu graphs | Statement | E | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 3101 | Euclid's nightmare | dfs and similar dsu graphs math | Statement | F | Good Bye 2020 {1466} | PROGRAMMING | 1750.0 | Good Bye 2020 Editorial | |
| 1856 | Distinctive Roots in a Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 2500.0 | Codeforces Round #695 (Div. 2) Editorial | 2500 |
| 4309 | Strange Housing | constructive algorithms dfs and similar dsu graph matchings graphs | Statement | D | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1500.0 | 86464 | |
| 5950 | Moving to the Capital | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 28695 | Ball in Berland | combinatorics dfs and similar graphs hashing math | Statement | C | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 8099 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 2854 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 9331 | Journey | dfs and similar dp dsu implementation two pointers | Statement | D | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 814 | Nezzar and Hidden Permutations | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2250.0 | 87294 | 2800 |
| 15595 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 22120 | Permutation Transformation | dfs and similar divide and conquer implementation | Statement | D | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 1335 | Almost Fault-Tolerant Database | brute force constructive algorithms dfs and similar greedy implementation | Statement | E | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 3000.0 | Codeforces Round #704 Editorial | |
| 1599 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 1117 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2541 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 1717 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 986 | 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 |
| 491 | Tree Calendar | brute force constructive algorithms dfs and similar sortings | Statement | E | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 1820 | Complete the MST | data structures dfs and similar dsu graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 249 | Cactus Not Enough | dfs and similar graphs | Statement | C | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 12593 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 2229 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 1433 | Phoenix and Odometers | dfs and similar graphs math number theory | Statement | G | Codeforces Global Round 14 {1515} | PROGRAMMING | 3500.0 | Editorial | |
| 966 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 4408 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2412 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 2352 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 20123 | 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 | |
| 3051 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 61 | Excursions | *special constructive algorithms dfs and similar flows graphs | Statement | I | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 98 | Biome Map | *special constructive algorithms dfs and similar graphs | Statement | G | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 14063 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 839 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1487 | Falling Sand (Easy Version) | dfs and similar graphs greedy | Statement | F1 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1750.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 2870 | Figure Fixing | constructive algorithms dfs and similar dsu graphs math | Statement | F | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 2000.0 | Codeforces Round #726 (Div.2) Editorial | |
| 5690 | Need for Pink Slips | brute force dfs and similar implementation math probabilities | Statement | C | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1500.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 3736 | How Many Paths? | dfs and similar dp graphs trees | Statement | G | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 16714 | Air Conditioners | dfs and similar dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 2247 | Equidistant Vertices | combinatorics dfs and similar dp trees | Statement | F | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 700 | 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 | |
| 154 | Organizing a Music Festival | dfs and similar math | Statement | I | Codeforces Global Round 15 {1552} | PROGRAMMING | 3750.0 | Editorial of Global Round 15 | |
| 3860 | Permutation Shift | brute force combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 1447 | You | dfs and similar dp math number theory | Statement | E | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #735 (Div. 2) | 2600 |
| 776 | Down Below | binary search dfs and similar graphs meet-in-the-middle shortest paths | Statement | E | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 3000.0 | Codeforces Round #740 Editorial | 3000 |
| 3250 | 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 |
| 6850 | 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 | |
| 5120 | 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 | |
| 4510 | Buds Re-hanging | dfs and similar graphs greedy trees | Statement | E | Codeforces Global Round 16 {1566} | PROGRAMMING | 2000.0 | Codeforces Global Round 16 Editorial | |
| 895 | One-Four Overload | 2-sat constructive algorithms dfs and similar geometry graphs implementation | Statement | F | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2750.0 | Codeforces Round #742 Editorial | |
| 4929 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 2924 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 390 | Just Kingdom | data structures dfs and similar | Statement | J | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 2556 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1259 | Frequency Queries | data structures dfs and similar trees | Statement | E | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 293 | Frequency Queries | data structures dfs and similar | Statement | E | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 2670 | 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 | |
| 9425 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 15297 | Gardener and Tree | dfs and similar greedy implementation trees | Statement | E | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 9946 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 2584 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 26062 | Computer Game | dfs and similar dp implementation | Statement | A | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 4482 | 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 | ||
| 3316 | Treelabeling | bitmasks constructive algorithms dfs and similar games graphs greedy trees | Statement | D | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2000.0 | tutorial | 2100 |
| 2174 | Robot on the Board 2 | dfs and similar graphs | Statement | F | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 313 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 7457 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 720 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 783 | 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 | |
| 8575 | Escape The Maze (easy version) | dfs and similar greedy shortest paths trees two pointers | Statement | E1 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 4449 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 6033 | Crazy Robot | constructive algorithms dfs and similar graphs | Statement | E | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 2202 | 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 | |
| 474 | Just Add an Edge | dfs and similar dp graphs | Statement | G | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3500.0 | Good Bye 2021 -- Editorial | 3500 |
| 1081 | 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) | |
| 2818 | Unusual Minesweeper | binary search dfs and similar dsu implementation sortings | Statement | G | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7576 | Hidden Permutations | dfs and similar interactive math | Statement | C | Hello 2022 {1621} | PROGRAMMING | 1500.0 | ||
| 1303 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 7968 | MinOr Tree | bitmasks dfs and similar dsu greedy | Statement | G | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 1205 | 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) | |
| 742 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 16526 | 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 | |
| 1387 | Distance Tree (easy version) | dfs and similar shortest paths trees | Statement | E1 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 1296 | Distance Tree (hard version) | dfs and similar shortest paths trees | Statement | E2 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 2321 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2880 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 2200 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 4850 | Big Brush | dfs and similar greedy implementation | Statement | D | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1750.0 | Codeforces Round #771 Editorial | |
| 4522 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 1150 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 623 | 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 | |
| 191 | Two Avenues | data structures dfs and similar graphs | Statement | F | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 3750.0 | Codeforces Round #775 Editorial | |
| 3112 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 6830 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 675 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 3102 | 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 |
| 4020 | Equal Tree Sums | constructive algorithms dfs and similar trees | Statement | E | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2500.0 | Tutorial | |
| 2035 | 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 | |
| 261 | Tree and Permutation Game | dfs and similar games trees | Statement | F | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 3000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 21250 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1177 | 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 | ||
| 1293 | Antennas | data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths | Statement | F | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1627 | Circular Maze | dfs and similar graphs implementation | Statement | O | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 10091 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 3764 | Labyrinth | dfs and similar graphs | Statement | L | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 884 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 22248 | Fall Down | dfs and similar implementation | Statement | G | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 11208 | Where is the Pizza? | data structures dfs and similar dsu graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 2017 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 976 | Checker for Array Shuffling | constructive algorithms dfs and similar graphs | Statement | F2 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2800 |
| 2995 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 6428 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 26405 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 4162 | Tokitsukaze and Two Colorful Tapes | constructive algorithms dfs and similar dsu graphs greedy | Statement | C | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 6111 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1006 | Lenient Vertex Cover | data structures dfs and similar divide and conquer dsu graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 10966 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 2481 | 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 | |
| 787 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 546 | Permutation Weight (Easy Version) | constructive algorithms dfs and similar dsu | Statement | D1 | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2800 |
| 1748 | Sanae and Giant Robot | brute force constructive algorithms data structures dfs and similar dsu | Statement | C | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 1425 | 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) | |
| 14071 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1198 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 2197 | Number of Groups | data structures dfs and similar dsu graphs greedy sortings | Statement | E | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 9771 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 2507 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2342 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 546 | Ambiguous Dominoes | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 1174 | 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 | |
| 1493 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 6262 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 6598 | Passable Paths (easy version) | data structures dfs and similar sortings trees | Statement | G1 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 19067 | Split Into Two Sets | dfs and similar dsu graph matchings graphs | Statement | E | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 1982 | DFS Trees | data structures dfs and similar dsu graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 31994 | Three Doors | brute force dfs and similar math | Statement | A | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 4342 | XOR Tree | data structures dfs and similar dsu greedy trees | Statement | E | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 511 | Triameter | data structures dfs and similar trees | Statement | F | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 3500.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 9895 | Path Prefixes | binary search data structures dfs and similar implementation trees | Statement | G | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 798 | Madoka and The First Session | constructive algorithms dfs and similar flows graph matchings graphs | Statement | F | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 3000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2500 |
| 8162 | L-shapes | dfs and similar implementation | Statement | F | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1700 | |
| 4294 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 11070 | Phase Shift | dfs and similar dsu graphs greedy strings | Statement | C | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1250.0 | Codeforces Round #824 — editorial | |
| 583 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 3790 | Permutation Addicts | constructive algorithms dfs and similar dsu graphs trees | Statement | D | Codeforces Global Round 22 {1738} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 6560 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 5162 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 18830 | Masha and a Beautiful Tree | dfs and similar divide and conquer graphs sortings trees | Statement | D | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 5191 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 651 | Distance to the Path | data structures dfs and similar trees | Statement | F | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 2175 | Cactus Wall | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 138 (Rated for Div. 2) {1749} | PROGRAMMING | 108269 | ||
| 1082 | Tick, Tock | 2-sat combinatorics dfs and similar dsu graphs | Statement | E | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 2250.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 11000 | 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 | ||
| 10841 | Set Construction | constructive algorithms dfs and similar graphs greedy | Statement | C | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1250.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 1286 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 15156 | Hamiltonian Wall | dfs and similar dp implementation | Statement | C | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 9383 | Lucky Permutation | dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1750.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 4505 | Koxia and Game | data structures dfs and similar dsu games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 3321 | Hossam and (sub-)palindromic tree | brute force dfs and similar dp trees | Statement | D | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2250.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 4036 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 9106 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 2480 | Edge Reverse | binary search dfs and similar dsu graphs | Statement | E | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2250.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 4972 | 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 | |
| 1199 | 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 | |
| 981 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 1470 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1243 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 4206 | 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 | ||
| 1357 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1438 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 4730 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 713 | 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 | |
| 522 | 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 | |
| 2662 | Symmetree | dfs and similar hashing trees | Statement | G | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 1973 | 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) |