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 5 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5116 | Obsession with Robots | constructive algorithms graphs implementation | Statement | B | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 1500 | |
| 828 | Beads | dp graphs | Statement | E | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2600 | |
| 1206 | Interestring graph and Apples | dfs and similar dsu graphs | Statement | E | Codeforces Beta Round 9 (Div. 2 Only) {9} | PROGRAMMING | Codeforces Beta Round #9 tutorial | 2300 | |
| 6984 | A Simple Task | bitmasks dp graphs | Statement | D | Codeforces Beta Round 11 {11} | PROGRAMMING | 2200 | ||
| 5457 | Two Paths | dfs and similar dp graphs shortest paths trees two pointers | Statement | D | Codeforces Beta Round 14 (Div. 2) {14} | PROGRAMMING | Codeforces Beta Round #14 tutorial | 2100 | |
| 50612 | Dijkstra? | graphs shortest paths | Statement | C | Codeforces Alpha Round 20 (Codeforces format) {20} | PROGRAMMING | 2100 | ||
| 1419 | Traveling Graph | bitmasks graph matchings graphs | Statement | D | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2500 | ||
| 3963 | System Administrator | graphs | Statement | C | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 1700 | |
| 2201 | Scheme | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 2400 | |
| 3955 | Party | constructive algorithms graphs math | Statement | B | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 1600 | |
| 7393 | Ring road | graphs | Statement | A | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 1400 | |
| 8799 | Roads in Berland | graphs shortest paths | Statement | C | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1800 | |
| 16836 | Roads not only in Berland | dsu graphs trees | Statement | D | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | Codeforces Beta Round #25 Solution Analysis | 1900 | |
| 3203 | Ring Road 2 | 2-sat dfs and similar dsu graphs | Statement | D | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2300 | |
| 5713 | pSort | dfs and similar dsu graphs | Statement | B | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 1600 | |
| 6806 | 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 | |
| 3065 | Ant on the Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1900 | |
| 1195 | Quarrel | graphs shortest paths | Statement | E | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 2400 | |
| 1642 | Knights | geometry graphs shortest paths sortings | Statement | D | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | Codeforces Beta Round #33. Analysis of problem A | 2000 | |
| 6726 | Road Map | dfs and similar graphs | Statement | D | Codeforces Beta Round 34 (Div. 2) {34} | PROGRAMMING | Codeforces Beta Round #34 (Div. 2) Разбор | 1700 | |
| 653 | Two Paths | constructive algorithms dsu graphs implementation | Statement | E | Codeforces Beta Round 36 {36} | PROGRAMMING | Codeforces Beta Round #36 (Problem E solution) | 2500 | |
| 723 | Trial for Chief | graphs greedy shortest paths | Statement | E | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 2600 | |
| 2287 | 3-cycles | constructive algorithms graphs greedy | Statement | E | Codeforces Beta Round 40 (Div. 2) {41} | PROGRAMMING | Codeforces Beta Round #40 Mini-Tutorial | 1900 | |
| 287 | Baldman and the military | dfs and similar graphs trees | Statement | E | Codeforces Beta Round 41 {42} | PROGRAMMING | Solution of task е, Codeforces beta round #41 | 2700 | |
| 84 | BerPaint | geometry graphs | Statement | F | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of A-E, H, J. | 2600 | |
| 250 | Road Problem | graphs | Statement | H | School Team Contest 3 (Winter Computer School 2010/11) {45} | PROGRAMMING | 2600 | ||
| 397 | Hercule Poirot Problem | dsu graphs | Statement | F | School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules) {46} | PROGRAMMING | School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules). Tasks B, D, E tutorial. | 2300 | |
| 741 | Ivan the Fool VS Gorynych the Dragon | dp games graphs | Statement | E | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2100 | ||
| 505 | Pentagon | combinatorics graphs matrices | Statement | E | Codeforces Beta Round 48 {51} | PROGRAMMING | 2300 | ||
| 868 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 5280 | Shortest Path | graphs shortest paths | Statement | E | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2100 | ||
| 7856 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 473 | Wormhouse | dfs and similar graphs | Statement | D | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 110 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 2567 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 785 | FreeDiv | dfs and similar graphs greedy | Statement | D | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 2200 | |
| 1452 | Chessboard Billiard | dfs and similar dsu graphs number theory | Statement | C | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2100 | |
| 2563 | Gift | dsu graphs sortings trees | Statement | A | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2300 | |
| 790 | Evacuation | flows graphs shortest paths | Statement | E | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2500 | |
| 464 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 497 | Track | graphs greedy shortest paths | Statement | C | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 2400 | ||
| 1161 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 1117 | 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 | |
| 618 | 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 | |
| 1043 | Ski Base | combinatorics dsu graphs | Statement | C | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 319 | Grocer's Problem | constructive algorithms graphs greedy | Statement | D | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 5462 | 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 | |
| 2121 | Lucky Country | dp dsu graphs | Statement | E | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2400 | |
| 370 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 457 | Leaders | dfs and similar dsu graphs trees | Statement | E | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2800 | |
| 11169 | Cthulhu | dfs and similar dsu graphs | Statement | B | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 1600 | |
| 6025 | Dorm Water Supply | dfs and similar graphs | Statement | A | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 1500 | |
| 522 | Crime Management | dp graphs matrices | Statement | D | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2400 | |
| 165 | Darts | geometry probabilities | Statement | E | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2600 | |
| 4352 | PFAST Inc. | bitmasks brute force graphs | Statement | B | Codeforces Beta Round 86 (Div. 2 Only) {114} | PROGRAMMING | Codeforces Beta Round #86 Editorial | 1500 | |
| 46273 | Party | dfs and similar graphs trees | Statement | A | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 1300 | |
| 3048 | Cycle | dfs and similar graphs | Statement | C | Codeforces Beta Round 88 {117} | PROGRAMMING | Неофициальный разбор Codeforces Beta Round #88 | 2000 | |
| 9189 | Bertown roads | dfs and similar graphs | Statement | E | Codeforces Beta Round 89 (Div. 2) {118} | PROGRAMMING | Разбор задач. Codeforces beta round #89. | 2100 | |
| 1687 | MST Company | binary search graphs | Statement | E | Codeforces Testing Round 2 {125} | PROGRAMMING | 2400 | ||
| 14228 | 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 | |
| 5355 | Subway | dfs and similar graphs | Statement | D | Codeforces Beta Round 95 (Div. 2) {131} | PROGRAMMING | Some ideas for Round #95 (Div 2) | 1600 | |
| 606 | Bits of merry old England | flows graphs | Statement | E | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 2600 | |
| 611 | Swaps | constructive algorithms graphs greedy | Statement | C | Codeforces Testing Round 3 {134} | PROGRAMMING | 2200 | ||
| 1266 | Take-off Ramps | graphs shortest paths | Statement | D | Codeforces Round 101 (Div. 2) {141} | PROGRAMMING | Codeforces Round #101 (Div. 2) Разбор Задач. | 2400 | |
| 1432 | Clearing Up | constructive algorithms dp dsu graphs | Statement | E | Codeforces Round 101 (Div. 2) {141} | PROGRAMMING | Codeforces Round #101 (Div. 2) Разбор Задач. | 2600 | |
| 5248 | Missile Silos | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 103 (Div. 2) {144} | PROGRAMMING | Codeforces Round #103 (Div. 2) Разбор Задач. | 1900 | |
| 1017 | Smile House | binary search graphs matrices | Statement | B | Codeforces Testing Round 4 {147} | PROGRAMMING | 2300 | ||
| 5574 | Quantity of Strings | combinatorics dfs and similar graphs math | Statement | B | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 1800 | |
| 624 | Garden | bitmasks dp graphs trees | Statement | E | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 2400 | |
| 3488 | Double Profiles | graphs hashing sortings | Statement | C | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | Codeforces Round #109: editorial | 2300 | |
| 2164 | Clues | combinatorics graphs | Statement | D | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 2400 | |
| 3620 | Edges in MST | dfs and similar dsu graphs sortings | Statement | D | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2500 | |
| 1240 | Variable, or There and Back Again | dfs and similar graphs | Statement | A | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2000 | |
| 1055 | Machine Programming | flows graphs | Statement | C | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2400 | |
| 322 | Wizards and Roads | data structures divide and conquer graph matchings graphs greedy | Statement | D | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 738 | Wizards and Bets | dfs and similar graphs math matrices | Statement | E | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 319 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2400 | |
| 102 | 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 | |
| 3107 | Party | brute force dfs and similar dsu graphs | Statement | C2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 3078 | Party | dfs and similar dsu graphs | Statement | C1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 369 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 1830 | Counter Attack | data structures dsu graphs hashing sortings | Statement | E | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 2300 | |
| 428 | Metro Scheme | graphs greedy | Statement | D | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2800 | |
| 4773 | Cutting Figure | constructive algorithms graphs trees | Statement | A | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 1700 | |
| 936 | Building Forest | data structures dsu graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 2200 | |
| 2514 | Infinite Maze | dfs and similar graphs | Statement | B | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1900 | |
| 1279 | Opening Portals | dsu graphs shortest paths | Statement | E | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2500 | |
| 2201 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 929 | Trails and Glades | constructive algorithms dsu graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
| 323 | Privatization | flows graphs | Statement | A | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2700 | ||
| 25624 | Ice Skating | brute force dfs and similar dsu graphs | Statement | A | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 1400 | |
| 13380 | Choosing Capital for Treeland | dfs and similar dp graphs trees | Statement | D | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1900 | |
| 290 | Planar Graph | flows geometry graphs | Statement | E | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | Tutorial | 3000 | |
| 92 | Spider | geometry graphs | Statement | D | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 3000 | ||
| 1078 | Snake | bitmasks dfs and similar graphs implementation | Statement | D | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2300 | |
| 2893 | The Road to Berland is Paved With Good Intentions | 2-sat dfs and similar dsu graphs | Statement | E | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2000 | |
| 6062 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1900 | |
| 1845 | Triangles | combinatorics graphs math | Statement | C | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2100 | |
| 2410 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 2869 | Cycles | binary search constructive algorithms graphs greedy | Statement | A | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 1800 | |
| 343 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 724 | Graph Game | graphs | Statement | D | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 3000 | |
| 2077 | Build String | flows graphs | Statement | E | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2100 | |
| 652 | T-decomposition | dfs and similar graphs greedy trees | Statement | D | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2200 | |
| 533 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 445 | Road Repairs | dfs and similar graphs greedy | Statement | E | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2800 | ||
| 1509 | Flights | graphs shortest paths | Statement | E | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2600 | ||
| 11706 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1800 | |
| 2075 | Dispute | dfs and similar graphs greedy | Statement | D | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 2100 | |
| 1370 | Hydra | graphs sortings | Statement | B | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2100 | |
| 567 | Suggested Friends | brute force graphs | Statement | G | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | CROC-MBTU 2012, Elimination Round — Editorial | 2200 | |
| 10438 | Colorful Graph | brute force dfs and similar graphs | Statement | D | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1700 | |
| 2956 | Text Editor | data structures dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1600 | |
| 672 | 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 | |
| 1704 | Black and White Tree | constructive algorithms dsu graphs greedy trees | Statement | D | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2200 | |
| 4636 | Cycle in Graph | dfs and similar graphs | Statement | D | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 1800 | |
| 1038 | BerDonalds | graphs math shortest paths | Statement | D | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 789 | Dominoes | dfs and similar graphs | Statement | B | Codeforces Testing Round 5 {267} | PROGRAMMING | 1900 | ||
| 1949 | Flawed Flow | constructive algorithms flows graphs greedy | Statement | C | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 535 | Maximum Waterfall | data structures dp graphs sortings | Statement | D | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 1355 | Dima and Horses | combinatorics constructive algorithms graphs | Statement | E | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 2300 | |
| 1213 | Lovely Matrix | dfs and similar graphs greedy sortings | Statement | D | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2100 | |
| 1952 | Little Girl and Problem on Trees | data structures graphs trees | Statement | E | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 2300 | |
| 1792 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 3976 | Cow Program | dfs and similar dp graphs | Statement | B | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1900 | |
| 159 | Greedy Petya | *special dfs and similar graphs greedy | Statement | F | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2800 | |
| 10998 | Network Topology | graphs implementation | Statement | B | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1200 | |
| 18912 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 1990 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 7378 | Coach | brute force dfs and similar graphs | Statement | B | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1500 | |
| 2891 | Yaroslav and Time | binary search graphs shortest paths | Statement | B | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2000 | |
| 989 | Minimum Modular | brute force graphs math number theory | Statement | C | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2700 | |
| 604 | Fetch the Treasure | brute force data structures graphs shortest paths | Statement | C | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2600 | |
| 590 | Balance | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2700 | |
| 7891 | Ping-Pong (Easy Version) | dfs and similar graphs | Statement | B | Codeforces Round 189 (Div. 2) {320} | PROGRAMMING | Codeforces Round #189 — Editorial | 1500 | |
| 498 | Tournament-graph | constructive algorithms graphs | Statement | B | Testing Round 7 {323} | PROGRAMMING | 2000 | ||
| 506 | Monsters and Diamonds | dfs and similar graphs shortest paths | Statement | C | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2500 | ||
| 1030 | The Red Button | combinatorics dfs and similar dsu graphs greedy | Statement | E | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 2700 | |
| 2537 | Block Tower | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2000 | |
| 19852 | Road Construction | constructive algorithms graphs | Statement | B | Codeforces Round 192 (Div. 2) {330} | PROGRAMMING | Codeforces Round #192 Editorial | 1300 | |
| 164 | Escaping on Beaveractor | graphs | Statement | D2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2600 | |
| 219 | Deja Vu | constructive algorithms graphs implementation | Statement | E1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 3000 | |
| 444 | Theft of Blueprints | graphs math | Statement | D | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2400 | |
| 8847 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 2852 | Iahub and Permutations | combinatorics math | Statement | E | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2200 | |
| 7392 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 993 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 9702 | Simple Molecules | brute force graphs math | Statement | B | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 1300 | |
| 84 | Chain Letter | *special dfs and similar graphs | Statement | D | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2300 | ||
| 892 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 3438 | Resort | graphs | Statement | B | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 885 | Wrong Floyd | brute force constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2200 | |
| 448 | Dima and Kicks | brute force dsu graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 849 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2800 | |
| 1123 | Fools and Foolproof Roads | data structures dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2500 | |
| 947 | Petya and Pipes | flows graphs shortest paths | Statement | E | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2700 | |
| 1966 | Sereja and the Arrangement of Numbers | graphs greedy sortings | Statement | C | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2200 | |
| 12367 | Valera and Elections | dfs and similar graphs trees | Statement | C | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1700 | |
| 1334 | Valera and Fools | dfs and similar dp graphs shortest paths | Statement | D | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2300 | |
| 12317 | Rook, Bishop and King | graphs math shortest paths | Statement | A | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1200 | |
| 3069 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 585 | Sereja and Tree | graphs implementation | Statement | B | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 756 | 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 | |
| 586 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 1231 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 2621 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 1892 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 3296 | Dima and Bacteria | dsu graphs shortest paths | Statement | D | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2000 | |
| 6459 | Searching for Graph | brute force constructive algorithms graphs | Statement | C | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1500 | |
| 2375 | Strictly Positive Matrix | graphs math | Statement | E | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 5894 | Restore Graph | dfs and similar graphs sortings | Statement | C | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1800 | |
| 1668 | Graph Cutting | dfs and similar graphs | Statement | E | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 2400 | |
| 1932 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 5128 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 591 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 1442 | 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 | |
| 17932 | Checkposts | dfs and similar graphs two pointers | Statement | C | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1700 | |
| 1059 | Points and Segments | graphs | Statement | E | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2900 | |
| 2954 | Dungeons and Candies | dsu graphs greedy trees | Statement | C | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1800 | |
| 15188 | The Child and Toy | graphs greedy sortings | Statement | C | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1600 | |
| 1269 | 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 | |
| 11450 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 1842 | Little Pony and Summer Sun Celebration | constructive algorithms dfs and similar graphs | Statement | C | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2800 | |
| 6065 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 7513 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 2045 | The Classic Problem | data structures graphs shortest paths | Statement | E | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2900 | |
| 2739 | Information Graph | dfs and similar dsu graphs trees | Statement | E | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2400 | |
| 2104 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 9434 | 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 | |
| 528 | Parcels | dp graphs | Statement | D | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | Codeforces Round #274: editorial | 2600 | |
| 3089 | Tourists | data structures dfs and similar graphs trees | Statement | E | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 3100 | |
| 7142 | Unbearable Controversy of Being | brute force combinatorics dfs and similar graphs | Statement | D | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1700 | |
| 65214 | New Year Transportation | dfs and similar graphs implementation | Statement | A | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1100 | |
| 9758 | New Year Permutation | dfs and similar dsu graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1600 | |
| 3318 | New Year Santa Network | combinatorics dfs and similar graphs trees | Statement | D | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1900 | |
| 15458 | Mr. Kitayuta's Colorful Graph | dfs and similar dp dsu graphs | Statement | B | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1500 | |
| 2626 | Mr. Kitayuta's Colorful Graph | brute force dfs and similar dsu graphs | Statement | D | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2300 | |
| 3355 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 4568 | Tanya and Password | dfs and similar graphs | Statement | D | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2900 | |
| 23850 | Fox And Names | dfs and similar graphs sortings | Statement | C | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 1800 | |
| 65995 | 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 | |
| 1339 | Cycling City | dfs and similar graphs | Statement | E | Codeforces Round 295 (Div. 1) {521} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2800 | |
| 19474 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 2327 | Arthur and Walls | constructive algorithms data structures graphs greedy shortest paths | Statement | D | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2300 | |
| 2307 | Data Center Drama | dfs and similar graphs | Statement | E | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2600 | |
| 2736 | Work Group | dfs and similar dp graphs strings trees | Statement | B | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 2000 | ||
| 1304 | Idempotent functions | constructive algorithms graphs math | Statement | C | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2000 | |
| 1021 | Playing on Graph | graphs shortest paths | Statement | E | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 4671 | Destroying Roads | constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 5979 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 2100 | |
| 4517 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 3370 | Mike and Fish | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2500 | |
| 1621 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2300 | |
| 3803 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1120 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 1998 | Love Triangles | dfs and similar dsu graphs | Statement | C | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 738 | Kyoya and Train | dp fft graphs math probabilities | Statement | E | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 3300 | |
| 3220 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2800 | |
| 2472 | Vitaly and Cycle | combinatorics dfs and similar graphs math | Statement | D | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2300 | |
| 1260 | Ann and Half-Palindrome | data structures dp graphs string suffix structures strings trees | Statement | E | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2700 | |
| 4244 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 4374 | Clique in the Divisibility Graph | dp math number theory | Statement | F | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1600 | |
| 2427 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2600 | |
| 9529 | 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 | |
| 2170 | Pig and Palindromes | combinatorics dp | Statement | E | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2600 | |
| 761 | CNF 2 | constructive algorithms dfs and similar graphs greedy | Statement | C | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2600 | |
| 8454 | Bear and Three Musketeers | brute force dfs and similar graphs hashing | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2) {574} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1500 | |
| 1298 | Bribes | dfs and similar graphs trees | Statement | B | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2300 | |
| 4989 | A Problem about Polyline | geometry math | Statement | A | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1700 | |
| 59445 | Kefa and Park | dfs and similar graphs trees | Statement | C | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 3848 | Phillip and Trains | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 3735 | Three States | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2200 | |
| 3055 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 2200 | |
| 1479 | Happy Tree Party | data structures dfs and similar graphs math trees | Statement | D | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2300 | ||
| 458 | Wilbur and Strings | dfs and similar dp graphs strings | Statement | E | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 2900 | |
| 13971 | Igor In the Museum | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 1700 | |
| 1240 | Edge coloring of bipartite graph | graphs | Statement | F | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2900 | |
| 14315 | The Two Routes | graphs shortest paths | Statement | A | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 1600 | |
| 3902 | Lazy Student | constructive algorithms data structures graphs | Statement | B | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | Codeforces Round #335 Problem Analysis | 1800 | |
| 11081 | Minimum spanning tree for each edge | data structures dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 876 | New Year and Forgotten Tree | constructive algorithms flows graphs | Statement | H | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 3000 | |
| 2152 | Square Root of Permutation | combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 2200 | |
| 4403 | Kingdom and its Cities | dfs and similar divide and conquer dp graphs sortings trees | Statement | D | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2800 | |
| 5858 | Longtail Hedgehog | dp graphs | Statement | B | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 1600 | |
| 4865 | Graph and String | constructive algorithms graphs | Statement | A | AIM Tech Round (Div. 1) {623} | PROGRAMMING | 1800 | ||
| 1042 | Preorder Test | binary search dfs and similar dp graphs greedy trees | Statement | D | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 2600 | |
| 839 | Orchestra | two pointers | Statement | E | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 3000 | |
| 271 | Island Puzzle | dfs and similar dsu graphs trees | Statement | F | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 3400 | |
| 1349 | Magic Matrix | brute force divide and conquer graphs matrices trees | Statement | F | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2400 | |
| 1461 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2500 |