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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 7933 | Two Cakes | greedy | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1200 | |
| 3830 | Nastya Is Buying Lunch | greedy | Statement | D | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1800 | |
| 3891 | Same Sum Blocks (Easy) | greedy | Statement | F1 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2000 | |
| 14933 | Another One Bites The Dust | greedy | Statement | A | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 700 | |
| 9997 | Walking Robot | greedy | Statement | D | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1400 | |
| 14761 | Long Number | greedy | Statement | B | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 12671 | Increasing Subsequence (easy version) | greedy | Statement | C1 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 8065 | Increasing Subsequence (hard version) | greedy | Statement | C2 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 13030 | Good String | greedy | Statement | C | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1300 | |
| 16266 | Nauuo and Votes | greedy | Statement | A | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 700 | |
| 10463 | Prime Minister | greedy | Statement | A | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1100 | |
| 3584 | Complete the Projects (easy version) | greedy | Statement | F1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2100 | |
| 3873 | Increasing Matrix | greedy | Statement | C | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1100 | |
| 5140 | Too Many Segments (easy version) | greedy | Statement | D1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1900 | |
| 13134 | Minimize the Permutation | greedy | Statement | B | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1400 | |
| 12142 | Binary String Minimizing | greedy | Statement | D | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1500 | |
| 6932 | Platforms Jumping | greedy | Statement | C | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1700 | |
| 3296 | Elections | greedy | Statement | E | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1700 | |
| 8327 | Azamon Web Services | greedy | Statement | B | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 1500 | |
| 22934 | Display The Number | greedy | Statement | A | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 900 | |
| 10110 | Restoring Permutation | greedy | Statement | C | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1200 |
| 12455 | Unusual Competitions | greedy | Statement | A | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial |