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

Solved
Name
Tags
Solutions
Index
Contest
Type
Points
Tutorial
Rating Level
461 Tournament Construction constructive algorithms dp graphs greedy math Statement D Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} PROGRAMMING Codeforces Round #432 editorial 2700
966 Chaotic V. dp graphs greedy math number theory trees Statement D Codeforces Round 614 (Div. 1) {1292} PROGRAMMING 1750.0 Codeforces Round #614 Editorial 2700
9216 TediousLee dp graphs greedy math matrices trees Statement D Codeforces Round 652 (Div. 2) {1369} PROGRAMMING 2000.0 Codeforces Round #652 (Div. 2) Editorial 1900
489 Finding satisfactory solutions dp graphs greedy math Statement H Good Bye 2020 {1466} PROGRAMMING 3500.0 Good Bye 2020 Editorial
678 Multiset of Strings dp fft flows graphs greedy math Statement F Educational Codeforces Round 132 (Rated for Div. 2) {1709} PROGRAMMING 105164
2739 Candy Party (Hard Version) bitmasks constructive algorithms dp graphs greedy implementation math Statement B2 Codeforces Round 896 (Div. 1) {1868} PROGRAMMING 750.0 Codeforces Round 896 (Div. 1, Div. 2) Editorial
2169 Jellyfish and EVA dp graphs greedy math probabilities Statement C Codeforces Round 901 (Div. 1) {1874} PROGRAMMING 1500.0 Codeforces Round 901 (Div. 1, Div. 2) Editorial
1918 Digital Village (Easy Version) brute force data structures dp dsu graphs greedy implementation math shortest paths trees Statement E1 Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} PROGRAMMING 1750.0 Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial
676 Digital Village (Extreme Version) data structures dp graphs greedy math Statement E3 Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} PROGRAMMING 1000.0 Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial
105 Affectionate Arrays (Hard Version) data structures dp graphs greedy math shortest paths two pointers Statement I2 Good Bye 2024: 2025 is NEAR {2053} PROGRAMMING 2000.0 Good Bye 2024: 2025 is NEAR Editorial
1492 Gleb and Boating brute force constructive algorithms data structures dp graphs greedy math shortest paths Statement G Codeforces Round 1013 (Div. 3) {2091} PROGRAMMING Codeforces Round 1013 (Div. 3) Editorial