Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 32 33 34 35 36 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 963 | Prairie Partition | binary search constructive algorithms greedy math | Statement | C | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2300 | ||
| 705 | Perishable Roads | dp graphs shortest paths | Statement | D | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2700 | ||
| 423 | Blog Post Rating | data structures sortings | Statement | E | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2900 | ||
| 194 | Test Data Generation | combinatorics divide and conquer dp fft math number theory | Statement | F | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 3400 | ||
| 4139 | Maximum Number | *special constructive algorithms greedy | Statement | C | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1200 | |
| 1965 | Lie or Truth | *special constructive algorithms sortings | Statement | D | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 1500 | ||
| 1284 | Stepan and Vowels | *special implementation strings | Statement | K | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1600 | |
| 367 | Stepan's Series | *special dp | Statement | J | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2100 | |
| 345 | Bars | *special binary search | Statement | L | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2200 | |
| 227 | Significant Cups | *special binary search data structures two pointers | Statement | B | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2300 | ||
| 321 | Amusement Park | *special ternary search | Statement | A | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2300 | ||
| 261 | Repairing Of String | *special constructive algorithms | Statement | H | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2400 | ||
| 220 | Big Number and Remainder | *special math number theory | Statement | E | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2400 | |
| 109 | Composing Of String | *special dp | Statement | I | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2500 | ||
| 109 | Pens And Days Of Week | *special binary search number theory | Statement | F | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2600 | |
| 183 | Perfectionist Arkadiy | *special number theory | Statement | G | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2900 | ||
| 0 | University Schedule | *special | Statement | A | VK Cup 2017 - Wild Card Round 2 {775} | PROGRAMMING | 2900 | ||
| 21619 | Sherlock and his girlfriend | constructive algorithms number theory | Statement | B | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 1200 | |
| 5993 | Molly's Chemicals | binary search brute force data structures implementation math | Statement | C | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 1800 | |
| 5221 | The Door Problem | 2-sat dfs and similar ds graphs | Statement | D | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | 2000 | ||
| 2213 | The Holmes Children | math number theory | Statement | E | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2100 | |
| 453 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | 2700 | ||
| 340 | Sherlock and the Encrypted Data | bitmasks combinatorics dp | Statement | G | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2800 | |
| 12339 | A Serial Killer | brute force implementation strings | Statement | A | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 900 | |
| 10365 | Shell Game | constructive algorithms implementation math | Statement | A | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1100 | |
| 9592 | Game of Credit Cards | data structures dp greedy sortings | Statement | B | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | 1300 | ||
| 6472 | Alyona and Spreadsheet | binary search data structures dp greedy implementation two pointers | Statement | C | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | 1600 | ||
| 5054 | Cloud of Hashtags | binary search greedy implementation strings | Statement | D | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | 1800 | ||
| 4142 | Hanoi Factory | brute force data structures dp greedy sortings | Statement | E | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 2000 | |
| 11772 | String Game | binary search greedy strings | Statement | A | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | 1600 | ||
| 2366 | Bitwise Formula | bitmasks brute force dfs and similar expression parsing implementation | Statement | B | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | 2000 | ||
| 934 | Peterson Polyglot | brute force dfs and similar ds hashing strings trees | Statement | C | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | 2600 | ||
| 539 | Parquet Re-laying | constructive algorithms | Statement | D | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2700 | |
| 337 | Selling Numbers | dp sortings | Statement | E | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2900 | |
| 10391 | Weird Rounding | brute force greedy | Statement | B | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | Codeforces Round #402, Editorial | 1100 | |
| 9388 | Pupils Redistribution | constructive algorithms math | Statement | A | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | Codeforces Round #402, Editorial | 1100 | |
| 12069 | Dishonest Sellers | constructive algorithms greedy sortings | Statement | C | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | 1200 | ||
| 9232 | Andryusha and Colored Balloons | dfs and similar graphs greedy trees | Statement | C | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1500 | |
| 10094 | The Meeting Place Cannot Be Changed | binary search | Statement | B | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1600 | |
| 2936 | Innokenty and a Football League | 2-sat graphs greedy implementation shortest paths strings | Statement | D | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | 2000 | ||
| 2638 | Underground Lab | constructive algorithms dfs and similar graphs | Statement | E | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | 2200 | ||
| 671 | Andryusha and Nervous Barriers | data structures dp | Statement | G | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | 2700 | ||
| 1058 | Axel and Marston in Bitland | bitmasks dp graphs matrices | Statement | F | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | 2800 | ||
| 118 | Intranet of Buses | binary search geometry implementation two pointers | Statement | H | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | 3000 | ||
| 20131 | Andryusha and Socks | implementation | Statement | A | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 900 | |
| 3205 | Numbers Joke | *special | Statement | A | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 1700 | |
| 1968 | Twisted Circuit | *special brute force implementation | Statement | E | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2000 | |
| 750 | BF Calculator | *special | Statement | G | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2100 | |
| 1100 | Crunching Numbers Just for You | *special implementation | Statement | F | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2200 | |
| 884 | Kids' Riddle | *special | Statement | B | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2300 | |
| 733 | INTERCALC | *special implementation | Statement | C | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2300 | |
| 477 | Touchy-Feely Palindromes | *special implementation | Statement | D | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2500 | |
| 10295 | Anton and Classes | greedy sortings | Statement | B | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | 1200 | ||
| 7445 | Anton and Fairy Tale | binary search math | Statement | C | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 1600 | |
| 3055 | Anton and School - 2 | combinatorics dp math number theory | Statement | D | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 2200 | |
| 1972 | Anton and Permutation | brute force data structures | Statement | E | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | 2300 | ||
| 92918 | Anton and Polyhedrons | implementation strings | Statement | A | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 600 | |
| 2581 | Berzerk | dfs and similar dp games | Statement | A | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | 2100 | ||
| 2969 | Till I Collapse | data structures divide and conquer | Statement | C | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 2600 | |
| 6411 | Legacy | data structures graphs shortest paths | Statement | B | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | 2600 | ||
| 643 | ALT | data structures flows graphs trees | Statement | E | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | 3200 | ||
| 143 | Rap God | data structures dfs and similar hashing strings trees | Statement | D | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | 3300 | ||
| 11542 | The Monster | brute force math number theory | Statement | A | Codeforces Round 406 (Div. 2) {787} | PROGRAMMING | Codeforces Round #406 Editorial | 1300 | |
| 5632 | Not Afraid | greedy implementation math | Statement | B | Codeforces Round 406 (Div. 2) {787} | PROGRAMMING | 1300 | ||
| 9202 | Functions again | dp two pointers | Statement | A | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 1500 | |
| 2627 | Weird journey | combinatorics constructive algorithms dfs and similar ds graphs | Statement | B | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2200 | |
| 2327 | The Great Mixing | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2500 | |
| 342 | New task | data structures | Statement | E | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | 2900 | ||
| 377 | Finding lines | constructive algorithms divide and conquer interactive | Statement | D | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | 2900 | ||
| 9372 | Anastasia and pebbles | implementation math | Statement | A | Codeforces Round 407 (Div. 2) {789} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 1100 | |
| 4425 | Masha and geometric depression | brute force implementation math | Statement | B | Codeforces Round 407 (Div. 2) {789} | PROGRAMMING | 1700 | ||
| 206025 | Bear and Big Brother | implementation | Statement | A | Codeforces Round 405 (rated, Div. 2, based on VK Cup 2017 Round 1) {791} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 600 | |
| 9169 | New Bus Route | implementation sortings | Statement | A | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1100 | |
| 6084 | Counting-out Rhyme | implementation | Statement | B | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1300 | |
| 3058 | Paths in a Complete Binary Tree | bitmasks trees | Statement | D | Educational Codeforces Round 18 {792} | PROGRAMMING | 1800 | ||
| 4480 | Divide by Three | dp greedy math number theory | Statement | C | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 2000 | |
| 1108 | Colored Balls | greedy math number theory | Statement | E | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 2400 | |
| 215 | Mages and Monsters | data structures geometry | Statement | F | Educational Codeforces Round 18 {792} | PROGRAMMING | 3100 | ||
| 7037 | Oleg and shares | implementation math | Statement | A | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 1000 | ||
| 4507 | Igor and his way to work | dfs and similar graphs implementation shortest paths | Statement | B | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 1600 | |
| 1609 | Presents in Bankopolis | dp graphs shortest paths | Statement | D | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 2100 | ||
| 1270 | Mice problem | geometry implementation math sortings | Statement | C | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 2200 | ||
| 264 | Problem of offices | constructive algorithms dfs and similar dp trees | Statement | E | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 2800 | ||
| 618 | Julia the snail | data structures divide and conquer dp | Statement | F | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 2900 | ||
| 389 | Oleg and chess | data structures divide and conquer flows graph matchings | Statement | G | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 3100 | ||
| 6695 | Cutting Carrot | geometry math | Statement | B | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | Editorial | 1300 | |
| 3166 | Naming Company | games greedy sortings | Statement | C | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 1800 | ||
| 834 | Labelling Cities | dfs and similar graphs hashing | Statement | D | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2400 | ||
| 817 | Choosing Carrot | games math | Statement | E | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2700 | ||
| 840 | Leha and security system | data structures | Statement | F | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2800 | ||
| 351 | Replace All | combinatorics dp math | Statement | G | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 3400 | ||
| 7157 | Bank Robbery | brute force implementation | Statement | A | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 900 | ||
| 9164 | Find The Bone | implementation | Statement | B | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 1300 | ||
| 3092 | Bank Hacking | constructive algorithms data structures dp trees | Statement | C | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 1900 | ||
| 5934 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 2100 | ||
| 182 | Sequence Recovery | bitmasks data structures greedy | Statement | F | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 2800 | ||
| 689 | Exam Cheating | binary search dp | Statement | E | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 2800 | ||
| 13196 | Buying A House | brute force implementation | Statement | A | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | 900 | ||
| 16040 | k-Factorization | implementation math number theory | Statement | A | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 1100 | |
| 10724 | Odd sum | dp greedy implementation | Statement | B | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 1400 |