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
18755 Reposts *special dfs and similar dp graphs trees Statement A VK Cup 2015 - Qualification Round 1 {522} PROGRAMMING Разбор задач VK Cup 2015 — Квалификация 1 1700
2244 Road Improvement *special dfs and similar graphs greedy trees Statement C VK Cup 2016 - Qualification Round 2 {638} PROGRAMMING 2100
7435 Bmail Computer Network *special dfs and similar trees Statement A Mail.Ru Cup 2018 - Practice Round {1057} PROGRAMMING 1700
1539 Dynamic Diameter *special data structures dfs and similar divide and conquer trees Statement B CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} PROGRAMMING E
218 Modernization of Treeland *special dfs and similar trees Statement E Kotlin Heroes: Episode 3 {1297} PROGRAMMING Kotlin Heroes: Episode 3 Editorial
233 Star Trek *special combinatorics dfs and similar dp games graphs matrices trees Statement C Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} PROGRAMMING Editorial
393 Spring cleaning *special data structures dfs and similar graphs trees Statement B Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} PROGRAMMING CEOI 2020 Online Mirror — Day 2 Tutorial
304 Evidence Board *special constructive algorithms dfs and similar graphs trees Statement B XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} PROGRAMMING
43 Burenka and Pether *special data structures dfs and similar divide and conquer dsu graphs sortings trees Statement C XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} PROGRAMMING