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 ... 38 39 40 41 42 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 211 | Power Substring | math number theory | Statement | G | Hello 2018 {913} | PROGRAMMING | Tutorial | 3100 | |
| 128 | Don't Exceed | math probabilities | Statement | H | Hello 2018 {913} | PROGRAMMING | Tutorial | 3400 | |
| 14329 | Perfect Squares | brute force implementation math | Statement | A | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1100 | |
| 8685 | Conan and Agasa play a Card Game | games greedy implementation | Statement | B | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1300 | |
| 3866 | Travelling Salesman and Special Numbers | brute force combinatorics dp | Statement | C | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1800 | |
| 5482 | Bash and a Tough Math Puzzle | data structures number theory | Statement | D | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | 1900 | ||
| 1541 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | 2400 | ||
| 953 | Sum the Fibonacci | bitmasks divide and conquer dp fft math | Statement | G | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2500 | |
| 1705 | Substrings in a String | bitmasks brute force data structures string suffix structures strings | Statement | F | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 240 | Ember and Storm's Tree Game | combinatorics dp games trees | Statement | H | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 7847 | Browser | implementation | Statement | B | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 1300 | ||
| 7128 | Permute Digits | dp greedy | Statement | C | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 1700 | |
| 3537 | Almost Acyclic Graph | dfs and similar graphs | Statement | D | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2200 | |
| 4591 | Physical Education Lessons | data structures implementation sortings | Statement | E | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2300 | |
| 2583 | Imbalance Value of a Tree | data structures ds graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 1301 | Coprime Arrays | math number theory | Statement | G | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 2500 | ||
| 14921 | Garden | implementation | Statement | A | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 900 | |
| 8676 | Jamie and Alarm Snooze | brute force implementation math | Statement | A | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1200 | |
| 5171 | Jamie and Interesting Graph | constructive algorithms graphs shortest paths | Statement | C | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | 1600 | ||
| 1924 | Jamie and Binary Sequence (changed after round) | bitmasks greedy math | Statement | B | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | 1700 | ||
| 1734 | Jamie and Tree | data structures trees | Statement | E | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | 2600 | ||
| 521 | Jamie and To-do List | data structures interactive trees | Statement | D | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | 2600 | ||
| 3582 | MADMAX | dfs and similar dp games graphs | Statement | B | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | 1800 | ||
| 3537 | The Monster | dp greedy implementation math | Statement | A | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1900 | |
| 1229 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 406 | Pollywog | combinatorics dp matrices | Statement | C | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | 2800 | ||
| 137 | Upside Down | data structures string suffix structures strings trees | Statement | E | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | 3000 | ||
| 17345 | Eleven | brute force implementation | Statement | A | Codeforces Round 459 (Div. 2) {918} | PROGRAMMING | E | 800 | |
| 17175 | Radio Station | implementation strings | Statement | B | Codeforces Round 459 (Div. 2) {918} | PROGRAMMING | 900 | ||
| 28775 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 9041 | Seat Arrangements | brute force implementation | Statement | C | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1300 | |
| 10405 | Substring | dfs and similar dp graphs | Statement | D | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1700 | |
| 2175 | Congruence Equation | chinese remainder theorem math number theory | Statement | E | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 2100 | |
| 343 | A Game With Numbers | games graphs shortest paths | Statement | F | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 2800 | |
| 16233 | Supermarket | brute force greedy implementation | Statement | A | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 900 | |
| 7859 | Water The Garden | implementation | Statement | A | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 1100 | ||
| 7459 | Tea Queue | implementation | Statement | B | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 1300 | ||
| 9429 | Swap Adjacent Elements | dfs and similar greedy math sortings two pointers | Statement | C | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 1500 | |
| 7099 | SUM and REPLACE | brute force data structures ds number theory | Statement | F | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2000 | |
| 6599 | Connected Components? | data structures dfs and similar ds graphs | Statement | E | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2100 | |
| 1778 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 741 | Tanks | dp greedy implementation | Statement | D | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 2600 | ||
| 0 | Labyrinth-9 | Statement | 09 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-8 | Statement | 08 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-7 | Statement | 07 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-6 | Statement | 06 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-5 | Statement | 05 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-4 | Statement | 04 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-3 | Statement | 03 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-2 | Statement | 02 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-14 | Statement | 14 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-13 | Statement | 13 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-12 | Statement | 12 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-11 | Statement | 11 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-10 | Statement | 10 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-1 | Statement | 01 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 8611 | Magic Forest | brute force | Statement | B | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1300 | |
| 11787 | Cloning Toys | implementation | Statement | A | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1400 | |
| 7228 | Cave Painting | brute force number theory | Statement | C | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1600 | |
| 4430 | Robot Vacuum Cleaner | greedy sortings | Statement | D | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1800 | |
| 2186 | Birds | dp | Statement | E | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 2300 | ||
| 648 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 7390 | Producing Snow | binary search data structures | Statement | B | VK Cup 2018 - Round 1 {923} | PROGRAMMING | 1600 | ||
| 5059 | Primal Sport | math number theory | Statement | A | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1700 | |
| 4358 | Perfect Security | data structures greedy strings trees | Statement | C | VK Cup 2018 - Round 1 {923} | PROGRAMMING | 1900 | ||
| 1206 | Picking Strings | constructive algorithms implementation strings | Statement | D | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 2500 | |
| 80 | Public Service | constructive algorithms graphs trees | Statement | F | VK Cup 2018 - Round 1 {923} | PROGRAMMING | 2900 | ||
| 463 | Perpetual Subtraction | fft math matrices | Statement | E | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 3100 | |
| 5076 | Mystical Mosaic | greedy implementation | Statement | A | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1400 | |
| 5364 | Three-level Laser | binary search greedy two pointers | Statement | B | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1600 | |
| 3898 | Riverside Curio | data structures dp greedy | Statement | C | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1800 | |
| 876 | Contact ATC | Statement | D | VK Cup 2018 - Round 2 {924} | PROGRAMMING | 2500 | |||
| 521 | Wardrobe | Statement | E | VK Cup 2018 - Round 2 {924} | PROGRAMMING | 2600 | |||
| 232 | Minimal Subset Difference | dp | Statement | F | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 3400 | |
| 3590 | Stairs and Elevators | binary search | Statement | A | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1700 | |
| 2214 | Resource Distribution | binary search implementation sortings | Statement | B | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1800 | |
| 1323 | Big Secret | constructive algorithms math | Statement | C | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2200 | |
| 528 | Aztec Catacombs | constructive algorithms | Statement | D | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2700 | |
| 412 | May Holidays | data structures trees | Statement | E | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2900 | |
| 117 | Parametric Circulation | binary search flows | Statement | F | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 3300 | |
| 3832 | 2-3-numbers | implementation math | Statement | A | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1300 | |
| 1894 | Is This a Zebra? | Statement | C | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1600 | ||
| 1495 | Large Bouquets | Statement | G | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1700 | ||
| 941 | Choose Place | Statement | D | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1800 | ||
| 1774 | Add Points | Statement | B | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1800 | ||
| 670 | A Vital Problem | Statement | I | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1900 | ||
| 937 | Merge Equal Elements | Statement | E | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | 2100 | |||
| 222 | Endless Roses Most Beautiful | Statement | H | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2300 | ||
| 243 | Mobile Communications | Statement | F | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2400 | ||
| 401 | Segments | data structures | Statement | J | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2500 | |
| 1 | BuberPool Taxi Optimization | Statement | A | VK Cup 2018 - Wild-card Round 2 {927} | PROGRAMMING | 2800 | |||
| 3421 | Login Verification | *special strings | Statement | A | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1600 | ||
| 2551 | Chat | *special dp | Statement | B | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1800 | ||
| 891 | Dependency management | *special graphs implementation | Statement | C | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2300 | ||
| 816 | Autocompletion | *special strings trees | Statement | D | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2400 | ||
| 2509 | Прокат велосипедов | *special greedy implementation | Statement | A | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | 1600 | ||
| 2049 | Места в самолёте | *special implementation | Statement | B | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | 1700 | ||
| 1162 | Красивая команда | *special combinatorics math | Statement | C | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | 2000 | ||
| 152 | Пограничные врата | Statement | D | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | 2600 | |||
| 7407 | Peculiar apple-tree | dfs and similar graphs trees | Statement | A | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | 1500 |