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
6329 Omsk Metro (simple version) data structures dfs and similar dp greedy math trees Statement F1 Codeforces Round 881 (Div. 3) {1843} PROGRAMMING Codeforces Round #881 (Div. 3) Editorial