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 |
|---|---|---|---|---|---|---|---|---|---|
| 4505 | Identify the Operations | brute force combinatorics data structures ds greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 1568 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 7987 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 416 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 1830 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 10766 | Fault-tolerant Network | brute force data structures implementation | Statement | C | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 8704 | Monoblock | brute force combinatorics data structures divide and conquer greedy implementation | Statement | C | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 11014 | Counting Rectangles | brute force data structures dp implementation | Statement | E | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1600 | |
| 8758 | Balance (Easy version) | brute force data structures implementation | Statement | D1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 1500 |
| 11236 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 1409 | Rebrending | brute force data structures dp implementation | Statement | F | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 3250.0 | Codeforces Round #852 Editorial | |
| 16776 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 70 | Next and Prev | brute force data structures implementation | Statement | F | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 3500.0 | Tutorial | 3200 |
| 5608 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar ds graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 15641 | Anya and 1100 | brute force data structures implementation | Statement | C | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING |