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
6452 Lorenzo Von Matterhorn brute force data structures implementation trees Statement A Codeforces Round 362 (Div. 1) {696} PROGRAMMING Codeforces Round #362 (Editorial) 1500
32589 Yet Another Card Deck brute force data structures implementation trees Statement C Educational Codeforces Round 107 (Rated for Div. 2) {1511} PROGRAMMING 89634
9160 Compression and Expansion brute force data structures greedy implementation trees Statement C Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} PROGRAMMING 1500.0 Deltix Round, Spring 2021. Editorial 1600
4627 Li Hua and Tree brute force data structures dfs and similar dp implementation trees Statement D Codeforces Round 864 (Div. 2) {1797} PROGRAMMING 1750.0 Codeforces Round 864 (Div. 2) Editorial
3896 Monsters brute force data structures dfs and similar dsu graphs implementation trees Statement E CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} PROGRAMMING 2000.0 Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)
2632 Happy Life in University brute force data structures dfs and similar dp implementation trees Statement E Good Bye 2023 {1916} PROGRAMMING 2000.0
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
565 23 Rises Again brute force data structures dfs and similar dp flows graphs implementation probabilities trees Statement H Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} PROGRAMMING 4000.0 Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial