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 7 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 959 | Two Permutations | data structures hashing strings | Statement | E | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2600 | |
| 42800 | System of Equations | brute force | Statement | A | Codeforces Round 131 (Div. 2) {214} | PROGRAMMING | Codeforces Round #131 Tutorial | 1000 | |
| 5347 | Hometask | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 131 (Div. 2) {214} | PROGRAMMING | Codeforces Round #131 Tutorial | 1600 | |
| 16140 | Bicycle Chain | brute force implementation | Statement | A | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 1000 | |
| 5966 | Olympic Medal | greedy math | Statement | B | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 1300 | |
| 1689 | Hot Days | greedy | Statement | D | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 1800 | |
| 719 | Crosses | brute force implementation | Statement | C | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 2100 | |
| 672 | Periodical Numbers | combinatorics dp number theory | Statement | E | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 2600 | |
| 5266 | Tiling with Hexagons | implementation math | Statement | A | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 1300 | |
| 7013 | Forming Teams | dfs and similar implementation | Statement | B | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 1700 | |
| 1496 | Spider's Web | binary search sortings two pointers | Statement | D | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 1800 | |
| 1926 | Hiring Staff | greedy | Statement | C | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 1800 | |
| 667 | Martian Luck | math number theory | Statement | E | Codeforces Round 133 (Div. 2) {216} | PROGRAMMING | Editorial for Codeforces Round #133 | 2300 | |
| 24230 | Ice Skating | brute force dfs and similar dsu graphs | Statement | A | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 1400 | |
| 1091 | Blackboard Fibonacci | brute force math | Statement | B | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2200 | |
| 367 | Formurosa | divide and conquer dp expression parsing | Statement | C | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2500 | |
| 353 | Alien DNA | data structures dsu trees | Statement | E | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2700 | |
| 273 | Bitonix' Patrol | bitmasks brute force combinatorics dfs and similar math | Statement | D | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2800 | |
| 10516 | Mountain Scenery | brute force constructive algorithms implementation | Statement | A | Codeforces Round 134 (Div. 2) {218} | PROGRAMMING | Editorial for Codeforces Round #134 | 1100 | |
| 18343 | Airport | implementation | Statement | B | Codeforces Round 134 (Div. 2) {218} | PROGRAMMING | Editorial for Codeforces Round #134 | 1100 | |
| 32249 | k-String | implementation strings | Statement | A | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1100 | |
| 6148 | Special Offer! Super Price 999 Bourles! | implementation | Statement | B | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1500 | |
| 7147 | Color Stripe | brute force dp greedy | Statement | C | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1600 | |
| 12426 | Choosing Capital for Treeland | dfs and similar dp graphs trees | Statement | D | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1900 | |
| 696 | Parking Lot | data structures | Statement | E | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 2500 | |
| 13060 | Little Elephant and Problem | implementation sortings | Statement | A | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 1400 | |
| 12828 | Little Elephant and Array | constructive algorithms data structures | Statement | B | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 1900 | |
| 1036 | Little Elephant and Shifts | data structures | Statement | C | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 2300 | |
| 1714 | Little Elephant and Inversions | data structures two pointers | Statement | E | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 2400 | |
| 313 | Little Elephant and Triangle | geometry math | Statement | D | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 2500 | |
| 16785 | Little Elephant and Function | implementation math | Statement | A | Codeforces Round 136 (Div. 2) {221} | PROGRAMMING | Codeforces Round #136 — Editorial | 1000 | |
| 4906 | Little Elephant and Numbers | implementation | Statement | B | Codeforces Round 136 (Div. 2) {221} | PROGRAMMING | Codeforces Round #136 — Editorial | 1300 | |
| 11744 | Shooshuns and Sequence | brute force implementation | Statement | A | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач | 1200 | |
| 6555 | Cosmic Tables | data structures implementation | Statement | B | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач | 1300 | |
| 2340 | Olympiad | binary search greedy sortings two pointers | Statement | D | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 1800 | |
| 2916 | Reducing Fractions | implementation math number theory sortings | Statement | C | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 2000 | |
| 3540 | Decoding Genome | dp matrices | Statement | E | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 2000 | |
| 2805 | Bracket Sequence | data structures expression parsing implementation | Statement | A | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 1800 | ||
| 2030 | Two Strings | data structures dp strings | Statement | B | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 2000 | ||
| 1754 | Partial Sums | combinatorics math number theory | Statement | C | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | Tutorial | 2200 | |
| 80 | Spider | geometry graphs | Statement | D | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 3000 | ||
| 208 | Planar Graph | flows geometry graphs | Statement | E | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | Tutorial | 3000 | |
| 30237 | Parallelepiped | brute force geometry math | Statement | A | Codeforces Round 138 (Div. 2) {224} | PROGRAMMING | 1100 | ||
| 7898 | Array | bitmasks implementation two pointers | Statement | B | Codeforces Round 138 (Div. 2) {224} | PROGRAMMING | Tutorial | 1500 | |
| 14130 | Dice Tower | constructive algorithms greedy | Statement | A | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 1200 | |
| 3392 | Well-known Numbers | binary search greedy number theory | Statement | B | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1600 | ||
| 10149 | Barcode | dp matrices | Statement | C | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1800 | ||
| 901 | Unsolvable | math number theory | Statement | E | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2100 | |
| 1049 | Snake | bitmasks dfs and similar graphs implementation | Statement | D | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2300 | |
| 4348 | Flying Saucer Segments | math | Statement | A | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 1500 | |
| 1707 | Naughty Stone Piles | greedy | Statement | B | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2000 | |
| 1125 | The table | constructive algorithms greedy | Statement | D | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2100 | |
| 1015 | Anniversary | data structures implementation math matrices number theory | Statement | C | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2100 | |
| 546 | Noble Knight's Path | data structures trees | Statement | E | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2900 | |
| 32366 | Effective Approach | implementation | Statement | B | Codeforces Round 140 (Div. 2) {227} | PROGRAMMING | 1100 | ||
| 4576 | Where do I Turn? | geometry | Statement | A | Codeforces Round 140 (Div. 2) {227} | PROGRAMMING | Editorial (eng) | 1400 | |
| 3635 | Two Tables | brute force implementation | Statement | B | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 1400 | |
| 2812 | The Road to Berland is Paved With Good Intentions | 2-sat dfs and similar dsu graphs | Statement | E | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2000 | |
| 539 | Fractal Detector | dp hashing | Statement | C | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2200 | |
| 438 | Zigzag | data structures | Statement | D | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2300 | |
| 139234 | Is your horseshoe on the other hoof? | implementation | Statement | A | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 800 | |
| 3752 | Shifts | brute force two pointers | Statement | A | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1600 | |
| 5777 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1900 | |
| 2613 | Towers | dp greedy two pointers | Statement | D | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2000 | |
| 1781 | Triangles | combinatorics graphs math | Statement | C | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2100 | |
| 525 | Gifts | combinatorics dp math probabilities | Statement | E | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2500 | |
| 97028 | Dragons | greedy sortings | Statement | A | Codeforces Round 142 (Div. 2) {230} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1000 | |
| 95281 | T-primes | binary search implementation math number theory | Statement | B | Codeforces Round 142 (Div. 2) {230} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1300 | |
| 3913 | Magic, Wizardry and Wonders | constructive algorithms greedy | Statement | B | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 1600 | |
| 4330 | Magic Box | brute force geometry | Statement | D | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 1600 | |
| 9676 | 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 | |
| 2314 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 428176 | Team | brute force greedy | Statement | A | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 800 | |
| 2828 | Cycles | binary search constructive algorithms graphs greedy | Statement | A | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 1800 | |
| 1654 | Table | bitmasks combinatorics dp math | Statement | B | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2200 | |
| 523 | Fence | binary search data structures string suffix structures | Statement | D | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 309 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 882 | Quick Tortoise | bitmasks divide and conquer dp | Statement | E | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2900 | |
| 8271 | Non-square Equation | binary search brute force math | Statement | B | Codeforces Round 144 (Div. 2) {233} | PROGRAMMING | Editorial for Codeforces Round #144 | 1500 | |
| 49034 | Perfect Permutation | implementation math | Statement | A | Codeforces Round 144 (Div. 2) {233} | PROGRAMMING | Editorial for Codeforces Round #144 | 800 | |
| 7690 | Reading | sortings | Statement | B | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1000 | ||
| 4667 | Lefthanders and Righthanders | implementation | Statement | A | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1200 | ||
| 5944 | Weather | dp implementation | Statement | C | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1300 | ||
| 1048 | Champions' League | implementation | Statement | E | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1600 | ||
| 1601 | Cinema | implementation | Statement | D | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1700 | ||
| 1576 | Practice | constructive algorithms divide and conquer implementation | Statement | G | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1800 | ||
| 1969 | Fence | dp | Statement | F | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1900 | ||
| 619 | Merging Two Decks | constructive algorithms greedy | Statement | H | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 2100 | ||
| 20916 | LCM Challenge | number theory | Statement | A | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 1600 | |
| 4288 | Let's Play Osu! | dp math probabilities | Statement | B | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2100 | |
| 886 | Number Challenge | combinatorics dp implementation math number theory | Statement | E | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2600 | |
| 2458 | Cyclical Quest | data structures string suffix structures strings | Statement | C | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2700 | |
| 572 | Graph Game | graphs | Statement | D | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 3000 | |
| 16895 | Easy Number Challenge | implementation number theory | Statement | B | Codeforces Round 146 (Div. 2) {236} | PROGRAMMING | Codeforces Round #146 Tutorial | 1300 | |
| 277339 | Boy or Girl | brute force implementation strings | Statement | A | Codeforces Round 146 (Div. 2) {236} | PROGRAMMING | Codeforces Round #146 Tutorial | 800 | |
| 29490 | Free Cash | implementation | Statement | A | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 1200 | |
| 2375 | Young Table | implementation sortings | Statement | B | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 1500 | |
| 6638 | Primes on Interval | binary search number theory two pointers | Statement | C | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 1600 | |
| 1998 | Build String | flows graphs | Statement | E | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2100 | |
| 618 | T-decomposition | dfs and similar graphs greedy trees | Statement | D | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2200 | |
| 2175 | Not Wool Sequences | constructive algorithms math | Statement | A | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 1700 | |
| 1419 | Boring Partition | constructive algorithms | Statement | B | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2100 | |
| 1364 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 268 | Tape Programming | data structures implementation | Statement | D | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 496 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 20589 | Two Bags of Potatoes | greedy implementation math | Statement | A | Codeforces Round 148 (Div. 2) {239} | PROGRAMMING | Editorial for Codeforces Round #148 | 1200 | |
| 1473 | Easy Tape Programming | brute force implementation | Statement | B | Codeforces Round 148 (Div. 2) {239} | PROGRAMMING | Editorial for Codeforces Round #148 | 1500 | |
| 2255 | TorCoder | data structures | Statement | F | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2600 | ||
| 428 | Road Repairs | dfs and similar graphs greedy | Statement | E | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2800 | ||
| 2408 | Old Peykan | greedy | Statement | A | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 1300 | ||
| 564 | Challenging Balloons | constructive algorithms | Statement | G | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 1900 | ||
| 533 | Mirror Box | geometry implementation | Statement | C | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2000 | ||
| 289 | Race | brute force implementation | Statement | F | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2300 | ||
| 1369 | Flights | graphs shortest paths | Statement | E | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2600 | ||
| 981 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 395 | Numbers | Statement | D | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2900 | |||
| 6790 | Heads or Tails | brute force implementation | Statement | A | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1100 | |
| 17329 | Big Segment | implementation sortings | Statement | B | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1100 | |
| 10871 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1800 | |
| 11788 | XOR on Segment | bitmasks data structures | Statement | E | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 2000 | |
| 2029 | Dispute | dfs and similar graphs greedy | Statement | D | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 2100 | |
| 4453 | The Brand New Function | bitmasks | Statement | A | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 1900 | |
| 1327 | Hydra | graphs sortings | Statement | B | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2100 | |
| 563 | Colorado Potato Beetle | dfs and similar implementation | Statement | C | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2400 | |
| 232 | Cubes | data structures dp geometry two pointers | Statement | D | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2700 | |
| 216 | Matrix | data structures | Statement | E | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2900 | |
| 8539 | Dividing Orange | implementation | Statement | A | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1000 | |
| 4925 | Undoubtedly Lucky Numbers | bitmasks brute force dfs and similar | Statement | B | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1600 | |
| 5518 | Internet Address | implementation strings | Statement | B | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1100 | |
| 3530 | Mishap in Club | greedy implementation | Statement | E | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1400 | |
| 2860 | Restoring Table | constructive algorithms greedy | Statement | D | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | CROC-MBTU 2012, Elimination Round — Editorial | 1500 | |
| 1686 | Game with Coins | greedy | Statement | C | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1700 | |
| 9006 | Queries for Number of Palindromes | dp hashing strings | Statement | H | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1900 | |
| 976 | Log Stream Analysis | binary search brute force implementation strings | Statement | F | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 2000 | |
| 545 | Suggested Friends | brute force graphs | Statement | G | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | CROC-MBTU 2012, Elimination Round — Editorial | 2200 | |
| 9126 | System Administrator | implementation | Statement | A | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | CROC-MBTU 2012, Elimination Round — Editorial | 700 | |
| 10218 | Buggy Sorting | constructive algorithms greedy sortings | Statement | A | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1000 | |
| 12253 | Increase and Decrease | greedy math | Statement | B | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1300 | |
| 2824 | Beauty Pageant | brute force constructive algorithms greedy | Statement | C | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1600 | |
| 10273 | Colorful Graph | brute force dfs and similar graphs | Statement | D | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1700 | |
| 4482 | 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 | |
| 5800 | Chilly Willy | math number theory | Statement | B | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 1400 | |
| 901 | Robo-Footballer | binary search geometry | Statement | C | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 1900 | |
| 529 | Sweets for Everyone! | binary search greedy implementation | Statement | D | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2400 | |
| 641 | Piglet's Birthday | dp math probabilities | Statement | E | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2700 | |
| 25019 | Cupboards | implementation | Statement | A | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 900 | |
| 356 | Endless Matrix | math | Statement | E | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2500 | |
| 509 | Donkey and Stars | data structures dp geometry math sortings | Statement | D | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2600 | |
| 4789 | Paper Work | greedy | Statement | A | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 1100 | |
| 2235 | Restoring IPv6 | implementation strings | Statement | B | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 1500 | |
| 2229 | Movie Critics | greedy | Statement | C | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 1600 | |
| 1009 | Building Bridge | geometry ternary search two pointers | Statement | D | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 2000 | |
| 502 | Mad Joe | brute force | Statement | E | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 2400 | |
| 21136 | Points on Line | binary search combinatorics two pointers | Statement | A | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 1400 | |
| 1377 | Playing with Permutations | implementation math | Statement | B | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 1900 | |
| 582 | Two Sets | bitmasks math | Statement | D | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 1125 | Number Transformation | dp greedy number theory | Statement | C | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 205 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 5844 | Little Xor | brute force implementation | Statement | A | Codeforces Round 153 (Div. 2) {252} | PROGRAMMING | Editorial of Codeforces Round #153 | 1200 | |
| 1872 | Unsorting Array | brute force sortings | Statement | B | Codeforces Round 153 (Div. 2) {252} | PROGRAMMING | Editorial of Codeforces Round #153 | 1700 | |
| 12140 | Boys and Girls | greedy | Statement | A | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1200 | |
| 12242 | Physics Practical | binary search dp sortings two pointers | Statement | B | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1400 | |
| 2902 | Text Editor | data structures dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1600 | |
| 922 | Table with Letters - 2 | brute force two pointers | Statement | D | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 2000 | |
| 583 | Printer | binary search data structures implementation sortings | Statement | E | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 2300 | |
| 7720 | Cards with Numbers | constructive algorithms sortings | Statement | A | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 1300 | |
| 2267 | Jury Size | brute force implementation | Statement | B | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 1500 | |
| 1602 | Anagram | greedy strings | Statement | C | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 1800 | |
| 722 | Dormitory | dp implementation | Statement | E | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 2400 | |
| 645 | Rats | brute force dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 2600 | |
| 5453 | Code Parsing | implementation | Statement | B | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1200 | |
| 5036 | Almost Arithmetical Progression | brute force dp | Statement | C | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1700 | |
| 2175 | Mr. Bender and Square | binary search implementation math | Statement | D | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1900 | |
| 977 | Furlo and Rublo and Game | games implementation math | Statement | E | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 2200 | |
| 31153 | Greg's Workout | implementation | Statement | A | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 800 | |
| 712 | Lucky Arrays | data structures | Statement | E | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | Codeforces Round #156 tutorial | 2400 | |
| 279 | Liars and Serge | dp | Statement | D | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | qwer | 2700 | |
| 6907 | Sockets | greedy implementation sortings | Statement | A | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1200 | |
| 7753 | Playing Cubes | games greedy implementation | Statement | B | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1400 | |
| 4706 | View Angle | brute force geometry math | Statement | C | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1700 | |
| 1716 | Sum | greedy math | Statement | D | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1900 | |
| 345 | Greedy Elevator | data structures implementation | Statement | E | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 2500 | |
| 26437 | Little Elephant and Bits | greedy math | Statement | A | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 1200 | |
| 1602 | Little Elephant and Elections | brute force combinatorics dp | Statement | B | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2100 | |
| 1316 | Little Elephant and Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 1959 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 1417 | Little Elephant and Broken Sorting | dp math probabilities | Statement | D | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2600 | |
| 14691 | Little Elephant and Magic Square | brute force implementation | Statement | B | Codeforces Round 157 (Div. 2) {259} | PROGRAMMING | Codeforces Round #157 — Editorial | 1100 | |
| 10023 | Little Elephant and Chess | brute force strings | Statement | A | Codeforces Round 157 (Div. 2) {259} | PROGRAMMING | Codeforces Round #157 — Editorial | 1100 | |
| 16559 | Adding Digits | implementation math | Statement | A | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 1400 | |
| 4075 | Ancient Prophesy | brute force implementation strings | Statement | B | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 1600 | |
| 3227 | Balls and Boxes | constructive algorithms greedy implementation | Statement | C | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 1700 | |
| 1664 | Black and White Tree | constructive algorithms dsu graphs greedy trees | Statement | D | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2200 | |
| 505 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2600 | |
| 5605 | Maxim and Discounts | greedy sortings | Statement | A | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 1400 | |
| 1603 | Maxim and Restaurant | dp math probabilities | Statement | B | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2100 | |
| 835 | Maxim and Matrix | constructive algorithms dp math | Statement | C | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2300 | |
| 708 | Maxim and Increasing Subsequence | dp | Statement | D | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2500 | |
| 438 | Maxim and Calculator | brute force dp two pointers | Statement | E | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2800 | |
| 12301 | Roma and Changing Signs | greedy | Statement | B | Codeforces Round 160 (Div. 2) {262} | PROGRAMMING | Codeforces Round #160 tutorial | 1300 | |
| 22408 | Roma and Lucky Numbers | implementation | Statement | A | Codeforces Round 160 (Div. 2) {262} | PROGRAMMING | Codeforces Round #160 tutorial | 800 | |
| 9765 | Squares | greedy implementation sortings | Statement | B | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 1000 | |
| 4472 | Cycle in Graph | dfs and similar graphs | Statement | D | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 1800 | |
| 1134 | Circle of Numbers | brute force dfs and similar implementation | Statement | C | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 2000 | |
| 443 | Rhombus | brute force data structures dp | Statement | E | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 2600 | |
| 315692 | Beautiful Matrix | implementation | Statement | A | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 700 | |
| 11799 | Escape from Stones | constructive algorithms data structures implementation two pointers | Statement | A | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1400 | |
| 11994 | Good Sequences | dp number theory | Statement | B | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1700 | |
| 3272 | Choosing Balls | dp | Statement | C | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 2200 | |
| 451 | Colorful Stones | dp two pointers | Statement | D | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial for E | 2400 | |
| 469 | Roadside Trees | data structures dp | Statement | E | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 2900 | |
| 17920 | Roadside Trees (Simplified Edition) | greedy implementation | Statement | B | Codeforces Round 162 (Div. 2) {265} | PROGRAMMING | Codeforces Round #162 Tutorial | 1000 | |
| 42560 | Colorful Stones (Simplified Edition) | implementation | Statement | A | Codeforces Round 162 (Div. 2) {265} | PROGRAMMING | Codeforces Round #162 Tutorial | 800 | |
| 1429 | Below the Diagonal | constructive algorithms greedy math | Statement | C | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2000 | |
| 1055 | More Queries to Array... | data structures math | Statement | E | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 984 | BerDonalds | graphs math shortest paths | Statement | D | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 242275 | Stones on the Table | implementation | Statement | A | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 800 | |
| 165303 | Queue at the School | constructive algorithms graph matchings implementation shortest paths | Statement | B | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 900 | |
| 9510 | Subtractions | math number theory | Statement | A | Codeforces Testing Round 5 {267} | PROGRAMMING | 1100 | ||
| 753 | Dominoes | dfs and similar graphs | Statement | B | Codeforces Testing Round 5 {267} | PROGRAMMING | 1900 | ||
| 253 | Berland Traffic | math matrices | Statement | C | Codeforces Testing Round 5 {267} | PROGRAMMING | 2300 | ||
| 35735 | Buttons | implementation math | Statement | B | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Разбор задач | 1000 | |
| 14630 | Beautiful Sets of Points | constructive algorithms implementation | Statement | C | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Разбор задач | 1500 | |
| 1136 | Playlist | math probabilities sortings | Statement | E | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Problems Analysis | 2100 | |
| 576 | Wall Bars | dp | Statement | D | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Problems Analysis | 2600 | |
| 103862 | Games | brute force | Statement | A | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Problems Analysis | 800 | |
| 3695 | Magical Boxes | greedy math | Statement | A | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Tutorial | 1700 | |
| 6978 | Greenhouse Effect | dp | Statement | B | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2000 | |
| 493 | Maximum Waterfall | data structures dp graphs sortings | Statement | D | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 1814 | Flawed Flow | constructive algorithms flows graphs greedy | Statement | C | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 118 | String Theory | Statement | E | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 3100 | ||
| 50714 | Fancy Fence | geometry implementation math | Statement | A | Codeforces Round 165 (Div. 2) {270} | PROGRAMMING | Разбор Codeforces Round #165 | 1200 | |
| 4439 | Multithreading | data structures greedy implementation | Statement | B | Codeforces Round 165 (Div. 2) {270} | PROGRAMMING | Разбор Codeforces Round #165 | 1400 | |
| 15391 | Prime Matrix | binary search brute force math number theory | Statement | B | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1400 | |
| 3131 | Secret | constructive algorithms implementation | Statement | C | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1500 | |
| 13934 | Good Substrings | data structures strings | Statement | D | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1800 | |
| 598 | Three Horses | constructive algorithms math number theory | Statement | E | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | 6662 | 2500 | |
| 176987 | Beautiful Year | brute force | Statement | A | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 900 | |
| 27600 | Dima and Friends | implementation math | Statement | A | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 1000 | |
| 4285 | Dima and Sequence | implementation math | Statement | B | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 1400 | |
| 7190 | Dima and Staircase | data structures implementation | Statement | C | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 1500 | |
| 2831 | Dima and Two Sequences | combinatorics math sortings | Statement | D | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 1800 | |
| 1296 | Dima and Horses | combinatorics constructive algorithms graphs | Statement | E | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 2300 | |
| 477 | Dima and Figure | dp | Statement | D | Codeforces Round 167 (Div. 1) {273} | PROGRAMMING | Tutorial | 2400 | |
| 397 | Dima and Game | dp games | Statement | E | Codeforces Round 167 (Div. 1) {273} | PROGRAMMING | Tutorial | 2600 | |
| 10801 | k-Multiple Free Set | binary search greedy sortings | Statement | A | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 1600 | |
| 5563 | Zero Tree | dfs and similar dp greedy trees | Statement | B | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2000 | |
| 1152 | Lovely Matrix | dfs and similar graphs greedy sortings | Statement | D | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2100 | |
| 373 | The Last Hole! | brute force geometry | Statement | C | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2600 | |
| 341 | Mirror Room | data structures implementation | Statement | E | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 3000 |