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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1456 | Hot Bath | binary search brute force math | Statement | A | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1900 | |
| 9308 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | 1100 | ||
| 7702 | Non-square Equation | binary search brute force math | Statement | B | Codeforces Round 144 (Div. 2) {233} | PROGRAMMING | Editorial for Codeforces Round #144 | 1500 | |
| 902 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 2075 | Mr. Bender and Square | binary search implementation math | Statement | D | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1900 | |
| 1825 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 10387 | Pipeline | binary search math | Statement | B | Codeforces Round 176 (Div. 2) {287} | PROGRAMMING | Разбор задач | 1700 | |
| 3668 | Ciel and Robot | binary search implementation math | Statement | A | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 1700 | |
| 1589 | Stadium and Games | binary search math | Statement | B | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1800 | |
| 2522 | Making Sequences is Fun | binary search implementation math | Statement | B | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1600 | |
| 1447 | Number Busters | binary search math | Statement | B | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2000 | |
| 6441 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 2473 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 2474 | Hack it! | binary search constructive algorithms math | Statement | C | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2800 | |
| 3600 | MUH and House of Cards | binary search brute force greedy math | Statement | C | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1700 | |
| 4134 | Friends and Presents | binary search math | Statement | B | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1800 | |
| 3824 | Tavas and Karafs | binary search greedy math | Statement | C | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1900 | |
| 5912 | Tourist's Notes | binary search brute force greedy implementation math | Statement | C | Codeforces Round 300 {538} | PROGRAMMING | 1600 | ||
| 2025 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 2157 | Kyoya and Permutation | binary search combinatorics constructive algorithms greedy implementation math | Statement | B | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | 2200 | ||
| 887 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 2500 | ||
| 6029 | Bear and Blocks | binary search data structures dp math | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1800 | |
| 1938 | Chip 'n Dale Rescue Rangers | binary search geometry math | Statement | B | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | 2100 | ||
| 2968 | Pasha and Phone | binary search math | Statement | B | Codeforces Round 330 (Div. 2) {595} | PROGRAMMING | 1600 | ||
| 1004 | Hexagons | binary search implementation math | Statement | E | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 2200 | |
| 601 | Optimal Point | binary search math | Statement | C | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | 2800 | ||
| 5611 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 1700 | ||
| 3227 | As Fast As Possible | binary search math | Statement | A | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 1900 | |
| 9844 | Sanatorium | binary search constructive algorithms greedy implementation math | Statement | C | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 1300 | ||
| 6627 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 81038 | New Year and Hurry | binary search brute force implementation math | Statement | A | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 800 | |
| 3912 | Unfair Poll | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1700 | |
| 4514 | Voltage Keepsake | binary search math | Statement | A | VK Cup 2017 - Round 2 {772} | PROGRAMMING | 1800 | ||
| 4557 | Success Rate | binary search math | Statement | A | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 1700 | ||
| 966 | Prairie Partition | binary search constructive algorithms greedy math | Statement | C | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2300 | ||
| 6035 | 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 | |
| 7525 | Anton and Fairy Tale | binary search math | Statement | C | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 1600 | |
| 7726 | Really Big Numbers | binary search brute force dp math | Statement | C | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1600 | |
| 466 | Strange Radiation | binary search implementation math | Statement | C | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | 2500 | ||
| 1852 | Vasya's Function | binary search implementation math | Statement | E | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2200 | |
| 588 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 4384 | Save Energy! | binary search implementation math | Statement | A | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 1700 | |
| 2634 | Sand Fortress | binary search constructive algorithms math | Statement | D | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2100 | |
| 9252 | World Cup | binary search math | Statement | B | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1300 | |
| 8208 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 670 | Write The Contest | binary search dp math | Statement | F | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2400 | |
| 12765 | Meme Problem | binary search math | Statement | C | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1300 | |
| 11267 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 10315 | NN and the Optical Illusion | binary search geometry math | Statement | C | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 6428 | Creative Snap | binary search brute force divide and conquer math | Statement | C | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1700 | |
| 2213 | Cute Sequences | binary search brute force greedy math | Statement | D | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2100 | |
| 14386 | Computer Game | binary search math | Statement | C | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 20513 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 426 | You Are Given Some Letters... | binary search implementation math | Statement | F | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2800 | |
| 3527 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 1534 | Numerical Sequence (hard version) | binary search math | Statement | E2 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 15216 | Creating a Character | binary search math | Statement | A | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1300 | |
| 22472 | Perfect Team | binary search math | Statement | C | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1200 | |
| 4201 | Divide The Students | binary search greedy math | Statement | L | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1700 | ||
| 16127 | Obtain Two Zeroes | binary search math | Statement | B | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1200 | |
| 3519 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 1302 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 6795 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 1209 | Résumé Review | binary search greedy math | Statement | D | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1750.0 | Codeforces Round #639 Editorial | 2700 |
| 27156 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 9031 | Phoenix and Science | binary search bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2000.0 | Codeforces Round #638 (Div. 2) Editorial | 1900 |
| 59493 | K-th Not Divisible by n | binary search math | Statement | C | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1200 | |
| 6166 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 14239 | Mixing Water | binary search math | Statement | C | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1700 | |
| 551 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 4151 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 31180 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial |