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
2280 Apple Tree dfs and similar number theory trees Statement B Codeforces Round 202 (Div. 1) {348} PROGRAMMING Editorial for Codeforces Round #202 2400
1739 Caisa and Tree brute force dfs and similar math number theory trees Statement E Codeforces Round 264 (Div. 2) {463} PROGRAMMING CF 264 Div 2 Tutorial 2400
3753 Ilya And The Tree dfs and similar graphs math number theory trees Statement C Codeforces Round 430 (Div. 2) {842} PROGRAMMING Tutorial Codeforces Round #430 (Div. 2) 2000
5406 GCD Counting data structures dfs and similar dp number theory trees Statement D Educational Codeforces Round 58 (Rated for Div. 2) {1101} PROGRAMMING 64483 2000
10501 Maximum Distributed Tree constructive algorithms dfs and similar greedy math number theory sortings trees Statement D Codeforces Round 665 (Div. 2) {1401} PROGRAMMING 1750.0 Codeforces Round #665 (Div. 2) Editorial
2551 Hemose in ICPC ? binary search dfs and similar divide and conquer interactive math number theory trees Statement D Codeforces Round 746 (Div. 2) {1592} PROGRAMMING 2000.0 95583
1008 Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees Statement E Codeforces Round 761 (Div. 2) {1617} PROGRAMMING 3000.0 Editorial for Codeforces Round #761 (Div. 2)
16207 Not Assigning constructive algorithms dfs and similar number theory trees Statement C Codeforces Round 766 (Div. 2) {1627} PROGRAMMING 1250.0 Codeforces Round #766 (Div. 2) Editorial
3057 Potion Brewing Class dfs and similar implementation math number theory trees Statement D Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} PROGRAMMING 2000.0 Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) 2100
1174 Tree Weights bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees Statement G Codeforces Round 884 (Div. 1 + Div. 2) {1844} PROGRAMMING 3500.0 Codeforces Round #884 (Div. 1 + Div. 2) Editorial
5833 Non Prime Tree brute force constructive algorithms dfs and similar greedy number theory trees two pointers Statement D Codeforces Round 992 (Div. 2) {2040} PROGRAMMING 2000.0 Codeforces Round #992 (Div.2) Editorial