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
524 Black Widow dp graphs implementation math Statement C Codeforces Round 366 (Div. 1) {704} PROGRAMMING Tutorial 2800
338 Perpetual Motion Machine constructive algorithms dp graphs implementation math trees Statement E Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} PROGRAMMING Codeforces Round #424 Editorial 3100
3755 Mahmoud and Ehab and the xor-MST bitmasks dp graphs implementation math Statement E Codeforces Round 473 (Div. 2) {959} PROGRAMMING Codeforces round #473 editorial 1900
1162 Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory Statement F Codeforces Round 578 (Div. 2) {1200} PROGRAMMING Codeforces Round #578 (Div. 2) Editorial 2500
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)
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
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
2481 Red Light, Green Light (Hard version) binary search dfs and similar dp dsu graphs implementation number theory Statement D2 Codeforces Round 1030 (Div. 2) {2118} PROGRAMMING 1000.0 Codeforces Round 1030 (Div. 2) Editorial