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
< 1 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 911 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 228 | Cycle Closing | constructive algorithms graphs trees | Statement | F | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 3250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 4232 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 5065 | Catshock | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1750.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 17807 | Abraham's Great Escape | constructive algorithms graphs | Statement | B | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 288 | Distinct GCDs (Hard Version) | combinatorics constructive algorithms graphs graphs graphs math number theory number theory | Statement | F2 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 450 | Distinct GCDs (Easy Version) | constructive algorithms constructive algorithms graphs graphs number theory number theory | Statement | F1 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 16258 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 916 | Intercepting Butterflies | bitmasks constructive algorithms graphs interactive | Statement | C | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 6994 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 2283 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 118 | Indivisible | constructive algorithms graphs | Statement | F | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 3500.0 | Tutorial | |
| 718 | Simons and Reconstructing His Roads | constructive algorithms data structures dsu graphs meet-in-the-middle | Statement | F | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2750.0 | Tutorial | |
| 4783 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 833 | Oriented Journey | bitmasks communication constructive algorithms graphs hashing interactive trees | Statement | C | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1750.0 | 152930 | |
| 2046 | Permutation Commutation | constructive algorithms graphs greedy | Statement | E | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2250.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 102 | Even Simple Path | constructive algorithms graphs shortest paths | Statement | F | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 3500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial |