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 ... 31 32 33 34 35 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9232 | Santa Claus and Candies | dp greedy math | Statement | A | Testing Round 13 {753} | PROGRAMMING | 1100 | ||
| 1221 | Interactive Bulls and Cows (Easy) | brute force constructive algorithms implementation | Statement | B | Testing Round 13 {753} | PROGRAMMING | 1600 | ||
| 312 | Interactive Bulls and Cows (Hard) | brute force constructive algorithms interactive | Statement | C | Testing Round 13 {753} | PROGRAMMING | 2400 | ||
| 7269 | Ilya and tic-tac-toe game | brute force implementation | Statement | B | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | Editorial | 1200 | |
| 8812 | Lesha and array splitting | constructive algorithms greedy implementation | Statement | A | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | Editorial | 1300 | |
| 2473 | Fedor and coupons | binary search data structures greedy sortings | Statement | D | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2000 | ||
| 951 | Vladik and chat | brute force constructive algorithms dp implementation strings | Statement | C | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2200 | ||
| 505 | Dasha and cyclic table | bitmasks brute force fft strings trees | Statement | E | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2800 | ||
| 11459 | PolandBall and Game | binary search data structures games greedy sortings strings | Statement | B | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1200 | |
| 12782 | PolandBall and Forest | dfs and similar ds graphs interactive trees | Statement | C | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 1300 | ||
| 2546 | PolandBall and Polygon | data structures | Statement | D | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2000 | |
| 859 | PolandBall and White-Red graph | constructive algorithms graphs shortest paths | Statement | E | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 2400 | ||
| 1467 | PolandBall and Gifts | bitmasks dp greedy | Statement | F | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2600 | |
| 931 | PolandBall and Many Other Balls | combinatorics divide and conquer dp fft math number theory | Statement | G | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 3100 | |
| 18352 | PolandBall and Hypothesis | brute force graphs math number theory | Statement | A | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 900 | |
| 3076 | Pavel and barbecue | constructive algorithms dfs and similar | Statement | A | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 1600 | ||
| 3836 | Travel Card | binary search dp | Statement | B | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 1700 | ||
| 1360 | Nikita and stack | data structures | Statement | C | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 2300 | ||
| 1013 | Bacterial Melee | brute force combinatorics dp string suffix structures | Statement | D | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 2500 | ||
| 103 | Long number | expression parsing math number theory | Statement | F | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 3200 | |
| 187 | Byteland coins | combinatorics dp math | Statement | E | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 3200 | ||
| 11329 | Gotta Catch Em' All! | implementation | Statement | A | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 1100 | |
| 10453 | Bash's Big Day | greedy math number theory | Statement | B | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 1400 | |
| 2387 | Felicity is Coming! | data structures hashing sortings strings | Statement | C | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | 1900 | ||
| 1415 | Felicity's Big Secret Revealed | bitmasks dp | Statement | D | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | 2200 | ||
| 1375 | Bash Plays with Functions | brute force combinatorics dp number theory | Statement | E | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2400 | |
| 520 | Can Bash Save the Day? | data structures divide and conquer graphs trees | Statement | G | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | 2500 | ||
| 1194 | Team Rocket Rises Again | data structures graphs shortest paths | Statement | F | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | 2700 | ||
| 10273 | Blown Garland | brute force implementation number theory | Statement | B | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1200 | |
| 3901 | Unfair Poll | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1700 | |
| 2760 | Ability To Convert | constructive algorithms dp greedy math strings | Statement | D | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1900 | |
| 647 | Geometrical Progression | brute force math number theory | Statement | F | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 2500 | |
| 500 | Broken Tree | dfs and similar dp graphs greedy trees | Statement | E | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | 2900 | ||
| 63326 | Holiday Of Equality | implementation math | Statement | A | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 700 | |
| 6736 | Frodo and pillows | binary search greedy | Statement | B | Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition) {760} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1500 | |
| 8276 | Petr and a calendar | implementation math | Statement | A | Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition) {760} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 900 | |
| 14614 | Dasha and Stairs | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1100 | |
| 6906 | Dasha and friends | brute force implementation math | Statement | B | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | 1300 | ||
| 5910 | Dasha and Password | brute force dp implementation | Statement | C | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1600 | |
| 4082 | Dasha and Very Difficult Problem | binary search brute force constructive algorithms greedy sortings | Statement | D | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | 1700 | ||
| 2197 | Dasha and Puzzle | constructive algorithms dfs and similar graphs greedy trees | Statement | E | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 2000 | |
| 417 | Dasha and Photos | brute force data structures dp implementation | Statement | F | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | 2900 | ||
| 8555 | USB vs. PS/2 | greedy implementation sortings two pointers | Statement | B | Educational Codeforces Round 17 {762} | PROGRAMMING | 1400 | ||
| 20722 | k-th divisor | math number theory | Statement | A | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 1500 | |
| 2609 | Two strings | binary search hashing strings two pointers | Statement | C | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2100 | |
| 1441 | Radio stations | binary search data structures | Statement | E | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 1596 | Maximum path | dp greedy implementation | Statement | D | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 384 | Tree nesting | combinatorics graphs trees | Statement | F | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2900 | |
| 10788 | Timofey and a tree | dfs and similar dp ds graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 2838 | Timofey and rectangles | constructive algorithms geometry | Statement | B | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2200 | |
| 714 | Timofey and remoduling | brute force implementation math number theory | Statement | C | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2500 | |
| 512 | Timofey and our friends animals | data structures divide and conquer ds | Statement | E | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | 2800 | ||
| 574 | Timofey and a flat tree | data structures graphs hashing shortest paths trees | Statement | D | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | 2800 | ||
| 12006 | Timofey and cubes | constructive algorithms implementation | Statement | B | Codeforces Round 395 (Div. 2) {764} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1000 | |
| 16454 | Taymyr is calling you | brute force implementation math | Statement | A | Codeforces Round 395 (Div. 2) {764} | PROGRAMMING | Codeforces Round #395 [Editorial] | 800 | |
| 7154 | 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 | |
| 7023 | 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 | |
| 2493 | Artsem and Saunders | constructive algorithms ds math | Statement | D | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 1700 | |
| 1296 | 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 | |
| 2139 | 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 | |
| 87 | 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 | |
| 9090 | 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 | |
| 31253 | Mahmoud and Longest Uncommon Subsequence | constructive algorithms strings | Statement | A | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1000 | |
| 33763 | 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 | |
| 4542 | Mahmoud and a Message | brute force dp greedy strings | Statement | C | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | 1700 | ||
| 3461 | Mahmoud and a Dictionary | data structures dfs and similar dp ds graphs | Statement | D | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | 2000 | ||
| 3092 | 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 | 2200 | ||
| 20780 | Snacktower | data structures implementation | Statement | A | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | Codeforces Round #398 (Div. 2) Editorial | 1200 | |
| 2153 | The Queue | brute force greedy | Statement | B | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | 2000 | ||
| 4252 | Garland | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | 2000 | ||
| 2262 | Cartons of milk | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | 2000 | ||
| 1010 | Change-free | greedy | Statement | E | Codeforces Round 398 (Div. 2) {767} | PROGRAMMING | 2700 | ||
| 28185 | 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 | |
| 6072 | 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 | |
| 3829 | 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 | |
| 3022 | 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 | |
| 3012 | 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 | |
| 1041 | 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 | |
| 373 | 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 | |
| 5926 | Year of University Entrance | *special implementation sortings | Statement | A | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1500 | |
| 3314 | News About Credit | *special greedy two pointers | Statement | B | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | 1600 | ||
| 2364 | k-Interesting Pairs Of Integers | *special bitmasks brute force meet-in-the-middle | Statement | D | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1800 | |
| 2384 | Cycle In Maze | *special dfs and similar graphs greedy shortest paths | Statement | C | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | 1800 | ||
| 20252 | New Password | *special implementation | Statement | A | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1500 | |
| 2882 | 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 | |
| 2689 | Online Courses In BSU | *special dfs and similar graphs implementation | Statement | C | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | 1900 | ||
| 1585 | Draw Brackets! | *special implementation | Statement | D | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1900 | |
| 15643 | Bear and Friendship Condition | dfs and similar ds graphs | Statement | A | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 1500 | |
| 6950 | Bear and Different Names | constructive algorithms greedy | Statement | B | VK Cup 2017 - Round 1 {771} | PROGRAMMING | 1500 | ||
| 3172 | Bear and Tree Jumps | dfs and similar dp trees | Statement | C | VK Cup 2017 - Round 1 {771} | PROGRAMMING | 2100 | ||
| 1364 | Bear and Company | dp | Statement | D | VK Cup 2017 - Round 1 {771} | PROGRAMMING | VK Cup 2017 Round 1 and CF Round 405 — Editorial | 2800 | |
| 507 | 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 | |
| 82 | Bear and Isomorphic Points | geometry two pointers | Statement | F | VK Cup 2017 - Round 1 {771} | PROGRAMMING | 3200 | ||
| 4456 | Voltage Keepsake | binary search math | Statement | A | VK Cup 2017 - Round 2 {772} | PROGRAMMING | 1800 | ||
| 3334 | Volatile Kite | geometry | Statement | B | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 1800 | |
| 1390 | 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 | |
| 605 | Varying Kibibits | bitmasks dp | Statement | D | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 2700 | |
| 157 | Verifying Kingdom | binary search divide and conquer interactive trees | Statement | E | VK Cup 2017 - Round 2 {772} | PROGRAMMING | 3200 | ||
| 4504 | Success Rate | binary search math | Statement | A | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 1700 | ||
| 1174 | Dynamic Problem Scoring | brute force greedy | Statement | B | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2100 |