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 6 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 15512 | Unlucky Ticket | greedy sortings | Statement | B | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 1200 | |
| 3715 | Find Pair | implementation math sortings | Statement | C | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 1700 | |
| 681 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2400 | |
| 3337 | Edges in MST | dfs and similar dsu graphs sortings | Statement | D | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2500 | |
| 5463 | 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 | |
| 2084 | Discounts | constructive algorithms greedy sortings | Statement | B | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1700 | |
| 19042 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 505 | Polycarpus the Safecracker | brute force dp | Statement | E | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
| 691 | Abracadabra | divide and conquer | Statement | C | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
| 842 | Pentagonal numbers | *special implementation | Statement | A | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1400 | |
| 326 | Binary notation | *special | Statement | B | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1800 | |
| 232 | Remove digits | *special | Statement | D | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1900 | |
| 185 | HQ9+ | *special | Statement | E | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2000 | |
| 229 | Factorial zeros | *special | Statement | F | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2100 | |
| 1249 | Prime factorization | *special | Statement | C | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2200 | |
| 226 | Alternating case | *special | Statement | H | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2300 | |
| 103 | Brackets | *special | Statement | J | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2400 | |
| 96 | Truncatable primes | *special | Statement | I | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
| 88 | Non-decimal sum | *special | Statement | G | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
| 2989 | Substring and Subsequence | dp | Statement | A | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1900 | |
| 1174 | Lemmings | binary search | Statement | B | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2100 | |
| 609 | Conveyor | sortings two pointers | Statement | C | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2200 | |
| 571 | Large Refrigerator | brute force | Statement | D | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 2164 | e-Government | data structures dfs and similar dp strings trees | Statement | E | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 1190 | 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 | |
| 527 | Ancient Berland Hieroglyphs | two pointers | Statement | B | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2300 | |
| 978 | Machine Programming | flows graphs | Statement | C | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2400 | |
| 275 | Minimum Diameter | binary search brute force | Statement | D | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2900 | |
| 73 | Polycarpus and Tasks | Statement | E | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 3100 | ||
| 26230 | Supercentral Point | implementation | Statement | A | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1100 | |
| 22726 | Burning Midnight Oil | binary search implementation | Statement | B | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1500 | |
| 13783 | 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 | |
| 9316 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
| 1926 | Beard Graph | data structures dsu trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2200 | |
| 20931 | Rank List | binary search implementation sortings | Statement | A | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1200 | |
| 25468 | Tetrahedron | dp math matrices | Statement | E | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
| 7415 | Median | greedy math sortings | Statement | C | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
| 3017 | Polygons | geometry sortings | Statement | B | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2000 | |
| 388 | Shoe Store | dp graph matchings greedy sortings two pointers | Statement | D | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2400 | |
| 2179 | Wizards and Trolleybuses | implementation | Statement | A | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1600 | |
| 2443 | Wizards and Huge Prize | dp math probabilities | Statement | B | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2000 | |
| 738 | Wizards and Numbers | games math | Statement | C | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2400 | |
| 217 | 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 | |
| 666 | Wizards and Bets | dfs and similar graphs math matrices | Statement | E | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 11486 | Wizards and Demonstration | implementation math | Statement | A | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1000 | |
| 1300 | Wizards and Minimal Spell | implementation strings | Statement | B | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1700 | |
| 3716 | Replacing Digits | greedy | Statement | B | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1200 | |
| 8157 | Chores | sortings | Statement | A | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 900 | |
| 5054 | Mysterious numbers - 1 | *special constructive algorithms | Statement | A | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1200 | |
| 4743 | Star | *special combinatorics | Statement | B | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1300 | |
| 2809 | Broken checker | *special brute force | Statement | D | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1400 | |
| 1481 | ucyhf | *special brute force implementation number theory | Statement | F | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1700 | |
| 1061 | Mysterious numbers - 2 | *special | Statement | G | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1595 | MYSTERIOUS LANGUAGE | *special | Statement | E | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1218 | A Piece of Cake | *special implementation | Statement | C | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2100 | |
| 334 | A polyline | *special implementation | Statement | H | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2200 | |
| 7498 | Phone Code | *special brute force implementation | Statement | A | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1600 | ||
| 3144 | Pseudorandom Sequence Period | *special implementation number theory | Statement | B | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1800 | ||
| 1509 | Calendar Reform | *special number theory | Statement | D | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 1257 | Bus | *special implementation sortings | Statement | C | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 282 | BHTML+BCSS | *special dfs and similar expression parsing | Statement | E | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 2500 | ||
| 2505 | Rock-Paper-Scissors | implementation math | Statement | A | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1300 | |
| 1109 | Spiral Maximum | brute force dp | Statement | C | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 3976 | Chamber of Secrets | dfs and similar shortest paths | Statement | B | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 288 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2400 | |
| 647 | Camping Groups | data structures sortings | Statement | E | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2600 | |
| 3314 | Problem About Equation | math | Statement | A | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1200 | |
| 2511 | File List | dp greedy implementation | Statement | B | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1500 | |
| 1256 | Range Increments | data structures greedy | Statement | C | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1800 | |
| 2537 | Robot Bicorn Attack | brute force implementation | Statement | A | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial F | 1400 | |
| 1558 | Plane of Tanks: Pro | implementation | Statement | B | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 1400 | |
| 1513 | Geometry Horse | greedy implementation sortings two pointers | Statement | C | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 1600 | |
| 317 | Plane of Tanks: Duel | brute force dp math probabilities | Statement | D | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2400 | |
| 288 | Power Defence | brute force dp geometry greedy | Statement | E | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2500 | |
| 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 | |
| 1797 | Trading Business | greedy sortings | Statement | A | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1500 | |
| 2377 | Word Cut | dp | Statement | B | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1900 | |
| 528 | Playing with Superglue | combinatorics constructive algorithms | Statement | C | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 2000 | |
| 380 | Hyper String | dp | Statement | D | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 2500 | |
| 1511 | Archaeology | data structures dfs and similar trees | Statement | E | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 3000 | |
| 5094 | Rectangular Game | number theory | Statement | B1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1000 | ||
| 3348 | Rectangular Game | number theory | Statement | B2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 2712 | Encrypting Messages | brute force | Statement | D1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 3000 | Party | brute force dfs and similar dsu graphs | Statement | C2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 2987 | Party | dfs and similar dsu graphs | Statement | C1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 2668 | Encrypting Messages | data structures | Statement | D2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 710 | Space Voyage | binary search | Statement | E1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1700 | ||
| 366 | Script Generation | Statement | F1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1800 | |||
| 501 | Space Voyage | binary search | Statement | E2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1900 | ||
| 240 | Script Generation | Statement | F2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | |||
| 225 | Fibonacci Strings | strings | Statement | G1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | ||
| 241 | Fibonacci Strings | matrices strings | Statement | G2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2400 | ||
| 8547 | Good Matrix Elements | implementation | Statement | A2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 11473 | Good Matrix Elements | implementation | Statement | A1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 1852 | Educational Game | greedy | Statement | A2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1000 | |
| 1830 | Educational Game | Statement | A1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1000 | ||
| 1597 | Educational Game | greedy | Statement | A3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1200 | |
| 734 | Magic Squares | Statement | D1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1500 | ||
| 585 | Smart Beaver and Resolving Collisions | Statement | C1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1600 | ||
| 864 | Greedy Merchants | Statement | B1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1600 | ||
| 768 | Greedy Merchants | Statement | B2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1700 | ||
| 1518 | Greedy Merchants | Statement | B3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1900 | ||
| 357 | Smart Beaver and Resolving Collisions | Statement | C3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2000 | ||
| 338 | Smart Beaver and Resolving Collisions | Statement | C2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2000 | ||
| 312 | The Beaver's Problem - 2 | Statement | E1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2100 | ||
| 456 | Representative Sampling | Statement | F1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2100 | ||
| 241 | The Beaver's Problem - 2 | Statement | E2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 271 | Magic Squares | Statement | D3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 325 | Magic Squares | Statement | D2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 214 | The Beaver's Problem - 2 | Statement | E3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | ||
| 382 | Representative Sampling | dp sortings strings | Statement | F2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | |
| 483 | Representative Sampling | Statement | F3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2600 | ||
| 2830 | Mathematical Analysis Rocks! | constructive algorithms implementation math | Statement | F | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1300 | ||
| 8551 | Letter | dp | Statement | C | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1400 | ||
| 2065 | Cubes | binary search dp two pointers | Statement | E | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1700 | ||
| 594 | Defragmentation | implementation | Statement | A | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1800 | ||
| 810 | Name | greedy strings | Statement | D | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2000 | ||
| 464 | Divisibility Rules | math number theory | Statement | B | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2300 | ||
| 3510 | 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 | |
| 8757 | Series of Crimes | brute force geometry implementation | Statement | A | Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) {181} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 800 | |
| 7352 | Vasya's Calendar | implementation | Statement | B | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1000 | |
| 9228 | Common Divisors | brute force hashing implementation math strings | Statement | D | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1400 | |
| 1662 | Wooden Fence | dp | Statement | E | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1800 | |
| 819 | Optimal Sum | data structures greedy | Statement | C | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 348 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 846 | Zoo | brute force geometry | Statement | B | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 1700 | |
| 662 | Headquarters | constructive algorithms math | Statement | A | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 1900 | |
| 724 | Cyclic Coloring | dfs and similar | Statement | C | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2200 | |
| 186 | Candy Shop | greedy | Statement | E | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2700 | |
| 480 | T-shirt | dp greedy probabilities | Statement | D | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2800 | |
| 6511 | Plant | math | Statement | A | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 1300 | |
| 1782 | Mushroom Scientists | math ternary search | Statement | B | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 1900 | |
| 149 | Clever Fat Rat | dp | Statement | C | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2300 | |
| 501 | Visit of the Great | math number theory | Statement | D | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2600 | |
| 173 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2900 | |
| 6152 | Growing Mushrooms | greedy sortings | Statement | B | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 18424 | Comparing Strings | implementation strings | Statement | A | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 3038 | Permutations | greedy | Statement | A | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 1600 | ||
| 2326 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 1900 | |
| 1573 | Weak Memory | dfs and similar dsu | Statement | C | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2100 | |
| 583 | BRT Contract | data structures | Statement | D | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2700 | |
| 117 | Heaven Tour | data structures greedy | Statement | E | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2800 | |
| 847 | Hexagonal Numbers | *special | Statement | A | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1200 | |
| 499 | LCM | *special implementation math | Statement | C | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 750 | Asterisks | *special implementation | Statement | D | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 783 | A + Reverse B | *special implementation | Statement | B | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 556 | HQ9+ | *special implementation | Statement | E | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1500 | |
| 345 | Binary Notation | *special implementation | Statement | F | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1600 | |
| 346 | Array Sorting | *special implementation | Statement | G | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1700 | |
| 602 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 | |
| 80418 | Cut Ribbon | brute force dp | Statement | A | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1300 | |
| 4208 | Counting Rhombi | brute force math | Statement | B | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1400 | |
| 6242 | Vasya and the Bus | greedy math | Statement | A | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1300 | |
| 3086 | Surrounded | geometry | Statement | B | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1600 | |
| 3174 | STL | dfs and similar | Statement | C | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1700 | |
| 2656 | Non-Secret Cypher | two pointers | Statement | D | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1900 | |
| 1729 | Counter Attack | data structures dsu graphs hashing sortings | Statement | E | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 2300 | |
| 4542 | Dynasty Puzzles | dp | Statement | A | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 1600 | |
| 1098 | Demonstration | greedy | Statement | B | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 1800 | |
| 9158 | Fools and Roads | data structures dfs and similar trees | Statement | C | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2100 | |
| 956 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 392 | Metro Scheme | graphs greedy | Statement | D | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2800 | |
| 6787 | Walking in the Rain | brute force implementation | Statement | B | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | 1100 | ||
| 11550 | Funky Numbers | binary search brute force implementation | Statement | A | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | tutorial | 1300 | |
| 4670 | Cutting Figure | constructive algorithms graphs trees | Statement | A | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 1700 | |
| 1138 | Xor | brute force | Statement | B | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2100 | |
| 603 | Hamming Distance | constructive algorithms greedy math matrices | Statement | C | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2400 | |
| 607 | Two Segments | data structures | Statement | D | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2800 | |
| 403 | Fibonacci Number | brute force math matrices | Statement | E | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2900 | |
| 10901 | Exams | implementation math | Statement | A | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1000 | |
| 3972 | Square | math | Statement | B | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1300 | |
| 10118 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1100 | |
| 5506 | After Training | data structures implementation math | Statement | B | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1300 | |
| 1236 | Try and Catch | expression parsing implementation | Statement | C | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1700 | |
| 1134 | Analyzing Polyline | geometry math sortings | Statement | D | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1900 | |
| 856 | Building Forest | data structures dsu graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 2200 | |
| 5837 | Lexicographically Maximum Subsequence | greedy strings | Statement | A | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1200 | |
| 2373 | Infinite Maze | dfs and similar graphs | Statement | B | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1900 | |
| 1039 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 1202 | Opening Portals | dsu graphs shortest paths | Statement | E | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2500 | |
| 599 | The Next Good String | data structures greedy hashing strings | Statement | D | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2600 | |
| 4915 | Limit | math | Statement | B | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1400 | |
| 6834 | Plate Game | constructive algorithms games math | Statement | A | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1600 | |
| 5148 | Jumping on Walls | shortest paths | Statement | B | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 1700 | |
| 3326 | About Bacteria | implementation math | Statement | A | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 1700 | |
| 550 | Gripping Story | binary search data structures sortings | Statement | E | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2400 | |
| 427 | Delivering Carcinogen | binary search geometry | Statement | C | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2500 | |
| 116 | Cube Snake | constructive algorithms | Statement | D | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2700 | |
| 30225 | Hexadecimal's theorem | brute force constructive algorithms implementation number theory | Statement | A | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | Solutions for Codeforces Round #125 | 1000 | |
| 875 | Special Olympics | geometry | Statement | B | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | Solutions for Codeforces Round #125 | 1900 | |
| 1106 | Football Championship | brute force implementation | Statement | C | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 1700 | |
| 1050 | 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 | |
| 364 | Tractor College | implementation math number theory ternary search | Statement | E | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 2200 | |
| 732 | Cinema | brute force data structures | Statement | A | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 2600 | |
| 147652 | Drinks | implementation math | Statement | B | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 700 | |
| 3238 | Clear Symmetry | constructive algorithms dp math | Statement | A | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | Разбор задач | 1700 | |
| 1387 | Guess That Car! | math ternary search | Statement | B | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2000 | ||
| 1510 | Fragile Bridges | dp | Statement | C | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2200 | ||
| 452 | Brand New Problem | bitmasks brute force dp | Statement | D | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2500 | ||
| 483 | Thoroughly Bureaucratic Organization | binary search combinatorics | Statement | E | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2600 | ||
| 854 | Brand New Easy Problem | brute force | Statement | B | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 1700 | ||
| 19686 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 4417 | Two Problems | brute force implementation | Statement | A | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1200 | ||
| 6057 | Photographer | greedy sortings | Statement | C | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 2784 | Game on Paper | brute force implementation | Statement | B | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 1507 | Hit Ball | geometry implementation math | Statement | D | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1700 | ||
| 309 | Transportation | greedy sortings two pointers | Statement | E | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 2400 | ||
| 6572 | Little Elephant and Interval | binary search combinatorics dp | Statement | A | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 5876 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 1232 | Little Elephant and Furik and Rubik | math probabilities | Statement | C | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2200 | |
| 635 | Little Elephant and Retro Strings | dp | Statement | D | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2400 | |
| 1419 | Little Elephant and Strings | data structures implementation string suffix structures two pointers | Statement | E | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2800 | |
| 25174 | Little Elephant and Rozdil | brute force implementation | Statement | A | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1000 | |
| 6473 | Little Elephant and Sorting | brute force greedy | Statement | B | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1400 | |
| 369 | Beaver's Calculator 1.0 | greedy | Statement | A1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1600 | ||
| 353 | Military Trainings | Statement | B1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1700 | |||
| 304 | Beaver's Calculator 1.0 | greedy | Statement | A2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1800 | ||
| 124 | The Beaver's Problem - 3 | Statement | D1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 238 | Military Trainings | Statement | B2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 117 | The Beaver's Problem - 3 | Statement | D2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | |||
| 276 | Beaver's Calculator 1.0 | greedy | Statement | A3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | ||
| 147 | The Beaver's Problem - 3 | Statement | D3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2100 | |||
| 173 | The Beaver's Problem - 3 | Statement | D4 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 213 | Military Trainings | Statement | B3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 100 | The Beaver's Problem - 3 | Statement | D8 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 88 | The Beaver's Problem - 3 | Statement | D6 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 156 | The Beaver's Problem - 3 | Statement | D5 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 98 | The Beaver's Problem - 3 | Statement | D9 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 111 | The Beaver's Problem - 3 | Statement | D7 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 132 | Game with Two Trees | Statement | C1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 104 | Game with Two Trees | Statement | C2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2500 | |||
| 86 | The Beaver's Problem - 3 | Statement | D10 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | |||
| 163 | Game with Two Trees | data structures | Statement | C3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | ||
| 104654 | Dubstep | strings | Statement | A | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1100 | |
| 8028 | Prizes, Prizes, more Prizes | implementation | Statement | D | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1200 | |
| 1490 | Solitaire | dfs and similar dp | Statement | B | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1800 | |
| 2144 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 8832 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 2836 | Multicolored Marbles | dp math | Statement | A | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 1700 | ||
| 486 | Pixels | constructive algorithms math | Statement | B | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2200 | ||
| 874 | Trails and Glades | constructive algorithms dsu graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
| 2188 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 483 | Cowboys | combinatorics dp math | Statement | C | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2200 | ||
| 366 | Polycarpus is Looking for Good Substrings | bitmasks hashing implementation | Statement | B | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2300 | ||
| 613 | Cutting a Fence | binary search data structures dsu | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 222 | Privatization | flows graphs | Statement | A | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2700 | ||
| 1877 | Game | dfs and similar greedy | Statement | A | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 1800 | |
| 3244 | Relay Race | dp | Statement | C | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2100 | |
| 362 | Stars | constructive algorithms geometry | Statement | D | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 | |
| 1977 | Numbers | combinatorics dp | Statement | B | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 |