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
980 Friends binary search bitmasks data structures math Statement B Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} PROGRAMMING 2700
2171 Kuro and GCD and XOR and SUM binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees Statement D Codeforces Round 482 (Div. 2) {979} PROGRAMMING 1750.0 Codeforces Round #482 (Div. 2) Editorial 2200
4622 Present binary search bitmasks constructive algorithms data structures math sortings Statement B Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} PROGRAMMING 1000.0 Codeforces Round #626 Editorial
1519 Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees Statement F Codeforces Round 837 (Div. 2) {1771} PROGRAMMING 3500.0 Codeforces Round #837 (Div. 2) Editorial
1026 The Boss's Identity binary search bitmasks data structures dfs and similar greedy math sortings Statement F Codeforces Round 882 (Div. 2) {1847} PROGRAMMING 3000.0 Tutorial
1458 wxhtzdy ORO Tree binary search bitmasks data structures dfs and similar math trees Statement G Codeforces Round 900 (Div. 3) {1878} PROGRAMMING Codeforces round #900 (Div.3) Editorial
14797 Vlad and an Odd Ordering binary search bitmasks data structures dp implementation math number theory Statement E Codeforces Round 928 (Div. 4) {1926} PROGRAMMING 126132
1645 Distance Learning Courses in MAC binary search bitmasks data structures greedy implementation math Statement E Codeforces Round 932 (Div. 2) {1935} PROGRAMMING 2500.0 Codeforces Round #932 (Div. 2) Editorial
16778 Cat, Fox and the Lonely Array binary search bitmasks data structures greedy math two pointers Statement B Codeforces Round 945 (Div. 2) {1973} PROGRAMMING 1000.0 Editorial for Codeforces Round #945 (Div. 2) 1300
274 Fuzzy Concatenation (Easy Version) binary search bitmasks brute force data structures greedy string suffix structures Statement E1 Codeforces Round 1079 (Div. 1) {2196} PROGRAMMING 2000.0 Tutorial