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 | |
| 1238 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp ds graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 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 | |
| 9775 | Decode | brute force combinatorics implementation | Statement | E | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial |