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 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 15815 | Unlucky Ticket | greedy sortings | Statement | B | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 1200 | |
| 3774 | Find Pair | implementation math sortings | Statement | C | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 1700 | |
| 762 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2400 | |
| 3611 | Edges in MST | dfs and similar dsu graphs sortings | Statement | D | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2500 | |
| 5577 | 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 | |
| 2101 | Discounts | constructive algorithms greedy sortings | Statement | B | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1700 | |
| 20459 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 543 | Polycarpus the Safecracker | brute force dp | Statement | E | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
| 715 | Abracadabra | divide and conquer | Statement | C | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
| 847 | Pentagonal numbers | *special implementation | Statement | A | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1400 | |
| 328 | Binary notation | *special | Statement | B | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1800 | |
| 234 | Remove digits | *special | Statement | D | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1900 | |
| 187 | HQ9+ | *special | Statement | E | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2000 | |
| 233 | Factorial zeros | *special | Statement | F | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2100 | |
| 1420 | Prime factorization | *special | Statement | C | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2200 | |
| 227 | Alternating case | *special | Statement | H | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2300 | |
| 135 | Brackets | *special | Statement | J | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2400 | |
| 97 | Truncatable primes | *special | Statement | I | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
| 90 | Non-decimal sum | *special | Statement | G | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
| 3045 | Substring and Subsequence | dp | Statement | A | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1900 | |
| 1202 | Lemmings | binary search | Statement | B | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2100 | |
| 644 | Conveyor | sortings two pointers | Statement | C | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2200 | |
| 590 | Large Refrigerator | brute force | Statement | D | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 2355 | 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 | |
| 1233 | 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 | |
| 557 | Ancient Berland Hieroglyphs | two pointers | Statement | B | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2300 | |
| 1052 | Machine Programming | flows graphs | Statement | C | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2400 | |
| 396 | Minimum Diameter | binary search brute force | Statement | D | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2900 | |
| 137 | Polycarpus and Tasks | Statement | E | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 3100 | ||
| 26675 | Supercentral Point | implementation | Statement | A | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1100 | |
| 23968 | Burning Midnight Oil | binary search implementation | Statement | B | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1500 | |
| 14113 | 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 | |
| 10204 | 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 | |
| 1986 | Beard Graph | data structures dsu trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2200 | |
| 21520 | Rank List | binary search implementation sortings | Statement | A | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1200 | |
| 26689 | Tetrahedron | dp math matrices | Statement | E | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
| 7640 | Median | greedy math sortings | Statement | C | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
| 3341 | Polygons | geometry sortings | Statement | B | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2000 | |
| 419 | 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 | |
| 2209 | Wizards and Trolleybuses | implementation | Statement | A | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1600 | |
| 2573 | Wizards and Huge Prize | dp math probabilities | Statement | B | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2000 | |
| 776 | Wizards and Numbers | games math | Statement | C | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 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 | |
| 737 | Wizards and Bets | dfs and similar graphs math matrices | Statement | E | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 11652 | Wizards and Demonstration | implementation math | Statement | A | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1000 | |
| 1319 | Wizards and Minimal Spell | implementation strings | Statement | B | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1700 | |
| 3772 | Replacing Digits | greedy | Statement | B | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1200 | |
| 8381 | Chores | sortings | Statement | A | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 900 | |
| 5142 | Mysterious numbers - 1 | *special constructive algorithms | Statement | A | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1200 | |
| 4899 | Star | *special combinatorics | Statement | B | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1300 | |
| 2837 | Broken checker | *special brute force | Statement | D | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1400 | |
| 1494 | ucyhf | *special brute force implementation number theory | Statement | F | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1700 | |
| 1071 | Mysterious numbers - 2 | *special | Statement | G | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1621 | MYSTERIOUS LANGUAGE | *special | Statement | E | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1244 | A Piece of Cake | *special implementation | Statement | C | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2100 | |
| 341 | A polyline | *special implementation | Statement | H | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2200 | |
| 8285 | Phone Code | *special brute force implementation | Statement | A | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1600 | ||
| 3190 | Pseudorandom Sequence Period | *special implementation number theory | Statement | B | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1800 | ||
| 1540 | Calendar Reform | *special number theory | Statement | D | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 1264 | Bus | *special implementation sortings | Statement | C | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 316 | BHTML+BCSS | *special dfs and similar expression parsing | Statement | E | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 2500 | ||
| 2562 | Rock-Paper-Scissors | implementation math | Statement | A | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1300 | |
| 1122 | Spiral Maximum | brute force dp | Statement | C | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 4201 | Chamber of Secrets | dfs and similar shortest paths | Statement | B | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 319 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2400 | |
| 769 | Camping Groups | data structures sortings | Statement | E | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2600 | |
| 3379 | Problem About Equation | math | Statement | A | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1200 | |
| 2547 | File List | dp greedy implementation | Statement | B | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1500 | |
| 1279 | Range Increments | data structures greedy | Statement | C | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1800 | |
| 2597 | Robot Bicorn Attack | brute force implementation | Statement | A | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial F | 1400 | |
| 1602 | Plane of Tanks: Pro | implementation | Statement | B | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 1400 | |
| 1542 | Geometry Horse | greedy implementation sortings two pointers | Statement | C | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 1600 | |
| 346 | Plane of Tanks: Duel | brute force dp math probabilities | Statement | D | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2400 | |
| 306 | Power Defence | brute force dp geometry greedy | Statement | E | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2500 | |
| 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 | |
| 1861 | Trading Business | greedy sortings | Statement | A | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1500 | |
| 2457 | Word Cut | dp | Statement | B | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1900 | |
| 547 | Playing with Superglue | combinatorics constructive algorithms | Statement | C | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 2000 | |
| 416 | Hyper String | dp | Statement | D | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 2500 | |
| 1716 | Archaeology | data structures dfs and similar trees | Statement | E | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 3000 | |
| 5194 | Rectangular Game | number theory | Statement | B1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1000 | ||
| 3437 | Rectangular Game | number theory | Statement | B2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 2801 | Encrypting Messages | brute force | Statement | D1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 3100 | Party | brute force dfs and similar dsu graphs | Statement | C2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 3071 | Party | dfs and similar dsu graphs | Statement | C1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 2823 | Encrypting Messages | data structures | Statement | D2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 718 | Space Voyage | binary search | Statement | E1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1700 | ||
| 368 | Script Generation | Statement | F1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1800 | |||
| 505 | Space Voyage | binary search | Statement | E2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1900 | ||
| 244 | Script Generation | Statement | F2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | |||
| 250 | Fibonacci Strings | strings | Statement | G1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | ||
| 281 | Fibonacci Strings | matrices strings | Statement | G2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2400 | ||
| 8718 | Good Matrix Elements | implementation | Statement | A2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 11693 | Good Matrix Elements | implementation | Statement | A1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 1894 | Educational Game | greedy | Statement | A2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1000 | |
| 1868 | Educational Game | Statement | A1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1000 | ||
| 1681 | Educational Game | greedy | Statement | A3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1200 | |
| 745 | Magic Squares | Statement | D1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1500 | ||
| 590 | Smart Beaver and Resolving Collisions | Statement | C1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1600 | ||
| 887 | Greedy Merchants | Statement | B1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1600 | ||
| 793 | Greedy Merchants | Statement | B2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1700 | ||
| 1614 | Greedy Merchants | Statement | B3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1900 | ||
| 360 | Smart Beaver and Resolving Collisions | Statement | C3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2000 | ||
| 343 | Smart Beaver and Resolving Collisions | Statement | C2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2000 | ||
| 319 | The Beaver's Problem - 2 | Statement | E1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2100 | ||
| 465 | Representative Sampling | Statement | F1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2100 | ||
| 246 | The Beaver's Problem - 2 | Statement | E2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 272 | Magic Squares | Statement | D3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 328 | Magic Squares | Statement | D2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 218 | The Beaver's Problem - 2 | Statement | E3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | ||
| 394 | Representative Sampling | dp sortings strings | Statement | F2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | |
| 657 | Representative Sampling | Statement | F3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2600 | ||
| 2886 | Mathematical Analysis Rocks! | constructive algorithms implementation math | Statement | F | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1300 | ||
| 8716 | Letter | dp | Statement | C | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1400 | ||
| 2149 | Cubes | binary search dp two pointers | Statement | E | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1700 | ||
| 603 | Defragmentation | implementation | Statement | A | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1800 | ||
| 822 | Name | greedy strings | Statement | D | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2000 | ||
| 489 | Divisibility Rules | math number theory | Statement | B | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2300 | ||
| 3592 | 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 | |
| 9020 | 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 | |
| 7427 | Vasya's Calendar | implementation | Statement | B | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1000 | |
| 9427 | Common Divisors | brute force hashing implementation math strings | Statement | D | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1400 | |
| 1709 | Wooden Fence | dp | Statement | E | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1800 | |
| 904 | Optimal Sum | data structures greedy | Statement | C | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 369 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 863 | Zoo | brute force geometry | Statement | B | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 1700 | |
| 674 | Headquarters | constructive algorithms math | Statement | A | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 1900 | |
| 770 | Cyclic Coloring | dfs and similar | Statement | C | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2200 | |
| 236 | Candy Shop | greedy | Statement | E | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2700 | |
| 520 | T-shirt | dp greedy probabilities | Statement | D | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2800 | |
| 6653 | Plant | math | Statement | A | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 1300 | |
| 1805 | Mushroom Scientists | math ternary search | Statement | B | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 1900 | |
| 151 | Clever Fat Rat | dp | Statement | C | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2300 | |
| 547 | Visit of the Great | math number theory | Statement | D | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2600 | |
| 268 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2900 | |
| 6253 | Growing Mushrooms | greedy sortings | Statement | B | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 18750 | Comparing Strings | implementation strings | Statement | A | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 3074 | Permutations | greedy | Statement | A | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 1600 | ||
| 2395 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 1900 | |
| 1641 | Weak Memory | dfs and similar dsu | Statement | C | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2100 | |
| 629 | BRT Contract | data structures | Statement | D | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2700 | |
| 123 | Heaven Tour | data structures greedy | Statement | E | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2800 | |
| 864 | Hexagonal Numbers | *special | Statement | A | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1200 | |
| 531 | LCM | *special implementation math | Statement | C | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 759 | Asterisks | *special implementation | Statement | D | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 813 | A + Reverse B | *special implementation | Statement | B | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 559 | HQ9+ | *special implementation | Statement | E | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1500 | |
| 350 | Binary Notation | *special implementation | Statement | F | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1600 | |
| 365 | Array Sorting | *special implementation | Statement | G | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1700 | |
| 718 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 | |
| 84548 | Cut Ribbon | brute force dp | Statement | A | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1300 | |
| 4256 | Counting Rhombi | brute force math | Statement | B | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1400 | |
| 6322 | Vasya and the Bus | greedy math | Statement | A | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1300 | |
| 3124 | Surrounded | geometry | Statement | B | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1600 | |
| 3279 | STL | dfs and similar | Statement | C | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1700 | |
| 2707 | Non-Secret Cypher | two pointers | Statement | D | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1900 | |
| 1826 | Counter Attack | data structures dsu graphs hashing sortings | Statement | E | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 2300 | |
| 4657 | Dynasty Puzzles | dp | Statement | A | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 1600 | |
| 1110 | Demonstration | greedy | Statement | B | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 1800 | |
| 9988 | Fools and Roads | data structures dfs and similar trees | Statement | C | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2100 | |
| 991 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 428 | Metro Scheme | graphs greedy | Statement | D | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2800 | |
| 6870 | Walking in the Rain | brute force implementation | Statement | B | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | 1100 | ||
| 11691 | Funky Numbers | binary search brute force implementation | Statement | A | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | tutorial | 1300 | |
| 4770 | Cutting Figure | constructive algorithms graphs trees | Statement | A | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 1700 | |
| 1187 | Xor | brute force | Statement | B | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2100 | |
| 709 | Hamming Distance | constructive algorithms greedy math matrices | Statement | C | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2400 | |
| 665 | Two Segments | data structures | Statement | D | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2800 | |
| 426 | Fibonacci Number | brute force math matrices | Statement | E | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2900 | |
| 11068 | Exams | implementation math | Statement | A | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1000 | |
| 4046 | Square | math | Statement | B | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1300 | |
| 10357 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1100 | |
| 5551 | After Training | data structures implementation math | Statement | B | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1300 | |
| 1263 | Try and Catch | expression parsing implementation | Statement | C | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1700 | |
| 1140 | Analyzing Polyline | geometry math sortings | Statement | D | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1900 | |
| 934 | Building Forest | data structures dsu graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 2200 | |
| 5912 | Lexicographically Maximum Subsequence | greedy strings | Statement | A | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1200 | |
| 2512 | Infinite Maze | dfs and similar graphs | Statement | B | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1900 | |
| 1072 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 1275 | Opening Portals | dsu graphs shortest paths | Statement | E | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2500 | |
| 667 | The Next Good String | data structures greedy hashing strings | Statement | D | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2600 | |
| 4961 | Limit | math | Statement | B | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1400 | |
| 6949 | Plate Game | constructive algorithms games math | Statement | A | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1600 | |
| 5438 | Jumping on Walls | shortest paths | Statement | B | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 1700 | |
| 3355 | About Bacteria | implementation math | Statement | A | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 1700 | |
| 593 | 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 | |
| 118 | Cube Snake | constructive algorithms | Statement | D | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2700 | |
| 30979 | 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 | |
| 887 | Special Olympics | geometry | Statement | B | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | Solutions for Codeforces Round #125 | 1900 | |
| 1223 | Football Championship | brute force implementation | Statement | C | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 1700 | |
| 1067 | 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 | |
| 374 | 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 | |
| 762 | Cinema | brute force data structures | Statement | A | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 2600 | |
| 154474 | Drinks | implementation math | Statement | B | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 700 | |
| 3268 | Clear Symmetry | constructive algorithms dp math | Statement | A | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | Разбор задач | 1700 | |
| 1408 | Guess That Car! | math ternary search | Statement | B | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2000 | ||
| 1568 | Fragile Bridges | dp | Statement | C | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2200 | ||
| 494 | Brand New Problem | bitmasks brute force dp | Statement | D | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2500 | ||
| 549 | Thoroughly Bureaucratic Organization | binary search combinatorics | Statement | E | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2600 | ||
| 864 | Brand New Easy Problem | brute force | Statement | B | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 1700 | ||
| 20214 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 4470 | Two Problems | brute force implementation | Statement | A | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1200 | ||
| 6107 | Photographer | greedy sortings | Statement | C | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 2826 | Game on Paper | brute force implementation | Statement | B | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 1522 | Hit Ball | geometry implementation math | Statement | D | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1700 | ||
| 337 | Transportation | greedy sortings two pointers | Statement | E | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 2400 | ||
| 6803 | Little Elephant and Interval | binary search combinatorics dp | Statement | A | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 6008 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 1311 | Little Elephant and Furik and Rubik | math probabilities | Statement | C | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2200 | |
| 674 | Little Elephant and Retro Strings | dp | Statement | D | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2400 | |
| 1730 | Little Elephant and Strings | data structures implementation string suffix structures two pointers | Statement | E | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2800 | |
| 25621 | Little Elephant and Rozdil | brute force implementation | Statement | A | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1000 | |
| 6528 | Little Elephant and Sorting | brute force greedy | Statement | B | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1400 | |
| 375 | Beaver's Calculator 1.0 | greedy | Statement | A1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1600 | ||
| 363 | Military Trainings | Statement | B1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1700 | |||
| 309 | Beaver's Calculator 1.0 | greedy | Statement | A2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1800 | ||
| 125 | The Beaver's Problem - 3 | Statement | D1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 244 | Military Trainings | Statement | B2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 118 | The Beaver's Problem - 3 | Statement | D2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | |||
| 312 | Beaver's Calculator 1.0 | greedy | Statement | A3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | ||
| 149 | The Beaver's Problem - 3 | Statement | D3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2100 | |||
| 174 | The Beaver's Problem - 3 | Statement | D4 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 224 | Military Trainings | Statement | B3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 101 | The Beaver's Problem - 3 | Statement | D8 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 90 | The Beaver's Problem - 3 | Statement | D6 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 157 | The Beaver's Problem - 3 | Statement | D5 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 99 | The Beaver's Problem - 3 | Statement | D9 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 114 | The Beaver's Problem - 3 | Statement | D7 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 138 | Game with Two Trees | Statement | C1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 106 | Game with Two Trees | Statement | C2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2500 | |||
| 87 | The Beaver's Problem - 3 | Statement | D10 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | |||
| 165 | Game with Two Trees | data structures | Statement | C3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | ||
| 108031 | Dubstep | strings | Statement | A | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1100 | |
| 8104 | Prizes, Prizes, more Prizes | implementation | Statement | D | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1200 | |
| 1537 | Solitaire | dfs and similar dp | Statement | B | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1800 | |
| 2198 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 9654 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 2933 | Multicolored Marbles | dp math | Statement | A | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 1700 | ||
| 508 | Pixels | constructive algorithms math | Statement | B | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2200 | ||
| 928 | Trails and Glades | constructive algorithms dsu graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
| 2380 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 520 | Cowboys | combinatorics dp math | Statement | C | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2200 | ||
| 407 | Polycarpus is Looking for Good Substrings | bitmasks hashing implementation | Statement | B | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2300 | ||
| 688 | Cutting a Fence | binary search data structures dsu | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 323 | Privatization | flows graphs | Statement | A | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2700 | ||
| 1947 | Game | dfs and similar greedy | Statement | A | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 1800 | |
| 3347 | Relay Race | dp | Statement | C | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2100 | |
| 383 | Stars | constructive algorithms geometry | Statement | D | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 | |
| 2004 | Numbers | combinatorics dp | Statement | B | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 |