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 |
|---|---|---|---|---|---|---|---|---|---|
| 507 | Need For Brake | binary search greedy sortings | Statement | B | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2000 | |
| 10095 | k-Multiple Free Set | binary search greedy sortings | Statement | A | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 1600 | |
| 2109 | Preparing for the Contest | binary search data structures greedy sortings | Statement | B | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | 2100 | ||
| 7767 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 4816 | One-Dimensional Battle Ships | binary search data structures greedy sortings | Statement | D | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1800 | |
| 3938 | Road to Cinema | binary search greedy sortings | Statement | C | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 5562 | Exams | binary search greedy sortings | Statement | D | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 1700 | ||
| 2465 | Fedor and coupons | binary search data structures greedy sortings | Statement | D | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2000 | ||
| 4066 | Dasha and Very Difficult Problem | binary search brute force constructive algorithms greedy sortings | Statement | D | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | 1700 | ||
| 4603 | Hacker, pack your bags! | binary search greedy implementation sortings | Statement | C | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | 1600 | ||
| 7106 | Office Keys | binary search brute force dp greedy sortings | Statement | A | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | 1900 | ||
| 4746 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | 1800 | ||
| 832 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 2400 | ||
| 1919 | Water Taps | binary search greedy sortings | Statement | E | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2000 | |
| 962 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 2300 | ||
| 1012 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 | |
| 11203 | Alyona and a Narrow Fridge | binary search flows greedy sortings | Statement | B | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1300 | |
| 14889 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 24143 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 4356 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 6033 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 3870 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 6448 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 34931 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 |