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 ... 10 11 12 13 14 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1004 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 3786 | Amity Assessment | brute force constructive algorithms implementation | Statement | A | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1200 | |
| 3713 | Mischievous Mess Makers | greedy math | Statement | B | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1300 | |
| 4344 | Enduring Exodus | binary search two pointers | Statement | C | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1600 | |
| 3358 | Robot Rapping Results Report | binary search dp graphs | Statement | D | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1800 | |
| 1415 | Intellectual Inquiry | dp greedy strings | Statement | E | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 2100 | |
| 976 | Cowslip Collections | combinatorics math number theory | Statement | F | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 2500 | |
| 128 | Armistice Area Apportionment | binary search geometry | Statement | G | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 2600 | |
| 1372 | Путь Робота | dfs and similar graphs | Statement | C | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 1500.0 | Разбор задач Технокубок 2016 — Отборочный Раунд 1 | 1100 |
| 354 | Собачки и миски | greedy sortings | Statement | D | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 2000.0 | Разбор задач Технокубок 2016 — Отборочный Раунд 1 | 1900 |
| 159 | Собери число | Statement | E | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 2500.0 | Разбор задач Технокубок 2016 — Отборочный Раунд 1 | 2300 | |
| 2179 | Собери стол | constructive algorithms sortings | Statement | B | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 1000.0 | Разбор задач Технокубок 2016 — Отборочный Раунд 1 | 800 |
| 1138 | Наибольший подъем | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 500.0 | Разбор задач Технокубок 2016 — Отборочный Раунд 1 | 900 |
| 1684 | Любимые числа Поликарпа | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 500.0 | 1000 | |
| 641 | Этажи | constructive algorithms | Statement | B | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 1000.0 | 1400 | |
| 558 | Печать условий | greedy sortings | Statement | C | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 1500.0 | 1500 | |
| 438 | Дефрагментация памяти | constructive algorithms greedy implementation | Statement | D | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2000.0 | 1600 | |
| 158 | Автобус | binary search data structures greedy sortings | Statement | E | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2500.0 | 2100 | |
| 16687 | Watchmen | data structures geometry math | Statement | A | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 1500 | |
| 3500 | Image Preview | binary search brute force dp two pointers | Statement | B | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 1900 | |
| 2191 | Table Compression | dfs and similar dp dsu graphs greedy | Statement | C | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2300 | |
| 1602 | Zip-line | binary search data structures dp hashing | Statement | D | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2600 | |
| 682 | Clockwork Bomb | data structures dfs and similar dsu greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 3100 | |
| 24201 | Joysticks | dp greedy implementation math | Statement | A | Codeforces Round 345 (Div. 2) {651} | PROGRAMMING | 1100 | ||
| 12280 | Beautiful Paintings | greedy sortings | Statement | B | Codeforces Round 345 (Div. 2) {651} | PROGRAMMING | 1200 | ||
| 11883 | z-sort | sortings | Statement | B | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1100 | |
| 5278 | Gabriel and Caterpillar | implementation math | Statement | A | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1400 | |
| 3783 | Foe Pairs | combinatorics sortings two pointers | Statement | C | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1800 | |
| 4861 | Nested Segments | data structures sortings | Statement | D | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1900 | |
| 2899 | Pursuit For Artifacts | dfs and similar dsu graphs trees | Statement | E | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 2300 | |
| 656 | Ants on a Circle | constructive algorithms math | Statement | F | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 2800 | |
| 9243 | Bear and Three Balls | brute force implementation sortings | Statement | A | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1000 | |
| 5357 | Bear and Compressing | brute force dfs and similar dp strings | Statement | B | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1300 | |
| 1780 | Bear and Up-Down | brute force implementation | Statement | C | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1900 | |
| 2957 | Delivery Bears | binary search flows graphs | Statement | D | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2100 | |
| 1744 | Bear and Forgotten Tree 2 | dfs and similar dsu graphs trees | Statement | E | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2400 | |
| 1177 | Paper task | data structures string suffix structures strings | Statement | F | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2500 | |
| 646 | Move by Prime | combinatorics math number theory | Statement | G | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 3000 | |
| 1771 | Scrambled | *special implementation | Statement | B | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 1700 | |
| 3829 | Da Vinci Powers | *special | Statement | A | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 1900 | |
| 768 | Out of Controls | *special | Statement | E | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2100 | |
| 961 | Ace It! | *special | Statement | F | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2100 | |
| 515 | You're a Professional | *special | Statement | G | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 734 | Without Text | *special | Statement | C | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 999 | Rosetta Problem | *special | Statement | D | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 7727 | Bear and Reverse Radewoosh | implementation | Statement | A | VK Cup 2016 - Round 1 (Div. 2 Edition) {658} | PROGRAMMING | Tutorial | 700 | |
| 16887 | Round House | implementation math | Statement | A | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1100 | |
| 11983 | Tanya and Toys | greedy implementation | Statement | C | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1200 | |
| 6643 | Qualifying Contest | constructive algorithms sortings | Statement | B | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1400 | |
| 6728 | Bicycle Race | geometry implementation math | Statement | D | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1500 | |
| 8023 | New Reform | data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1600 | |
| 1969 | Polycarp and Hay | dfs and similar dsu graphs greedy sortings | Statement | F | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 2100 | |
| 1321 | Fence Divercity | combinatorics dp number theory | Statement | G | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 2500 | |
| 5903 | Seating On Bus | implementation | Statement | B | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 1200 | |
| 10508 | Co-prime Array | greedy implementation math number theory | Statement | A | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 1300 | |
| 10830 | Hard Process | binary search dp two pointers | Statement | C | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 1600 | |
| 4774 | Number of Parallelograms | geometry | Statement | D | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 1900 | |
| 1970 | Different Subsets For All Tuples | combinatorics | Statement | E | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 2300 | |
| 2347 | Bear and Bowling 4 | binary search data structures geometry ternary search | Statement | F | Educational Codeforces Round 11 {660} | PROGRAMMING | Editorial of Educational Codeforces Round 11 | 2500 | |
| 650 | Lazy Caterer Sequence | *special | Statement | A | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 1400 | |
| 237 | Seasons | *special | Statement | B | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 1900 | |
| 138 | Maximal Difference | *special | Statement | D | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2100 | |
| 632 | Primes in Interval | *special | Statement | F | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2200 | |
| 92 | Divisibility Check | *special | Statement | E | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2200 | |
| 139 | Array Sum | *special | Statement | C | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2200 | |
| 77 | Hungarian Notation | *special | Statement | G | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2500 | |
| 94 | Rotate Matrix | *special | Statement | H | VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror) {661} | PROGRAMMING | Tutorial | 2600 | |
| 1718 | International Olympiad | constructive algorithms greedy implementation math | Statement | D | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2000 | |
| 1682 | Graph Coloring | dfs and similar graphs | Statement | B | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2300 | |
| 605 | Gambling Nim | bitmasks math matrices probabilities | Statement | A | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2400 | |
| 164 | To Hack or not to Hack | brute force dp greedy | Statement | E | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2800 | |
| 2465 | Binary Table | bitmasks brute force divide and conquer dp fft math | Statement | C | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2800 | |
| 3797 | Rebus | constructive algorithms expression parsing greedy math | Statement | A | Codeforces Round 347 (Div. 1) {663} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 1800 | |
| 22089 | Complicated GCD | math number theory | Statement | A | Codeforces Round 347 (Div. 2) {664} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 900 | |
| 17772 | Simple Strings | dp greedy strings | Statement | C | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 1200 | |
| 3902 | Shopping | brute force | Statement | B | Educational Codeforces Round 12 {665} | PROGRAMMING | 1400 | ||
| 3197 | Buses Between Cities | implementation | Statement | A | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 1700 | |
| 4195 | Simple Subset | constructive algorithms greedy number theory | Statement | D | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 2000 | |
| 4517 | Beautiful Subarrays | data structures divide and conquer | Statement | E | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 2200 | |
| 760 | Four Divisors | dp math number theory | Statement | F | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 2600 | |
| 3813 | Reberland Linguistics | dp implementation strings | Statement | A | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 1800 | |
| 2407 | World Tour | graphs shortest paths | Statement | B | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 2100 | |
| 918 | Codeword | combinatorics strings | Statement | C | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 2400 | |
| 311 | Chain Reaction | brute force geometry | Statement | D | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 3000 | |
| 1566 | Forensic Examination | data structures string suffix structures | Statement | E | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 3100 | |
| 8528 | Pouring Rain | geometry math | Statement | A | Codeforces Round 349 (Div. 2) {667} | PROGRAMMING | Codeforces Round #349 Editorial | 1100 | |
| 5886 | Coat of Anticubism | constructive algorithms geometry | Statement | B | Codeforces Round 349 (Div. 2) {667} | PROGRAMMING | Codeforces Round #349 Editorial | 1100 | |
| 11721 | Little Artem and Presents | math | Statement | A | Codeforces Round 348 (VK Cup 2016 Round 2, Div. 2 Edition) {669} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 800 | |
| 18728 | Holidays | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1000 | |
| 12028 | Game of Robots | implementation | Statement | B | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1100 | |
| 24462 | Magic Powder - 1 | binary search brute force implementation | Statement | D1 | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1400 | |
| 10059 | Cinema | implementation sortings | Statement | C | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1400 | |
| 19765 | Magic Powder - 2 | binary search implementation | Statement | D2 | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1500 | |
| 3472 | Correct Bracket Sequence Editor | data structures dsu strings | Statement | E | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 1700 | |
| 901 | Restore a Number | brute force constructive algorithms strings | Statement | F | Codeforces Round 350 (Div. 2) {670} | PROGRAMMING | Codeforces Round #350 (Div.2) Editorial | 2200 | |
| 4403 | Recycling Bottles | dp geometry greedy implementation | Statement | A | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 1800 | |
| 3300 | Robin Hood | binary search greedy | Statement | B | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 2000 | |
| 782 | Ultimate Weirdness of an Array | data structures number theory | Statement | C | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 2700 | |
| 1320 | Roads in Yusland | data structures dp greedy | Statement | D | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 2800 | |
| 493 | Organizing a Race | data structures greedy | Statement | E | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | Codeforces Round #352 Editorial | 3300 | |
| 18592 | Different is Good | constructive algorithms implementation strings | Statement | B | Codeforces Round 352 (Div. 2) {672} | PROGRAMMING | 1000 | ||
| 16717 | Summer Camp | implementation | Statement | A | Codeforces Round 352 (Div. 2) {672} | PROGRAMMING | 800 | ||
| 3669 | Problems for Round | greedy implementation | Statement | B | Codeforces Round 351 (VK Cup 2016 Round 3, Div. 2 Edition) {673} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 1400 | |
| 10896 | Bear and Game | implementation | Statement | A | Codeforces Round 351 (VK Cup 2016 Round 3, Div. 2 Edition) {673} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 900 | |
| 15611 | Infinite Sequence | math | Statement | A | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 1100 | |
| 7739 | Restoring Painting | brute force constructive algorithms math | Statement | B | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 1400 | |
| 4324 | Дерево | data structures trees | Statement | D | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 1800 | |
| 3865 | Money Transfers | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 2000 | |
| 3380 | Trains and Statistic | data structures dp greedy | Statement | E | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 2500 | |
| 14735 | Nicholas and Permutation | constructive algorithms implementation | Statement | A | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 1000 | |
| 23015 | Vasya and String | binary search dp strings two pointers | Statement | C | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 1500 | |
| 5841 | Pyramid of Glasses | implementation math math | Statement | B | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 1500 | |
| 1965 | Theseus and labyrinth | graphs implementation shortest paths | Statement | D | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | 2000 | ||
| 943 | The Last Fight Between Human and AI | math | Statement | E | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 2300 | |
| 7935 | Vanya and Food Processor | implementation math | Statement | B | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 1400 | |
| 6986 | Vanya and Label | bitmasks combinatorics implementation strings | Statement | C | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 1500 | |
| 1980 | Vanya and Treasure | data structures dp graphs shortest paths | Statement | D | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 2300 | |
| 756 | Vanya and Balloons | binary search brute force dp implementation | Statement | E | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 2600 | |
| 182848 | Vanya and Fence | implementation | Statement | A | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 700 | |
| 15254 | Johny Likes Numbers | implementation math | Statement | A | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 1000 | |
| 4761 | The Same Calendar | implementation | Statement | B | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 1600 | |
| 11112 | Joty and Chocolate | implementation math number theory | Statement | C | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 1600 | |
| 5436 | Iterated Linear Function | math number theory | Statement | D | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 1800 | |
| 2756 | Another Sith Tournament | bitmasks dp | Statement | E | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 2200 | |
| 1045 | Lena and Queries | data structures divide and conquer geometry | Statement | F | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 2600 | |
| 15631 | Bear and Prime 100 | constructive algorithms interactive math | Statement | A | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 1400 | |
| 2233 | Bear and Tower of Cubes | binary search dp greedy | Statement | B | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2300 | |
| 1265 | Bear and Square Grid | dfs and similar dsu implementation | Statement | C | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2500 | |
| 343 | Bear and Chase | brute force dfs and similar graphs implementation math probabilities | Statement | D | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2900 | |
| 827 | Bear and Bad Powers of 42 | data structures | Statement | E | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 3100 | |
| 26339 | Bear and Finding Criminals | constructive algorithms implementation | Statement | B | Codeforces Round 356 (Div. 2) {680} | PROGRAMMING | Codeforces Round #356 — Editorial | 1000 | |
| 13320 | Bear and Five Cards | constructive algorithms implementation | Statement | A | Codeforces Round 356 (Div. 2) {680} | PROGRAMMING | Codeforces Round #356 — Editorial | 900 | |
| 9468 | Economy Game | brute force | Statement | B | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 1300 | |
| 10649 | Heap Operations | constructive algorithms data structures greedy | Statement | C | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 1600 | |
| 1892 | Gifts by the List | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 2100 | |
| 508 | Runaway to a Shadow | geometry sortings | Statement | E | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 2900 | |
| 16914 | A Good Contest | implementation | Statement | A | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 800 | |
| 24096 | Alyona and Numbers | constructive algorithms math number theory | Statement | A | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1200 | |
| 12791 | Alyona and Mex | sortings | Statement | B | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1200 | |
| 8121 | Alyona and the Tree | dfs and similar dp graphs trees | Statement | C | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1700 | |
| 3524 | Alyona and Strings | dp strings | Statement | D | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1900 | |
| 718 | Alyona and Triangles | geometry two pointers | Statement | E | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 2600 | |
| 1252 | The Check of the Point | *special geometry | Statement | A | Surprise Language Round 8 {683} | PROGRAMMING | 1200 | ||
| 339 | The Teacher of Physical Education | *special | Statement | B | Surprise Language Round 8 {683} | PROGRAMMING | 1600 | ||
| 336 | Symmetric Difference | *special | Statement | C | Surprise Language Round 8 {683} | PROGRAMMING | 1600 | ||
| 386 | Chocolate Bar | *special math | Statement | D | Surprise Language Round 8 {683} | PROGRAMMING | 1700 | ||
| 202 | Hammer throwing | *special | Statement | E | Surprise Language Round 8 {683} | PROGRAMMING | 1900 | ||
| 168 | Reformat the String | *special | Statement | F | Surprise Language Round 8 {683} | PROGRAMMING | 2000 | ||
| 144 | The Fraction | *special | Statement | G | Surprise Language Round 8 {683} | PROGRAMMING | 2100 | ||
| 124 | Exchange of Books | *special | Statement | H | Surprise Language Round 8 {683} | PROGRAMMING | 2100 | ||
| 49 | Loader | *special | Statement | I | Surprise Language Round 8 {683} | PROGRAMMING | 2600 | ||
| 46 | The Hero with Bombs | *special | Statement | J | Surprise Language Round 8 {683} | PROGRAMMING | 2900 | ||
| 4506 | Robbers' watch | brute force combinatorics dp math | Statement | A | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 1700 | |
| 5439 | Kay and Snowflake | data structures dfs and similar dp trees | Statement | B | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2000 | |
| 517 | Kay and Eternity | brute force implementation sortings | Statement | D | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2600 | |
| 611 | Travelling Through the Snow Queen's Kingdom | bitmasks brute force divide and conquer graphs | Statement | E | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2700 | |
| 649 | Optimal Point | binary search math | Statement | C | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2800 | |
| 8022 | Little Robber Girl's Zoo | constructive algorithms implementation sortings | Statement | B | Codeforces Round 359 (Div. 2) {686} | PROGRAMMING | Codeforces Round #359 Editorial | 1200 | |
| 43763 | Free Ice Cream | constructive algorithms implementation | Statement | A | Codeforces Round 359 (Div. 2) {686} | PROGRAMMING | Codeforces Round #359 Editorial | 800 | |
| 16573 | NP-Hard Problem | dfs and similar graphs | Statement | A | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1500 | |
| 6927 | Remainders Game | chinese remainder theorem math number theory | Statement | B | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1900 | |
| 8550 | The Values You Can Make | dp | Statement | C | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2000 | |
| 1053 | Dividing Kingdom II | brute force data structures dsu graphs sortings | Statement | D | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2500 | |
| 437 | TOF | dfs and similar graphs | Statement | E | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2800 | |
| 36200 | Lovely Palindromes | constructive algorithms math | Statement | B | Codeforces Round 360 (Div. 2) {688} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1000 | |
| 14843 | Opponents | implementation | Statement | A | Codeforces Round 360 (Div. 2) {688} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 800 | |
| 5494 | Mike and Cellphone | brute force constructive algorithms implementation | Statement | A | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 1400 | |
| 6637 | Mike and Shortcuts | dfs and similar graphs greedy shortest paths | Statement | B | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1600 | |
| 6221 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 45912 | 1700 | |
| 4200 | Friends and Subsequences | binary search data structures | Statement | D | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2200 | |
| 2156 | Mike and Geometry Problem | combinatorics data structures dp geometry implementation | Statement | E | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2300 | |
| 3101 | Collective Mindsets (easy) | Statement | A1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1200 | |||
| 2925 | The Wall (easy) | Statement | D1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1300 | ||
| 2445 | Tree of Life (easy) | Statement | F1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 3188 | Brain Network (easy) | Statement | C1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 5056 | Brain Network (medium) | dfs and similar graphs trees | Statement | C2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1600 | |
| 1473 | The Wall (medium) | combinatorics | Statement | D2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1800 | |
| 1013 | Recover Polygon (easy) | Statement | B1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1800 | |||
| 736 | Photographs (I) | Statement | E1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1900 | |||
| 631 | The Wall (hard) | Statement | D3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2100 | ||
| 1014 | Brain Network (hard) | trees | Statement | C3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2200 | |
| 748 | Collective Mindsets (medium) | Statement | A2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2400 | ||
| 672 | Collective Mindsets (hard) | Statement | A3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2500 | |||
| 232 | Recover Polygon (medium) | geometry | Statement | B2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2700 | ||
| 149 | Photographs (II) | Statement | E2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2700 | |||
| 111 | Recover Polygon (hard) | Statement | B3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2800 | |||
| 93 | Tree of Life (medium) | constructive algorithms hashing trees | Statement | F2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 3000 | ||
| 61 | Tree of Life (hard) | trees | Statement | F3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 3200 | |
| 11172 | Fashion in Berland | implementation | Statement | A | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1100 | |
| 8241 | s-palindrome | implementation strings | Statement | B | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1600 | |
| 6612 | Swaps in Permutation | dfs and similar dsu math | Statement | D | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1700 | |
| 2986 | Exponential notation | implementation strings | Statement | C | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1900 | |
| 3131 | Xor-sequences | matrices | Statement | E | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 2000 | |
| 1444 | Couple Cover | brute force dp number theory | Statement | F | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 2300 | |
| 6477 | Lorenzo Von Matterhorn | brute force data structures implementation trees | Statement | A | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 1500 | |
| 3828 | Puzzles | dfs and similar math probabilities trees | Statement | B | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 1800 | |
| 2218 | PLEASE | combinatorics dp implementation math matrices | Statement | C | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2200 | |
| 1636 | Legen... | data structures dp matrices strings | Statement | D | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2700 | |
| 631 | ...Wait for it... | data structures dsu trees | Statement | E | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2900 | |
| 136 | ...Dary! | binary search geometry two pointers | Statement | F | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 3200 | |
| 13389 | Pineapple Incident | implementation math | Statement | A | Codeforces Round 362 (Div. 2) {697} | PROGRAMMING | 1000 | ||
| 6023 | Barnicle | brute force implementation math strings | Statement | B | Codeforces Round 362 (Div. 2) {697} | PROGRAMMING | 1400 | ||
| 38651 | Vacations | dp | Statement | A | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 1400 | |
| 6212 | Fix a Tree | constructive algorithms dfs and similar dsu graphs trees | Statement | B | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 46148 | 1700 | |
| 1446 | LRU | bitmasks dp math probabilities | Statement | C | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2700 | |
| 582 | Limak and Shooting Points | brute force geometry | Statement | D | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 46148 | 2800 | |
| 141 | Cron | Statement | E | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2800 | ||
| 490 | Coprime Permutation | combinatorics number theory | Statement | F | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 3000 | |
| 19379 | Launch of Collider | implementation | Statement | A | Codeforces Round 363 (Div. 2) {699} | PROGRAMMING | Codeforces Round #363 problems analysis | 1000 | |
| 7971 | One Bomb | implementation | Statement | B | Codeforces Round 363 (Div. 2) {699} | PROGRAMMING | Codeforces Round #363 problems analysis | 1400 | |
| 3355 | As Fast As Possible | binary search math | Statement | A | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 1900 | |
| 4662 | Connecting Universities | dfs and similar dp graphs trees | Statement | B | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 2100 | |
| 1487 | Break Up | dfs and similar graphs | Statement | C | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 2700 | |
| 528 | Huffman Coding on Segment | data structures greedy | Statement | D | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 3000 | |
| 1395 | Cool Slogans | string suffix structures strings | Statement | E | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 3300 | |
| 12581 | Cells Not Under Attack | data structures math | Statement | B | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 1200 | |
| 20125 | They Are Everywhere | binary search strings two pointers | Statement | C | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 1500 | |
| 21258 | Cards | greedy implementation | Statement | A | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 800 | |
| 13826 | Powers of Two | brute force data structures implementation math | Statement | B | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1500 | |
| 23438 | Cellular Network | binary search implementation two pointers | Statement | C | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1500 | |
| 3750 | Road to Post Office | math | Statement | D | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1900 | |
| 3148 | Analysis of Pathes in Functional Graph | data structures graphs | Statement | E | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 2100 | |
| 1950 | T-Shirts | data structures | Statement | F | Educational Codeforces Round 15 {702} | PROGRAMMING | 2800 | ||
| 55706 | Maximum Increase | dp greedy implementation | Statement | A | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 900 | |
| 6073 | Mishka and trip | implementation math | Statement | B | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 1400 | |
| 4092 | Mishka and Interesting sum | data structures | Statement | D | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 2100 | |
| 1975 | Chris and Road | geometry implementation | Statement | C | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 2100 | |
| 675 | Mishka and Divisors | dp number theory | Statement | E | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 2900 | |
| 67149 | Mishka and Game | implementation | Statement | A | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 700 | |
| 10263 | Thor | brute force data structures implementation | Statement | A | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 1600 | |
| 2184 | Ant Man | dp graphs greedy | Statement | B | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 2700 | |
| 526 | Black Widow | dp graphs implementation math | Statement | C | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 2800 | |
| 1013 | Captain America | flows greedy | Statement | D | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 3000 | |
| 348 | Iron Man | data structures geometry trees | Statement | E | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 3500 | |
| 9591 | Spider Man | games math | Statement | B | Codeforces Round 366 (Div. 2) {705} | PROGRAMMING | 1200 | ||
| 133518 | Hulk | implementation | Statement | A | Codeforces Round 366 (Div. 2) {705} | PROGRAMMING | tutorial | 600 | |
| 86109 | Interesting drink | binary search dp implementation | Statement | B | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 15387 | Beru-taxi | brute force geometry implementation | Statement | A | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 19678 | Hard problem | dp strings | Statement | C | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1600 | |
| 12781 | Vasiliy's Multiset | binary search bitmasks data structures trees | Statement | D | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1800 | |
| 1266 | Working routine | data structures implementation | Statement | E | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 2600 | |
| 56164 | Brain's Photos | implementation | Statement | A | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 1000 | |
| 13624 | Bakery | graphs | Statement | B | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 1300 | |
| 13521 | Pythagorean Triples | math number theory | Statement | C | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 1500 | |
| 3011 | Persistent Bookcase | bitmasks data structures dfs and similar implementation | Statement | D | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 2100 | |
| 1349 | Garlands | data structures | Statement | E | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 2500 | |
| 9828 | Letters Cyclic Shift | constructive algorithms greedy implementation strings | Statement | A | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 1200 | |
| 3457 | Recover the String | constructive algorithms greedy implementation math | Statement | B | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 1900 | |
| 4436 | Centroids | data structures dfs and similar dp graphs greedy trees | Statement | C | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 2500 | |
| 889 | Incorrect Flow | flows | Statement | D | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | 2900 |