Codeforces problemset search & solutions
Exclude tags.

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 2 3 ... 9 10 11

Solved
Name
Tags
Solutions
Index
Contest
Type
Points
Tutorial
Rating Level
21223 A Simple Sequence constructive algorithms dp greedy number theory Statement A Codeforces Round 1089 (Div. 2) {2210} PROGRAMMING 500.0 Codeforces Round 1089 (Div. 2) Editorial
2024 A Simple GCD Problem (Hard Version) dp greedy number theory Statement C2 Codeforces Round 1089 (Div. 2) {2210} PROGRAMMING 1000.0 Codeforces Round 1089 (Div. 2) Editorial
854 Learning Binary Search combinatorics divide and conquer dp Statement F Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} PROGRAMMING 3000.0 Nebius Round 2 and Codeforces Round 1088 Editorial
807 Minimum Path Cover dp interactive number theory trees Statement E Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} PROGRAMMING 2500.0 Nebius Round 2 and Codeforces Round 1088 Editorial
78 EXPloration, EXPloitation, and Gain Some EXPerience! bitmasks brute force dp greedy implementation Statement D Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} PROGRAMMING 2750.0
1768 Interval Mod constructive algorithms dp greedy math Statement A Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} PROGRAMMING 750.0
589 Interval Game bitmasks combinatorics dp games greedy math probabilities Statement F Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} PROGRAMMING 2750.0
157 Closer dp Statement H Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} PROGRAMMING 3750.0
918 Coloring a Red Black Tree dp greedy probabilities trees Statement C Codeforces Round 1093 (Div. 1) {2219} PROGRAMMING 1750.0