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 |
|---|---|---|---|---|---|---|---|---|---|
| 4089 | Exposition | binary search data structures dsu trees two pointers | Statement | E | Codeforces Beta Round 6 (Div. 2 Only) {6} | PROGRAMMING | Beta Round #6 - Разбор задач | 1900 | |
| 604 | Two Friends | binary search geometry | Statement | D | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2600 | |
| 4697 | How many trees? | combinatorics divide and conquer dp | Statement | D | Codeforces Beta Round 9 (Div. 2 Only) {9} | PROGRAMMING | Codeforces Beta Round #9 tutorial | 2000 | |
| 503 | Forward, march! | binary search dp greedy | Statement | E | Codeforces Beta Round 11 {11} | PROGRAMMING | 2800 | ||
| 5557 | Monitor | binary search number theory | Statement | C | Codeforces Beta Round 16 (Div. 2 Only) {16} | PROGRAMMING | Codeforces Beta Round #16 Tutorial | 1800 | |
| 2658 | Stripe 2 | binary search dp sortings | Statement | C | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2300 | ||
| 1092 | Berland collider | binary search | Statement | E | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 2300 | |
| 744 | Don't fear, DravDe is kind | binary search data structures dp hashing | Statement | D | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2600 | |
| 981 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Tutorial for problem A | 2700 | |
| 755 | Bombing | binary search dp probabilities | Statement | D | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2100 | |
| 3013 | Three Base Stations | binary search greedy | Statement | C | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1800 | |
| 1594 | Blog Photo | binary search implementation | Statement | B | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1900 | |
| 2946 | Domino Principle | binary search data structures sortings | Statement | E | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 1424 | Tyndex.Brome | binary search implementation | Statement | B | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 1700 | |
| 898 | Harry Potter and the Golden Snitch | binary search geometry | Statement | C | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2100 | |
| 1815 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 5826 | Energy exchange | binary search | Statement | B | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 1700 | |
| 665 | Lucky Tickets | binary search data structures sortings two pointers | Statement | C | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2200 | |
| 582 | Need For Brake | binary search greedy sortings | Statement | B | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2000 | |
| 16635 | Modified GCD | binary search number theory | Statement | C | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2), my solutions | 1600 | |
| 870 | Tourist | binary search data structures dp | Statement | F | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2400 | |
| 427 | Archer's Shot | binary search geometry math two pointers | Statement | D | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2400 | |
| 1916 | Doctor | binary search math sortings | Statement | B | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 1900 | ||
| 1883 | Biathlon | binary search implementation | Statement | C | Codeforces Beta Round 72 (Div. 2 Only) {84} | PROGRAMMING | 1700 | ||
| 2570 | Sum of Medians | binary search brute force data structures implementation | Statement | D | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 646 | Petya and Tree | binary search dfs and similar probabilities sortings trees | Statement | C | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 1164 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 8038 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 12660 | Restoring Password | implementation strings | Statement | A | Codeforces Beta Round 76 (Div. 2 Only) {94} | PROGRAMMING | Analysis Beta Round #76 (Div. 2-A,B,C) | 1000 | |
| 19931 | Lucky Numbers (easy) | binary search bitmasks brute force | Statement | B | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1400 | |
| 371 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 3249 | Buses | binary search data structures dp | Statement | B | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 1900 | |
| 4193 | Petya and Divisors | binary search data structures number theory | Statement | B | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 1900 | |
| 365 | Lucky Segments | binary search implementation two pointers | Statement | D | Codeforces Beta Round 91 (Div. 1 Only) {121} | PROGRAMMING | Tutorial | 2400 | |
| 1689 | MST Company | binary search graphs | Statement | E | Codeforces Testing Round 2 {125} | PROGRAMMING | 2400 | ||
| 26547 | Password | binary search dp hashing string suffix structures strings | Statement | B | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1800 | |
| 1621 | Hot Bath | binary search brute force math | Statement | A | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1900 | |
| 827 | Present to Mom | binary search two pointers | Statement | F | Codeforces Beta Round 95 (Div. 2) {131} | PROGRAMMING | Some ideas for Round #95 (Div 2) | 2200 | |
| 984 | Mushroom Gnomes - 2 | binary search data structures probabilities sortings | Statement | C | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2500 | |
| 4807 | New Year Snowmen | binary search data structures greedy | Statement | C | Codeforces Round 100 {140} | PROGRAMMING | Codeforces Round #100: problem analysis | 1800 | |
| 1019 | Smile House | binary search graphs matrices | Statement | B | Codeforces Testing Round 4 {147} | PROGRAMMING | 2300 | ||
| 1149 | Freezing with Style | binary search data structures divide and conquer trees | Statement | E | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 3000 | |
| 7517 | Steps | binary search implementation | Statement | B | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 1400 | |
| 3239 | String Manipulation 1.0 | *special binary search brute force data structures strings | Statement | C | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
| 774 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2400 | |
| 5613 | Dress'em in Vests! | binary search brute force greedy two pointers | Statement | A | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1300 | |
| 1204 | Lemmings | binary search | Statement | B | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2100 | |
| 396 | Minimum Diameter | binary search brute force | Statement | D | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2900 | |
| 24213 | Burning Midnight Oil | binary search implementation | Statement | B | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1500 | |
| 14165 | Another Problem on Strings | binary search brute force dp math strings two pointers | Statement | C | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1600 | |
| 21587 | Rank List | binary search implementation sortings | Statement | A | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1200 | |
| 724 | Space Voyage | binary search | Statement | E1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1700 | ||
| 506 | Space Voyage | binary search | Statement | E2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1900 | ||
| 2170 | Cubes | binary search dp two pointers | Statement | E | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1700 | ||
| 3607 | Number of Triplets | binary search brute force | Statement | B | Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) {181} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1300 | |
| 268 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2900 | |
| 992 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 11737 | Funky Numbers | binary search brute force implementation | Statement | A | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | tutorial | 1300 | |
| 10373 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1100 | |
| 595 | Gripping Story | binary search data structures sortings | Statement | E | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2400 | |
| 454 | Delivering Carcinogen | binary search geometry | Statement | C | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2500 | |
| 1068 | Programming Language | binary search brute force expression parsing implementation | Statement | D | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 1800 | |
| 550 | Thoroughly Bureaucratic Organization | binary search combinatorics | Statement | E | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2600 | ||
| 20296 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 6823 | Little Elephant and Interval | binary search combinatorics dp | Statement | A | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 6019 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 9869 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 689 | Cutting a Fence | binary search data structures dsu | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 1510 | Spider's Web | binary search sortings two pointers | Statement | D | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 1800 | |
| 2357 | Olympiad | binary search greedy sortings two pointers | Statement | D | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 1800 | |
| 3431 | Well-known Numbers | binary search greedy number theory | Statement | B | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1600 | ||
| 6076 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1900 | |
| 101488 | T-primes | binary search implementation math number theory | Statement | B | Codeforces Round 142 (Div. 2) {230} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1300 | |
| 9947 | To Add or Not to Add | binary search sortings two pointers | Statement | C | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 1700 | |
| 2881 | Cycles | binary search constructive algorithms graphs greedy | Statement | A | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 1800 | |
| 585 | Fence | binary search data structures string suffix structures | Statement | D | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 8411 | Non-square Equation | binary search brute force math | Statement | B | Codeforces Round 144 (Div. 2) {233} | PROGRAMMING | Editorial for Codeforces Round #144 | 1500 | |
| 6908 | Primes on Interval | binary search number theory two pointers | Statement | C | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 1600 | |
| 1058 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 1004 | Log Stream Analysis | binary search brute force implementation strings | Statement | F | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 2000 | |
| 4899 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 2300 | |
| 914 | Robo-Footballer | binary search geometry | Statement | C | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 1900 | |
| 551 | Sweets for Everyone! | binary search greedy implementation | Statement | D | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2400 | |
| 22198 | Points on Line | binary search combinatorics two pointers | Statement | A | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 1400 | |
| 12570 | Physics Practical | binary search dp sortings two pointers | Statement | B | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1400 | |
| 616 | Printer | binary search data structures implementation sortings | Statement | E | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 2300 | |
| 2225 | Mr. Bender and Square | binary search implementation math | Statement | D | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1900 | |
| 2035 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 551 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2600 | |
| 15934 | Prime Matrix | binary search brute force math number theory | Statement | B | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1400 | |
| 10918 | k-Multiple Free Set | binary search greedy sortings | Statement | A | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 1600 | |
| 79865 | Books | binary search brute force implementation two pointers | Statement | B | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 1400 | |
| 12082 | Pipeline | binary search math | Statement | B | Codeforces Round 176 (Div. 2) {287} | PROGRAMMING | Разбор задач | 1700 | |
| 1146 | Empire Strikes Back | binary search math number theory | Statement | E | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2400 | |
| 2895 | Yaroslav and Time | binary search graphs shortest paths | Statement | B | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2000 | |
| 9582 | Eugeny and Play List | binary search implementation two pointers | Statement | B | Codeforces Round 182 (Div. 2) {302} | PROGRAMMING | Codeforces Round #182 tutorial | 1200 | |
| 1514 | Memory for Arrays | binary search bitmasks greedy | Statement | C | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 1900 | |
| 562 | Morning run | binary search math two pointers | Statement | A | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2000 | |
| 303 | Sheep | binary search greedy | Statement | E | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2900 | |
| 1656 | Sereja and Periods | binary search dfs and similar strings | Statement | B | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2000 | |
| 625 | Sereja and Straight Lines | binary search data structures geometry sortings two pointers | Statement | D | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2400 | |
| 3940 | Ciel and Robot | binary search implementation math | Statement | A | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 1700 | |
| 1682 | Stadium and Games | binary search math | Statement | B | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1800 | |
| 2283 | Characteristics of Rectangles | binary search bitmasks brute force implementation sortings | Statement | D | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2100 | |
| 1314 | Summer Earnings | binary search bitmasks brute force geometry sortings | Statement | E | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2400 | |
| 2897 | Banana | binary search constructive algorithms greedy | Statement | A | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1500 | |
| 5292 | Quiz | binary search greedy math matrices number theory | Statement | C | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1700 | |
| 8065 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 3273 | Read Time | binary search greedy two pointers | Statement | C | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 15084 | Mafia | binary search math sortings | Statement | A | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 328 | Looking for Owls | binary search data structures geometry hashing sortings | Statement | D | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2600 | |
| 5956 | Pair of Numbers | binary search brute force data structures math two pointers | Statement | D | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2100 | |
| 3761 | Levko and Array | binary search dp | Statement | B | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2300 | |
| 4466 | Renting Bikes | binary search greedy | Statement | D | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1800 | |
| 1780 | Dima and Trap Graph | binary search data structures dfs and similar dsu shortest paths two pointers | Statement | D | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 2400 | |
| 2751 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 2972 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 37341 | Hamburgers | binary search brute force | Statement | C | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1600 | |
| 16082 | Counting Kangaroos is Fun | binary search greedy sortings two pointers | Statement | A | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 1700 | |
| 1205 | Choosing Subtree is Fun | binary search data structures dfs and similar trees two pointers | Statement | D | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2600 | |
| 2831 | Making Sequences is Fun | binary search implementation math | Statement | B | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1600 | |
| 1043 | Inna and Sequence | binary search data structures dp trees | Statement | D | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2300 | |
| 248 | Inna and Babies | binary search data structures dsu geometry implementation | Statement | E | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2600 | |
| 2619 | Preparing for the Contest | binary search data structures greedy sortings | Statement | B | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2100 | |
| 2959 | Sereja and Prefixes | binary search brute force | Statement | A | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 1700 | |
| 1532 | Number Busters | binary search math | Statement | B | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2000 | |
| 820 | Volcanoes | binary search implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2200 | |
| 10903 | Bear and Prime Numbers | binary search brute force data structures dp implementation math number theory | Statement | C | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1800 | |
| 2568 | Fly, freebies, fly! | binary search brute force implementation | Statement | B | Testing Round 9 {386} | PROGRAMMING | 1500 | ||
| 1027 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2500 | |
| 1079 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 666 | Maze 1D | binary search greedy implementation | Statement | E | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2700 | |
| 784 | Mashmokh and Water Tanks | binary search data structures greedy trees two pointers | Statement | D | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2300 | |
| 6753 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 8852 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1600 | |
| 732 | Bug in Code | binary search data structures sortings | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2100 | |
| 8545 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 640 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2200 | |
| 1680 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 3000 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 1240 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 546 | Furukawa Nagisa's Tree | binary search divide and conquer sortings trees | Statement | E | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | Codeforces Round #248 Editorial | 3000 | |
| 7318 | Devu and his Brother | binary search sortings ternary search two pointers | Statement | D | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1900 | |
| 909 | DZY Loves Strings | binary search hashing strings two pointers | Statement | D | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 921 | DZY Loves Planting | binary search dsu trees | Statement | E | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2600 | |
| 17434 | Multiplication Table | binary search brute force | Statement | D | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 6956 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 754 | Appleman and a Game | binary search shortest paths strings | Statement | E | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 3000 | |
| 43487 | Number of Ways | binary search brute force data structures dp two pointers | Statement | C | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1700 | |
| 2844 | Hack it! | binary search constructive algorithms math | Statement | C | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2800 | |
| 3762 | MUH and House of Cards | binary search brute force greedy math | Statement | C | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1700 | |
| 67378 | Worms | binary search implementation | Statement | B | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1300 | |
| 4488 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 5046 | Long Jumps | binary search greedy implementation | Statement | D | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1800 | |
| 4470 | Friends and Presents | binary search math | Statement | B | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1800 | |
| 7898 | Maximum Value | binary search math sortings two pointers | Statement | B | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2100 | |
| 3306 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2700 | |
| 3988 | Fight the Monster | binary search brute force implementation | Statement | A | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 1900 | |
| 4470 | Strip | binary search data structures dp two pointers | Statement | B | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2300 | |
| 1214 | Hiking | binary search dp | Statement | E | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 2700 | |
| 1730 | Restoring Increasing Sequence | binary search brute force greedy implementation | Statement | E | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2100 | |
| 94227 | Vanya and Lanterns | binary search implementation math sortings | Statement | B | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1200 | |
| 3340 | Vanya and Computer Game | binary search implementation math sortings | Statement | D | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1800 | |
| 7620 | Vasya and Basketball | binary search brute force data structures implementation sortings two pointers | Statement | C | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 3219 | Tennis Game | binary search | Statement | D | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 2100 | |
| 989 | Misha and Palindrome Degree | binary search combinatorics implementation | Statement | E | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 2800 | |
| 1113 | Misha and LCP on Tree | binary search dfs and similar hashing string suffix structures trees | Statement | E | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 3000 | |
| 1663 | Mr. Kitayuta vs. Bamboos | binary search greedy | Statement | E | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2800 | |
| 8618 | Watto and Mechanism | binary search data structures hashing string suffix structures strings | Statement | C | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1900 | |
| 5738 | R2D2 and Droid Army | binary search data structures two pointers | Statement | D | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 2100 | |
| 445 | Pasha and Pipe | binary search brute force combinatorics dp implementation | Statement | F | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 2800 | |
| 9125 | A and B and Lecture Rooms | binary search data structures dfs and similar dp trees | Statement | E | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | 2300 | ||
| 2203 | The Art of Dealing with ATM | binary search sortings | Statement | C | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 1800 | ||
| 4459 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 7698 | Glass Carving | binary search data structures implementation | Statement | C | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1800 | |
| 682 | Berland Miners | binary search data structures dfs and similar greedy trees | Statement | A | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 2587 | Handshakes | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2000 | ||
| 4014 | Tavas and Karafs | binary search greedy math | Statement | C | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1900 | |
| 6179 | Tourist's Notes | binary search brute force greedy implementation math | Statement | C | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1600 | |
| 2618 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 11839 | Mike and Feet | binary search data structures dp dsu | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 2136 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 4112 | GukiZ hates Boxes | binary search greedy | Statement | C | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2200 | |
| 2273 | GukiZ and GukiZiana | binary search data structures implementation | Statement | E | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2600 | |
| 2298 | Kyoya and Permutation | binary search combinatorics constructive algorithms greedy implementation math | Statement | B | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2200 | |
| 1120 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 967 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 10619 | Geometric Progression | binary search data structures dp | Statement | C | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1700 | |
| 5381 | One-Dimensional Battle Ships | binary search data structures greedy sortings | Statement | D | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1800 | |
| 9565 | 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 | |
| 1241 | Campus | binary search data structures dsu trees | Statement | D | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3000 | |
| 6469 | Bear and Blocks | binary search data structures dp math | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1800 | |
| 1618 | Painting Edges | binary search data structures | Statement | E | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 3200 | |
| 33664 | Kefa and Company | binary search sortings two pointers | Statement | B | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 1030 | Duff in Mafia | 2-sat binary search | Statement | D | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2900 | |
| 2074 | Chip 'n Dale Rescue Rangers | binary search geometry math | Statement | B | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2100 | |
| 287 | BCPC | binary search geometry two pointers | Statement | E | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 2800 | |
| 605 | Max and Bike | binary search geometry | Statement | B | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 2400 | |
| 3147 | Pasha and Phone | binary search math | Statement | B | Codeforces Round 330 (Div. 2) {595} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 1600 | |
| 41850 | Queries about less or equal elements | binary search data structures sortings two pointers | Statement | B | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 1300 | |
| 9084 | More Cowbell | binary search greedy | Statement | B | Codeforces Round 334 (Div. 2) {604} | PROGRAMMING | 21885 | 1400 | |
| 11192 | Chain Reaction | binary search dp | Statement | A | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | Codeforces Round #336 Editorial | 1600 | |
| 369 | Cross Sum | binary search geometry | Statement | E | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | Codeforces Round #336 Editorial | 3300 | |
| 3280 | Gadgets for dollars and pounds | binary search greedy two pointers | Statement | D | Educational Codeforces Round 3 {609} | PROGRAMMING | 2000 | ||
| 563 | New Year and Cleaning | binary search implementation | Statement | F | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 2500 | |
| 3489 | Peter and Snow Blower | binary search geometry ternary search | Statement | A | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 1900 | |
| 2516 | Skills | binary search brute force dp greedy sortings two pointers | Statement | B | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2200 | |
| 1111 | Hexagons | binary search implementation math | Statement | E | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 2200 | |
| 13380 | Longest k-Good Segment | binary search data structures two pointers | Statement | D | Educational Codeforces Round 5 {616} | PROGRAMMING | Editorial of Educational Codeforces Round 5 | 1700 | |
| 2084 | Professor GukiZ and Two Arrays | binary search two pointers | Statement | D | Educational Codeforces Round 6 {620} | PROGRAMMING | Editorial of Educational Codeforces Round 6 | 2200 | |
| 591 | Electric Charges | binary search dp | Statement | C | AIM Tech Round (Div. 1) {623} | PROGRAMMING | 2800 | ||
| 1683 | Simple Skewness | binary search math ternary search | Statement | E | 8VC Venture Cup 2016 - Elimination Round {626} | PROGRAMMING | 23522 | 2400 | |
| 1043 | 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 | |
| 660 | Startup Funding | binary search constructive algorithms data structures probabilities two pointers | Statement | E | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2400 | |
| 25009 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 1028 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 4514 | Enduring Exodus | binary search two pointers | Statement | C | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1600 | |
| 3505 | Robot Rapping Results Report | binary search dp graphs | Statement | D | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1800 | |
| 195 | Armistice Area Apportionment | binary search geometry | Statement | G | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 2600 | |
| 187 | Автобус | binary search data structures greedy sortings | Statement | E | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2500.0 | 2100 | |
| 3525 | Image Preview | binary search brute force dp two pointers | Statement | B | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 1900 | |
| 1752 | Zip-line | binary search data structures dp hashing | Statement | D | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2600 | |
| 3182 | Delivery Bears | binary search flows graphs | Statement | D | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2100 | |
| 11170 | Hard Process | binary search dp two pointers | Statement | C | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 1600 | |
| 2540 | Bear and Bowling 4 | binary search data structures geometry ternary search | Statement | F | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 2500 | |
| 25680 | Magic Powder - 1 | binary search brute force implementation | Statement | D1 | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1400 | |
| 20997 | Magic Powder - 2 | binary search implementation | Statement | D2 | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1500 | |
| 3424 | Robin Hood | binary search greedy | Statement | B | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 2000 | |
| 4346 | Дерево | data structures trees | Statement | D | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 1800 | |
| 23920 | Vasya and String | binary search dp strings two pointers | Statement | C | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 1500 | |
| 815 | Vanya and Balloons | binary search brute force dp implementation | Statement | E | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 2600 | |
| 2363 | Bear and Tower of Cubes | binary search dp greedy | Statement | B | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2300 | |
| 711 | Optimal Point | binary search math | Statement | C | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2800 | |
| 6359 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1700 | |
| 4417 | Friends and Subsequences | binary search data structures | Statement | D | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2200 | |
| 164 | ...Dary! | binary search geometry two pointers | Statement | F | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 3200 | |
| 3376 | As Fast As Possible | binary search math | Statement | A | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 1900 | |
| 21238 | They Are Everywhere | binary search strings two pointers | Statement | C | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 1500 | |
| 24977 | Cellular Network | binary search implementation two pointers | Statement | C | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1500 | |
| 91207 | Interesting drink | binary search dp implementation | Statement | B | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 13467 | Vasiliy's Multiset | binary search bitmasks data structures trees | Statement | D | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1800 | |
| 1539 | Searching Rectangles | binary search constructive algorithms interactive | Statement | B | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2200 | |
| 1456 | Animals and Puzzle | binary search data structures | Statement | D | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2700 | |
| 424 | Sonya Partymaker | binary search dp | Statement | E | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 3100 | |
| 3914 | Complete The Graph | binary search constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 2200 | |
| 388 | Road to Home | binary search dp | Statement | E | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 2800 | |
| 3386 | Generating Sets | binary search data structures dfs and similar greedy strings trees | Statement | D | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1900 | |
| 1153 | Polycarp's problems | binary search dp greedy | Statement | F | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 2300 | |
| 4212 | Road to Cinema | binary search greedy sortings | Statement | C | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 1415 | Bulmart | binary search dfs and similar | Statement | C | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2200 |