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 |
|---|---|---|---|---|---|---|---|---|---|
| 4991 | Obsession with Robots | constructive algorithms graphs implementation | Statement | B | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 1500 | |
| 6548 | Mail Stamps | data structures dfs and similar graphs implementation | Statement | C | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1700 | |
| 619 | Two Paths | constructive algorithms dsu graphs implementation | Statement | E | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 (Problem E solution) | 2500 | |
| 106 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 2495 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 402 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 1059 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 610 | Widget Library | dp expression parsing graphs implementation | Statement | B | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2200 | |
| 5391 | Friends | graphs implementation math | Statement | B | Codeforces Beta Round 76 (Div. 2 Only) {94} | PROGRAMMING | Analysis Beta Round #76 (Div. 2-A,B,C) | 1400 | |
| 13977 | Students and Shoelaces | brute force dfs and similar graphs implementation | Statement | B | Codeforces Beta Round 94 (Div. 2 Only) {129} | PROGRAMMING | Problem D of Beta Round 94 | 1200 | |
| 290 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2400 | |
| 70 | Gnomes of Might and Magic | data structures graphs implementation shortest paths | Statement | F | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 3000 | |
| 350 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 1055 | Snake | bitmasks dfs and similar graphs implementation | Statement | D | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2300 | |
| 655 | Rats | brute force dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 2600 | |
| 1663 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 10587 | Network Topology | graphs implementation | Statement | B | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1200 | |
| 218 | Deja Vu | constructive algorithms graphs implementation | Statement | E1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 3000 | |
| 433 | Dima and Kicks | brute force dsu graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 3029 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 576 | Sereja and Tree | graphs implementation | Statement | B | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 733 | Ksenia and Pawns | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2300 | |
| 552 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 2604 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 5083 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 1399 | Bug in Code | data structures graphs implementation two pointers | Statement | C | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1900 | |
| 1202 | Valera and Swaps | constructive algorithms dsu graphs implementation math string suffix structures | Statement | D | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2300 | |
| 7334 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 9287 | Strongly Connected City | brute force dfs and similar graphs implementation | Statement | B | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1400 | |
| 63214 | New Year Transportation | dfs and similar graphs implementation | Statement | A | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1100 | |
| 62853 | Two Buttons | dfs and similar graphs greedy implementation math shortest paths | Statement | B | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1400 | |
| 3785 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1965 | Theseus and labyrinth | graphs implementation shortest paths | Statement | D | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | 2000 | ||
| 343 | Bear and Chase | brute force dfs and similar graphs implementation math probabilities | Statement | D | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2900 | |
| 525 | Black Widow | dp graphs implementation math | Statement | C | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 2800 | |
| 7517 | Lakes in Berland | dfs and similar dsu graphs greedy implementation | Statement | D | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 1600 | ||
| 1754 | st-Spanning Tree | dsu graphs greedy implementation | Statement | F | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 2200 | |
| 11917 | Timofey and a tree | dfs and similar dp dsu graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 2943 | Online Courses In BSU | *special dfs and similar graphs implementation | Statement | C | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | 1900 | ||
| 512 | 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 | |
| 3048 | Innokenty and a Football League | 2-sat graphs greedy implementation shortest paths strings | Statement | D | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2000 | |
| 4851 | Igor and his way to work | dfs and similar graphs implementation shortest paths | Statement | B | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 1600 | |
| 350 | Sagheer and Kindergarten | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 2700 | |
| 338 | Perpetual Motion Machine | constructive algorithms dp graphs implementation math trees | Statement | E | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 3100 | |
| 2718 | 1-2-3 | graphs implementation | Statement | C | Educational Codeforces Round 29 {863} | PROGRAMMING | 1800 | ||
| 2378 | National Property | 2-sat dfs and similar graphs implementation | Statement | C | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2100 | |
| 1960 | Restoration of string | constructive algorithms graphs implementation | Statement | D | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2000 | |
| 1624 | New Year and Rainbow Roads | graphs greedy implementation | Statement | F | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 906 | Dependency management | *special graphs implementation | Statement | C | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2300 | ||
| 15413 | Protect Sheep | brute force dfs and similar graphs implementation | Statement | A | Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1) {948} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1000 | |
| 3774 | Mahmoud and Ehab and the xor-MST | bitmasks dp graphs implementation math | Statement | E | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1900 | |
| 765 | Degree Set | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2400 | |
| 4119 | Graph And Its Complement | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1700 | |
| 2585 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 16180 | King Escape | dfs and similar graphs implementation | Statement | A | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1000 | |
| 4177 | Fun with Integers | dfs and similar graphs implementation math | Statement | D | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1800 | |
| 4094 | Maximum Diameter Graph | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1800 | |
| 1089 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 | |
| 4431 | Kilani and the Game | dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1900 | |
| 1326 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 156 | Optimizer | graphs greedy hashing implementation | Statement | G | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 3100 | |
| 10760 | Pairs | graphs implementation | Statement | B | Codeforces Round 562 (Div. 2) {1169} | PROGRAMMING | Codeforces Round #562 — Editorial | 1500 | |
| 1982 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 5445 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 1053 | Vus the Cossack and a Graph | dfs and similar graphs greedy implementation | Statement | F | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2300 | |
| 1164 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 149 | kotlinkotlinkotlinkotlin... | *special graphs implementation strings | Statement | F | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2400 | |
| 3032 | Unstable String Sort | data structures dfs and similar dsu graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 | |
| 5452 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 318 | Swiper, no swiping! | graphs implementation | Statement | F | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3400 | |
| 8321 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 913 | The Coronation | graphs implementation | Statement | E | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2500 | ||
| 12553 | Fridge Lockers | graphs implementation | Statement | B | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1200 | |
| 3878 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 4247 | Time to Run | constructive algorithms graphs implementation | Statement | D | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1750.0 | Codeforces Round #619 (Div. 2) Editorial | 1900 |
| 1417 | 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 |
| 3569 | 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 |
| 4138 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 7765 | Minimum Euler Cycle | constructive algorithms graphs greedy implementation | Statement | D | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 4831 | 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 |
| 28104 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 4997 | 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 |
| 20999 | 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 |
| 2461 | DeadLee | constructive algorithms data structures graphs greedy implementation sortings | Statement | E | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2500.0 | Codeforces Round #652 (Div. 2) Editorial | 2400 |
| 1841 | 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 | |
| 6919 | 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 |
| 4195 | Rarity and New Dress | data structures dp graphs implementation | Statement | D | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1750.0 | Codeforces Round #662 Editorial | |
| 2148 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 565 | 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 | |
| 3207 | Returning Home | data structures graphs implementation shortest paths sortings | Statement | D | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1500.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 15219 | Belted Rooms | graphs implementation | Statement | B | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1000.0 | Codeforces Raif Round 1 Editorial | |
| 5407 | Binary Table (Hard Version) | constructive algorithms graphs greedy implementation | Statement | A2 | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 2216 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 4786 | Minimum Path | dp graphs implementation shortest paths | Statement | E | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 4886 | AB Graph | constructive algorithms graphs greedy implementation strings | Statement | D | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 15443 | 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 | ||
| 8411 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 232 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 5995 | King's Task | brute force graphs implementation | Statement | K | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 6527 | GCD and MST | constructive algorithms data structures dsu graphs implementation number theory sortings | Statement | D | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2000.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 2315 | 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 | |
| 26960 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 Editorial | |
| 385 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 882 | 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 | |
| 10481 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 4864 | 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 | ||
| 410 | Kingdom of Islands | graphs implementation | Statement | K | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 5382 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 8436 | Social Network | dsu graphs greedy implementation trees | Statement | D | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2000.0 | Deltix Round, Autumn 2021. Editorial | 1600 |
| 710 | 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 | |
| 1035 | 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) | |
| 656 | Not Splitting | geometry graphs implementation shortest paths | Statement | F | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 1760 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 17146 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 516 | 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 | |
| 1248 | 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 | ||
| 1596 | Circular Maze | dfs and similar graphs implementation | Statement | O | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 11020 | 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 |
| 14863 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 1452 | 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 | ||
| 180 | Impressionism | constructive algorithms graphs implementation math | Statement | E | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 4408 | 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 | |
| 3829 | Game on Axis | combinatorics dsu graphs implementation | Statement | D | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 936 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 3944 | 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!) | |
| 2184 | Is It Flower? | dfs and similar dsu graphs implementation | Statement | F | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 3622 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 1966 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 27027 | The Lakes | dfs and similar dsu graphs implementation | Statement | E | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1100 | |
| 235 | Good Graph | bitmasks graph matchings graphs implementation | Statement | F | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 3000.0 | Codeforces Round 880 Editorial | |
| 2126 | Railguns | dfs and similar dp graphs implementation | Statement | F | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 10059 | The Third Letter | dfs and similar graphs greedy implementation | Statement | H | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 4088 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 6899 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 2768 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8355 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 383 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 7579 | Selling a Menagerie | dfs and similar dsu graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 1584 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 3960 | Time Travel | binary search graphs implementation shortest paths | Statement | B | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 941 | Game of Stacks | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 2000.0 | Codeforces Round 906 Editorial | |
| 2655 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 2346 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 9881 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 1123 | Caterpillar on a Tree | binary search dfs and similar graphs greedy implementation trees | Statement | F | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 4577 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 12158 | Chat Screenshots | combinatorics dfs and similar graphs implementation | Statement | F | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 541 | Amanda the Amoeba | graphs implementation trees two pointers | Statement | J | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 6156 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 982 | Long Way to be Non-decreasing | binary search dfs and similar graphs implementation shortest paths two pointers | Statement | D | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 2800 |
| 7309 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar dsu graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 4674 | Turtle and a MEX Problem (Hard Version) | dfs and similar dp graphs greedy implementation | Statement | D2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1250.0 | sol-zh.pdf | |
| 1941 | 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 | |
| 7029 | The Endspeaker (Easy Version) | binary search dp graphs greedy implementation two pointers | Statement | D1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 3770 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 9214 | Trapped in the Witch's Labyrinth | constructive algorithms dfs and similar graphs implementation | Statement | C | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 1847 | 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 | ||
| 3889 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2243 | Mirror Maze | brute force dfs and similar graphs implementation | Statement | M | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1800 | |
| 4541 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 18022 | Find the Permutation | dfs and similar graphs implementation sortings | Statement | B | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1250.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 7241 | Object Identification | graphs implementation interactive | Statement | A | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 18427 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 16260 | Disappearing Permutation | dfs and similar dsu graphs greedy implementation | Statement | C | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 4012 | Local Construction | constructive algorithms dfs and similar graphs implementation two pointers | Statement | D | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 2000.0 | 142149 | |
| 900 | Spruce Dispute | constructive algorithms dfs and similar graphs implementation shortest paths trees | Statement | E | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2750.0 | Codeforces Round 1022 Editorial | |
| 14882 | Neo's Escape | data structures dsu graphs greedy implementation | Statement | C | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1500.0 | Codeforces Round 1022 Editorial | |
| 2519 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 8527 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 114 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 853 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 10161 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 2806 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 6801 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 666 | Building Tree | divide and conquer dsu graphs implementation | Statement | F | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial |