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 ... 12 13 14 15 16 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 780 | Timofey and remoduling | brute force implementation math number theory | Statement | C | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2500 | |
| 551 | Timofey and our friends animals | data structures divide and conquer dsu | Statement | E | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2800 | |
| 645 | Timofey and a flat tree | data structures graphs hashing shortest paths trees | Statement | D | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2800 | |
| 12666 | Timofey and cubes | constructive algorithms implementation | Statement | B | Codeforces Round 395 (Div. 2) {764} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1000 | |
| 17091 | Taymyr is calling you | brute force implementation math | Statement | A | Codeforces Round 395 (Div. 2) {764} | PROGRAMMING | Codeforces Round #395 [Editorial] | 800 | |
| 7547 | Code obfuscation | greedy implementation strings | Statement | B | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 1100 | |
| 7425 | Table Tennis Game 2 | math | Statement | C | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 1300 | |
| 2600 | Artsem and Saunders | constructive algorithms dsu math | Statement | D | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 1700 | |
| 1336 | Tree Folding | dfs and similar dp greedy implementation trees | Statement | E | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2200 | |
| 2548 | Souvenirs | data structures | Statement | F | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2500 | |
| 115 | Math, math everywhere | brute force dp math meet-in-the-middle number theory | Statement | G | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2800 | |
| 9555 | Neverending competitions | implementation math | Statement | A | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 900 | |
| 34499 | Mahmoud and Longest Uncommon Subsequence | constructive algorithms strings | Statement | A | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1000 | |
| 38285 | Mahmoud and a Triangle | constructive algorithms geometry greedy math number theory sortings | Statement | B | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1100 | |
| 4940 | Mahmoud and a Message | brute force dp greedy strings | Statement | C | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1700 | |
| 3920 | Mahmoud and a Dictionary | data structures dfs and similar dp dsu graphs | Statement | D | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2000 | |
| 3457 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 22657 | Snacktower | data structures implementation | Statement | A | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 1200 | |
| 2248 | The Queue | brute force greedy | Statement | B | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 4632 | Garland | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 2414 | Cartons of milk | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2000 | |
| 1072 | Change-free | greedy | Statement | E | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 2700 | |
| 30800 | Oath of the Night's Watch | constructive algorithms sortings | Statement | A | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 1000 | |
| 6954 | Code For 1 | constructive algorithms dfs and similar divide and conquer | Statement | B | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 1600 | |
| 3974 | Jon Snow and his Favourite Number | brute force dp implementation sortings | Statement | C | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 1800 | |
| 3492 | Game of Stones | bitmasks dp games | Statement | E | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 2000 | |
| 3422 | Jon and Orbs | dp math probabilities | Statement | D | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 2100 | |
| 1123 | Barrels and boxes | brute force combinatorics math number theory probabilities | Statement | F | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 2300 | |
| 403 | The Winds of Winter | binary search data structures | Statement | G | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 3000 | |
| 6413 | Year of University Entrance | *special implementation sortings | Statement | A | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1500 | |
| 3440 | News About Credit | *special greedy two pointers | Statement | B | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1600 | |
| 2554 | k-Interesting Pairs Of Integers | *special bitmasks brute force meet-in-the-middle | Statement | D | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1800 | |
| 3011 | Cycle In Maze | *special dfs and similar graphs greedy shortest paths | Statement | C | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1800 | |
| 21703 | New Password | *special implementation | Statement | A | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1500 | |
| 3064 | Maximize Sum of Digits | *special implementation math | Statement | B | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1700 | |
| 2928 | Online Courses In BSU | *special dfs and similar graphs implementation | Statement | C | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | 1900 | ||
| 1629 | Draw Brackets! | *special implementation | Statement | D | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1900 | |
| 17707 | Bear and Friendship Condition | dfs and similar dsu graphs | Statement | A | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 1500 | |
| 7183 | Bear and Different Names | constructive algorithms greedy | Statement | B | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 1500 | |
| 3545 | Bear and Tree Jumps | dfs and similar dp trees | Statement | C | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 2100 | |
| 1612 | Bear and Company | dp | Statement | D | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 2800 | |
| 618 | Bear and Rectangle Strips | dp greedy | Statement | E | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 3000 | |
| 88 | Bear and Isomorphic Points | geometry two pointers | Statement | F | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 3200 | |
| 4989 | Voltage Keepsake | binary search math | Statement | A | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 1800 | |
| 3475 | Volatile Kite | geometry | Statement | B | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 1800 | |
| 1447 | Vulnerable Kerbals | constructive algorithms dp graphs math number theory | Statement | C | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 2400 | |
| 751 | Varying Kibibits | bitmasks dp | Statement | D | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 2700 | |
| 219 | Verifying Kingdom | binary search divide and conquer interactive trees | Statement | E | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 3200 | |
| 4784 | Success Rate | binary search math | Statement | A | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 1700 | |
| 1215 | Dynamic Problem Scoring | brute force greedy | Statement | B | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2100 | |
| 996 | Prairie Partition | binary search constructive algorithms greedy math | Statement | C | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2300 | |
| 800 | Perishable Roads | dp graphs shortest paths | Statement | D | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2700 | |
| 509 | Blog Post Rating | data structures sortings | Statement | E | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 2900 | |
| 218 | Test Data Generation | combinatorics divide and conquer dp fft math number theory | Statement | F | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 3400 | |
| 4376 | Maximum Number | *special constructive algorithms greedy | Statement | C | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1200 | |
| 2110 | Lie or Truth | *special constructive algorithms sortings | Statement | D | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1500 | |
| 1395 | Stepan and Vowels | *special implementation strings | Statement | K | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1600 | |
| 430 | Stepan's Series | *special dp | Statement | J | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2100 | |
| 388 | Bars | *special binary search | Statement | L | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2200 | |
| 295 | Significant Cups | *special binary search data structures two pointers | Statement | B | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2300 | |
| 387 | Amusement Park | *special ternary search | Statement | A | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2300 | |
| 276 | Repairing Of String | *special constructive algorithms | Statement | H | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2400 | |
| 262 | Big Number and Remainder | *special math number theory | Statement | E | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2400 | |
| 157 | Composing Of String | *special dp | Statement | I | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2500 | |
| 153 | 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 | |
| 199 | Perfectionist Arkadiy | *special number theory | Statement | G | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2900 | |
| 0 | University Schedule | *special | Statement | A | VK Cup 2017 - Wild Card Round 2 {775} | PROGRAMMING | 2900 | ||
| 25653 | 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 | |
| 6244 | 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 | |
| 6174 | The Door Problem | 2-sat dfs and similar dsu graphs | Statement | D | 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 | 2000 | |
| 2436 | 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 | |
| 511 | 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 | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 368 | 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 | |
| 12877 | 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 | |
| 10874 | Shell Game | constructive algorithms implementation math | Statement | A | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1100 | |
| 9963 | Game of Credit Cards | data structures dp greedy sortings | Statement | B | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1300 | |
| 6817 | Alyona and Spreadsheet | binary search data structures dp greedy implementation two pointers | Statement | C | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1600 | |
| 5250 | Cloud of Hashtags | binary search greedy implementation strings | Statement | D | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | Problem analysis of Codeforces Round #401 (Div. 2) | 1800 | |
| 4741 | 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 | |
| 12809 | String Game | binary search greedy strings | Statement | A | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 1600 | |
| 2533 | Bitwise Formula | bitmasks brute force dfs and similar expression parsing implementation | Statement | B | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2000 | |
| 983 | Peterson Polyglot | brute force dfs and similar dsu hashing strings trees | Statement | C | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2600 | |
| 588 | Parquet Re-laying | constructive algorithms | Statement | D | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2700 | |
| 353 | Selling Numbers | dp sortings | Statement | E | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2900 | |
| 10704 | Weird Rounding | brute force greedy | Statement | B | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | Codeforces Round #402, Editorial | 1100 | |
| 9700 | Pupils Redistribution | constructive algorithms math | Statement | A | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | Codeforces Round #402, Editorial | 1100 | |
| 12759 | Dishonest Sellers | constructive algorithms greedy sortings | Statement | C | Codeforces Round 402 (Div. 2) {779} | PROGRAMMING | Codeforces Round #402, Editorial | 1200 | |
| 10010 | Andryusha and Colored Balloons | dfs and similar graphs greedy trees | Statement | C | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1500 | |
| 12608 | The Meeting Place Cannot Be Changed | binary search | Statement | B | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 1600 | |
| 3041 | Innokenty and a Football League | 2-sat graphs greedy implementation shortest paths strings | Statement | D | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2000 | |
| 2970 | Underground Lab | constructive algorithms dfs and similar graphs | Statement | E | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2200 | |
| 706 | Andryusha and Nervous Barriers | data structures dp | Statement | G | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2700 | |
| 1267 | Axel and Marston in Bitland | bitmasks dp graphs matrices | Statement | F | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2800 | |
| 132 | Intranet of Buses | binary search geometry implementation two pointers | Statement | H | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 3000 | |
| 22721 | Andryusha and Socks | implementation | Statement | A | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 900 | |
| 3340 | Numbers Joke | *special | Statement | A | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 1700 | |
| 2036 | Twisted Circuit | *special brute force implementation | Statement | E | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2000 | |
| 773 | BF Calculator | *special | Statement | G | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2100 | |
| 1143 | Crunching Numbers Just for You | *special implementation | Statement | F | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2200 | |
| 925 | Kids' Riddle | *special | Statement | B | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2300 | |
| 773 | INTERCALC | *special implementation | Statement | C | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2300 | |
| 513 | Touchy-Feely Palindromes | *special implementation | Statement | D | April Fools Contest 2017 {784} | PROGRAMMING | 51351 | 2500 | |
| 10631 | Anton and Classes | greedy sortings | Statement | B | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | 1200 | ||
| 7811 | Anton and Fairy Tale | binary search math | Statement | C | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 1600 | |
| 3663 | Anton and School - 2 | combinatorics dp math number theory | Statement | D | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 2200 | |
| 2202 | Anton and Permutation | brute force data structures | Statement | E | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | 2300 | ||
| 110636 | Anton and Polyhedrons | implementation strings | Statement | A | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 600 | |
| 2840 | Berzerk | dfs and similar dp games | Statement | A | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 2100 | |
| 3684 | Till I Collapse | data structures divide and conquer | Statement | C | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 2600 | |
| 7985 | Legacy | data structures graphs shortest paths | Statement | B | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 2600 | |
| 752 | ALT | data structures flows graphs trees | Statement | E | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3200 | |
| 168 | Rap God | data structures dfs and similar hashing strings trees | Statement | D | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3300 | |
| 12177 | The Monster | brute force math number theory | Statement | A | Codeforces Round 406 (Div. 2) {787} | PROGRAMMING | Codeforces Round #406 Editorial | 1300 | |
| 5763 | Not Afraid | greedy implementation math | Statement | B | Codeforces Round 406 (Div. 2) {787} | PROGRAMMING | Codeforces Round #406 Editorial | 1300 | |
| 10197 | Functions again | dp two pointers | Statement | A | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 1500 | |
| 2884 | Weird journey | combinatorics constructive algorithms dfs and similar dsu graphs | Statement | B | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2200 | |
| 2570 | 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 | |
| 391 | New task | data structures | Statement | E | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2900 | |
| 409 | Finding lines | constructive algorithms divide and conquer interactive | Statement | D | Codeforces Round 407 (Div. 1) {788} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 2900 | |
| 9818 | Anastasia and pebbles | implementation math | Statement | A | Codeforces Round 407 (Div. 2) {789} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 1100 | |
| 4920 | Masha and geometric depression | brute force implementation math | Statement | B | Codeforces Round 407 (Div. 2) {789} | PROGRAMMING | Codeforces Round #407(Div.1 + Div.2) Editorial | 1700 | |
| 256242 | 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 | |
| 9707 | New Bus Route | implementation sortings | Statement | A | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1100 | |
| 6547 | Counting-out Rhyme | implementation | Statement | B | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1300 | |
| 3388 | Paths in a Complete Binary Tree | bitmasks trees | Statement | D | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1800 | |
| 4990 | Divide by Three | dp greedy math number theory | Statement | C | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 2000 | |
| 1264 | Colored Balls | greedy math number theory | Statement | E | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 2400 | |
| 235 | Mages and Monsters | data structures geometry | Statement | F | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 3100 | |
| 8000 | Oleg and shares | implementation math | Statement | A | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 1000 | |
| 4827 | Igor and his way to work | dfs and similar graphs implementation shortest paths | Statement | B | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 1600 | |
| 1704 | Presents in Bankopolis | dp graphs shortest paths | Statement | D | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2100 | |
| 1355 | Mice problem | geometry implementation math sortings | Statement | C | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2200 | |
| 305 | Problem of offices | constructive algorithms dfs and similar dp trees | Statement | E | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2800 | |
| 796 | Julia the snail | data structures divide and conquer dp | Statement | F | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 2900 | |
| 452 | Oleg and chess | data structures divide and conquer flows graph matchings | Statement | G | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 3100 | |
| 7254 | Cutting Carrot | geometry math | Statement | B | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | Editorial | 1300 | |
| 3326 | Naming Company | games greedy sortings | Statement | C | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 1800 | ||
| 910 | Labelling Cities | dfs and similar graphs hashing | Statement | D | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2400 | ||
| 1023 | Choosing Carrot | games math | Statement | E | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2700 | ||
| 981 | Leha and security system | data structures | Statement | F | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 2800 | ||
| 403 | Replace All | combinatorics dp math | Statement | G | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 3400 | ||
| 7765 | Bank Robbery | brute force implementation | Statement | A | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 900 | ||
| 9734 | Find The Bone | implementation | Statement | B | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 1300 | |
| 3225 | Bank Hacking | constructive algorithms data structures dp trees | Statement | C | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 1900 | |
| 7167 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 204 | Sequence Recovery | bitmasks data structures greedy | Statement | F | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2800 | |
| 730 | Exam Cheating | binary search dp | Statement | E | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2800 | |
| 13801 | Buying A House | brute force implementation | Statement | A | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 900 | |
| 19807 | k-Factorization | implementation math number theory | Statement | A | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 1100 | |
| 11501 | Odd sum | dp greedy implementation | Statement | B | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 1400 | |
| 9814 | Minimal string | data structures greedy strings | Statement | C | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 1700 | |
| 5586 | Array Queries | brute force data structures dp | Statement | E | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 2000 | |
| 2178 | Broken BST | data structures dfs and similar | Statement | D | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 2200 | |
| 1463 | Mice and Holes | data structures dp greedy sortings | Statement | F | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 2600 | |
| 23812 | Mike and palindrome | brute force constructive algorithms strings | Statement | A | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 1100 | |
| 9199 | Mike and strings | brute force dp strings | Statement | B | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 1300 | |
| 6367 | Mike and gcd problem | dp greedy number theory | Statement | C | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 1700 | |
| 2166 | Mike and distribution | constructive algorithms sortings | Statement | D | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 2300 | |
| 545 | Mike and code of a permutation | constructive algorithms data structures graphs sortings | Statement | E | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 2700 | |
| 21260 | Carrot Cakes | brute force implementation | Statement | A | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 1200 | |
| 10144 | T-shirt buying | data structures implementation | Statement | B | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 1400 | |
| 4051 | Fountains | binary search data structures implementation | Statement | C | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 1700 | |
| 2181 | Field expansion | brute force dp meet-in-the-middle | Statement | D | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 2000 | |
| 1050 | Aquarium decoration | data structures greedy two pointers | Statement | E | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 2500 | |
| 122 | Cut the pie | binary search data structures geometry | Statement | G | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 2600 | |
| 513 | Beautiful fountains rows | data structures | Statement | F | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 3300 | |
| 11193 | Valued Keys | constructive algorithms greedy strings | Statement | B | Codeforces Round 409 (rated, Div. 2, based on VK Cup 2017 Round 2) {801} | PROGRAMMING | 1000 | ||
| 7655 | Vicious Keyboard | brute force | Statement | A | Codeforces Round 409 (rated, Div. 2, based on VK Cup 2017 Round 2) {801} | PROGRAMMING | 1100 | ||
| 7917 | Fake News (easy) | implementation | Statement | G | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1000 | |
| 3668 | April Fools' Problem (easy) | greedy sortings | Statement | M1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1200 | |
| 3620 | April Fools' Problem (easy) | greedy sortings | Statement | M | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1300 | |
| 6526 | Send the Fool Further! (easy) | dfs and similar graphs trees | Statement | J1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1400 | |
| 6421 | Send the Fool Further! (easy) | dfs and similar graphs trees | Statement | J | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1500 | |
| 1340 | Heidi and Library (medium) | data structures greedy | Statement | A2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1800 | |
| 1596 | Heidi and Library (easy) | greedy | Statement | A1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1800 | |
| 1581 | Heidi and Library (easy) | greedy | Statement | A | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1800 | |
| 1328 | Heidi and Library (medium) | data structures greedy | Statement | B | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1900 | |
| 726 | Send the Fool Further! (medium) | dp trees | Statement | K | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2100 | |
| 735 | Send the Fool Further! (medium) | dp trees | Statement | J2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2100 | |
| 553 | Marmots (easy) | math | Statement | D1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2100 | |
| 541 | Marmots (easy) | math | Statement | D | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2100 | |
| 332 | Marmots (medium) | math | Statement | D2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2200 | |
| 552 | Fake News (medium) | constructive algorithms strings | Statement | G2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2200 | |
| 1832 | Fake News (hard) | string suffix structures | Statement | G3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2300 | |
| 369 | Send the Fool Further! (hard) | dfs and similar dp math trees | Statement | J3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 295 | Marmots (medium) | math | Statement | E | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 544 | Fake News (medium) | constructive algorithms strings | Statement | H | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 1815 | Fake News (hard) | string suffix structures | Statement | I | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 1488 | April Fools' Problem (medium) | binary search flows graphs | Statement | M2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 1464 | April Fools' Problem (medium) | binary search flows graphs | Statement | N | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2500 | |
| 699 | Heidi and Library (hard) | flows graphs | Statement | A3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2600 | |
| 685 | Heidi and Library (hard) | flows | Statement | C | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2700 | |
| 364 | Send the Fool Further! (hard) | dfs and similar dp math trees | Statement | L | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2800 | |
| 151 | Marmots (hard) | math probabilities | Statement | F | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2800 | |
| 153 | Marmots (hard) | math probabilities | Statement | D3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2800 | |
| 1295 | April Fools' Problem (hard) | binary search data structures flows | Statement | M3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2900 | |
| 1264 | April Fools' Problem (hard) | binary search data structures flows | Statement | O | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 3200 | |
| 8122 | Fake News (easy) | implementation strings | Statement | G1 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 800 | |
| 7568 | Distances to Zero | constructive algorithms | Statement | B | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1200 | |
| 5355 | Maximal Binary Matrix | constructive algorithms | Statement | A | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1500 | |
| 4035 | Magazine Ad | binary search greedy | Statement | D | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1900 | |
| 5810 | Maximal GCD | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 2000 | |
| 2642 | Roma and Poker | dp graphs | Statement | E | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 2100 | |
| 4619 | Coprime Subsequences | bitmasks combinatorics number theory | Statement | F | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 2100 | |
| 1884 | Periodic RMQ Problem | data structures | Statement | G | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 2500 | |
| 16487 | Find Amir | constructive algorithms greedy math | Statement | A | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 1100 | |
| 10155 | Minimum number of steps | combinatorics greedy implementation math | Statement | B | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 1400 | |
| 1929 | Ice cream coloring | constructive algorithms dfs and similar greedy | Statement | C | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 2200 | |
| 1556 | Expected diameter of a tree | binary search brute force dfs and similar dp sortings trees | Statement | D | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 2600 | |
| 654 | The same permutation | constructive algorithms | Statement | E | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3100 | |
| 215 | Fake bullions | combinatorics dfs and similar dp graphs number theory | Statement | F | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3400 | |
| 19155 | Fake NP | greedy math | Statement | A | Codeforces Round 411 (Div. 2) {805} | PROGRAMMING | 51846 | 1000 | |
| 18735 | 3-palindrome | constructive algorithms | Statement | B | Codeforces Round 411 (Div. 2) {805} | PROGRAMMING | 51846 | 1000 | |
| 3665 | T-Shirt Hunt | brute force implementation | Statement | B | Codeforces Round 412 (rated, Div. 2, base on VK Cup 2017 Round 3) {807} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 1300 | |
| 23206 | Is it rated? | implementation sortings | Statement | A | Codeforces Round 412 (rated, Div. 2, base on VK Cup 2017 Round 3) {807} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 900 | |
| 10983 | Lucky Year | implementation | Statement | A | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1000 | |
| 14666 | Average Sleep Time | data structures implementation math | Statement | B | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1300 | |
| 6970 | Tea Party | constructive algorithms greedy sortings | Statement | C | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1500 | |
| 8077 | Array Division | binary search data structures implementation | Statement | D | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 1900 | |
| 2187 | Selling Souvenirs | binary search dp greedy ternary search | Statement | E | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 | |
| 3745 | Anthem of Berland | dp strings | Statement | G | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 | |
| 1565 | Card Game | binary search flows graphs | Statement | F | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2500 | |
| 4870 | Do you want a date? | implementation math sortings | Statement | A | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 1500 | |
| 1772 | Glad to see you! | binary search interactive | Statement | B | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 2200 | |
| 1027 | Hitchhiking in the Baltic States | data structures dp | Statement | D | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 2800 | |
| 907 | Find a car | combinatorics divide and conquer dp | Statement | C | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 2900 | |
| 855 | Surprise me! | divide and conquer math number theory trees | Statement | E | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 52099 | 3000 | |
| 9258 | Straight <<A>> | implementation math | Statement | A | Codeforces Round 415 (Div. 2) {810} | PROGRAMMING | 52099 | 1000 | |
| 12576 | Summer sell-off | greedy sortings | Statement | B | Codeforces Round 415 (Div. 2) {810} | PROGRAMMING | 52099 | 1300 | |
| 6788 | Vladik and Complicated Book | implementation sortings | Statement | B | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | Editorial | 1300 | |
| 3492 | Vladik and Memorable Trip | dp implementation | Statement | C | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | 1800 | ||
| 1900 | Vladik and Favorite Game | constructive algorithms dfs and similar graphs interactive | Statement | D | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | 2000 | ||
| 978 | Vladik and Entertaining Flags | data structures dsu graphs | Statement | E | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | Editorial | 2600 | |
| 12361 | Vladik and Courtesy | brute force implementation | Statement | A | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | Editorial | 900 | |
| 6445 | Sagheer and Crossroads | implementation | Statement | A | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 1300 | |
| 17444 | Sagheer and Nubian Market | binary search sortings | Statement | C | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 1500 | |
| 5519 | Sagheer, the Hausmeister | bitmasks brute force dp | Statement | B | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 1600 | |
| 1321 | Sagheer and Apple Tree | games trees | Statement | E | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 2200 | |
| 349 | Sagheer and Kindergarten | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 2700 | |
| 5430 | The Contest | implementation | Statement | A | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 1200 | |
| 8113 | The Tag Game | dfs and similar graphs | Statement | C | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 1700 | |
| 4433 | The Golden Age | brute force math | Statement | B | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 1700 | |
| 3052 | Army Creation | binary search data structures | Statement | E | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2300 | |
| 1699 | Bipartite Checking | data structures dsu graphs | Statement | F | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2600 | |
| 1152 | Two Melodies | dp flows | Statement | D | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2700 | |
| 11039 | An abandoned sentiment from past | constructive algorithms greedy implementation sortings | Statement | A | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 1000 | |
| 5882 | An express train to reveries | constructive algorithms | Statement | B | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 1300 | |
| 7715 | An impassioned circulation of affection | brute force dp strings two pointers | Statement | C | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 1600 | |
| 2577 | An overnight dance in discotheque | dfs and similar dp geometry greedy trees | Statement | D | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 2000 | |
| 725 | An unavoidable detour for home | combinatorics dp graphs shortest paths | Statement | E | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 2700 |