Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9584 | New Year Permutation | dfs and similar dsu graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1600 | |
| 5947 | Sorting by Subsequences | dfs and similar dsu implementation math sortings | Statement | A | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1400 | |
| 9955 | Swap Adjacent Elements | dfs and similar greedy math sortings two pointers | Statement | C | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 1500 | |
| 20464 | Divide by three, multiply by two | dfs and similar math sortings | Statement | D | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1400 | |
| 1487 | Network Safety | dfs and similar dsu graphs math sortings | Statement | C | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2300 | |
| 2114 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 10501 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 745 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 1026 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 2258 | Sasha and the Wedding Binary Search Tree | combinatorics dfs and similar math sortings trees | Statement | F | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 3000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 5476 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 |