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 ... 40 41 42 43 44 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 935 | Death Stars (medium) | hashing strings | Statement | A2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 2100 | ||
| 991 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 2300 | ||
| 684 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 2400 | ||
| 724 | Lightsabers (hard) | fft | Statement | F3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 605 | Encryption (hard) | data structures dp | Statement | C3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 195 | Guard Duty (hard) | geometry | Statement | E3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2800 | |
| 88 | Hyperspace Jump (hard) | Statement | D2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 3000 | |||
| 46 | Death Stars (hard) | Statement | A3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 3100 | |||
| 9767 | Mahmoud and Ehab and the message | ds greedy implementation | Statement | B | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | 1300 | ||
| 5830 | Mahmoud and Ehab and the wrong algorithm | constructive algorithms trees | Statement | C | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | 1500 | ||
| 3504 | Mahmoud and Ehab and the xor-MST | bitmasks dp graphs implementation math | Statement | E | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1900 | |
| 3137 | Mahmoud and Ehab and another array construction task | constructive algorithms greedy math number theory | Statement | D | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2000 | |
| 2187 | Mahmoud and Ehab and yet another xor task | bitmasks dp math matrices | Statement | F | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2600 | |
| 48952 | Mahmoud and Ehab and the even-odd game | games math | Statement | A | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 600 | |
| 8287 | Check the string | implementation | Statement | A | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1200 | |
| 8469 | Minimize the error | data structures greedy sortings | Statement | B | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | 1500 | ||
| 3946 | Subsequence Counting | bitmasks constructive algorithms greedy implementation | Statement | C | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | 1700 | ||
| 3021 | Pathwalks | data structures dp graphs | Statement | F | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2000 | |
| 1888 | Full Binary Tree Queries | brute force implementation trees | Statement | D | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2100 | |
| 1977 | Alternating Tree | combinatorics dfs and similar divide and conquer dp probabilities trees | Statement | E | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2200 | |
| 1089 | Bandit Blues | combinatorics dp fft math | Statement | G | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2800 | |
| 294 | Santa's Gift | data structures trees | Statement | H | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 3000 | |
| 21608 | Lecture Sleep | data structures dp implementation two pointers | Statement | B | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | 1300 | ||
| 5339 | Chessboard | bitmasks brute force implementation | Statement | C | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1400 | |
| 3731 | Tufurama | data structures | Statement | E | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1900 | |
| 4391 | Pair Of Lines | geometry | Statement | D | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1900 | |
| 1375 | Partitions | combinatorics math number theory | Statement | G | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 819 | k-substrings | binary search hashing string suffix structures | Statement | F | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 10171 | Tetris | implementation | Statement | A | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 900 | |
| 7762 | Students in Railway Carriage | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1300 | |
| 12901 | Equator | implementation | Statement | A | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1300 | |
| 7949 | Make a Square | brute force implementation math | Statement | C | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1400 | |
| 6992 | Merge Equals | data structures implementation | Statement | D | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1600 | |
| 1097 | Byteland, Berland and Disputed Cities | constructive algorithms greedy | Statement | E | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2200 | |
| 1366 | Simple Cycles Edges | dfs and similar graphs trees | Statement | F | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2400 | |
| 185 | Visible Black Areas | data structures ds geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 3381 | Alternating Sum | math number theory | Statement | A | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 1800 | |
| 2864 | Destruction of a Tree | constructive algorithms dfs and similar dp greedy trees | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2100 | |
| 2099 | Frequency of String | hashing string suffix structures strings | Statement | D | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2400 | |
| 596 | Cutting Rectangle | brute force math number theory | Statement | C | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2600 | |
| 562 | Circles of Waiting | math | Statement | E | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 3100 | |
| 4406 | Messages | math | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2) {964} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 1300 | |
| 9759 | Splits | math | Statement | A | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2) {964} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 900 | |
| 4603 | Battleship | implementation | Statement | B | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1300 | |
| 3156 | Single-use Stones | binary search flows greedy two pointers | Statement | D | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 2125 | Greedy Arkady | math | Statement | C | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 1548 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 9699 | Paper Airplanes | math | Statement | A | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 900 | |
| 7264 | Watering System | math sortings | Statement | B | Codeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3) {967} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1000 | |
| 4401 | Mind the Gap | implementation | Statement | A | Codeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3) {967} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1200 | |
| 9430 | Aramic script | implementation strings | Statement | A | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1000 | |
| 6897 | Mancala | brute force implementation | Statement | B | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1200 | |
| 9856 | Valhalla Siege | binary search | Statement | C | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1400 | |
| 2260 | Ghosts | geometry math | Statement | D | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 2000 | |
| 311 | Hag's Khashba | geometry | Statement | E | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 3000 | |
| 5772 | Lara Croft and the New Game | implementation math | Statement | B | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 1300 | |
| 7279 | Nested Segments | greedy implementation sortings | Statement | C | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 1500 | |
| 2422 | Well played! | greedy sortings | Statement | E | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2100 | |
| 694 | Degree Set | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2400 | |
| 595 | Minimal k-covering | flows graphs | Statement | F | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2500 | |
| 10608 | Minimum Binary Number | implementation | Statement | A | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 800 | |
| 36156 | Less or Equal | sortings | Statement | C | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1200 | |
| 18746 | Divide by three, multiply by two | dfs and similar math sortings | Statement | D | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1400 | |
| 21416 | Cyclic Components | dfs and similar ds graphs | Statement | E | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1500 | |
| 20108 | Consecutive Subsequence | dp | Statement | F | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1700 | |
| 177093 | Wrong Subtraction | implementation | Statement | A | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 500 | |
| 41094 | Two-gram | implementation strings | Statement | B | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 900 | |
| 26314 | Letters | binary search implementation two pointers | Statement | C | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1000 | |
| 9720 | Bus Video System | combinatorics math | Statement | E | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1400 | |
| 8475 | Mentors | binary search data structures implementation | Statement | F | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 8980 | Almost Arithmetic Progression | brute force implementation math | Statement | D | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 4443 | Petya's Exams | greedy implementation sortings | Statement | G | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1800 | |
| 37145 | File Name | greedy strings | Statement | B | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 700 | |
| 27674 | Remove Duplicates | implementation | Statement | A | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 800 | |
| 13944 | Pizza, Pizza, Pizza!!! | math | Statement | A | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1000 | |
| 6483 | Kuro and Walking Route | dfs and similar trees | Statement | C | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1600 | |
| 4459 | Treasure Hunt | greedy | Statement | B | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1800 | |
| 1887 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp ds greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 693 | Kuro and Topological Parity | dp | Statement | E | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 2800 | |
| 4759 | Marlin | constructive algorithms | Statement | B | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1600 | |
| 3809 | Posterized | games greedy | Statement | C | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1700 | |
| 2751 | Perfect Groups | dp math number theory | Statement | D | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2100 | |
| 1960 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 200 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 10497 | Links and Pearls | implementation math | Statement | A | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 900 | |
| 7042 | Businessmen Problems | sortings | Statement | B | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1000 | |
| 9620 | Antipalindrome | brute force implementation strings | Statement | A | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1000 | |
| 5608 | Useful Decomposition | implementation trees | Statement | C | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1400 | |
| 3290 | Bookshelves | bitmasks dp greedy | Statement | D | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1800 | |
| 2172 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 701 | Magic multisets | data structures | Statement | G | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2400 | |
| 799 | Round Marriage | binary search graph matchings greedy | Statement | F | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2500 | |
| 272 | K Paths | combinatorics data structures dp fft math | Statement | H | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2900 | |
| 9142 | Row | brute force constructive algorithms | Statement | A | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1200 | |
| 8440 | Bus of Characters | data structures greedy implementation | Statement | B | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1300 | |
| 11973 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 2363 | Shark | brute force data structures ds trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 726 | Billiard | geometry number theory | Statement | E | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 2500 | |
| 198 | The Meeting Place Cannot Be Changed | dfs and similar graphs | Statement | F | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 2800 | |
| 4578 | Finite or not? | implementation math | Statement | A | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1700 |