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
4668 Three Logos bitmasks brute force constructive algorithms geometry implementation math Statement D Codeforces Round 322 (Div. 2) {581} PROGRAMMING Codeforces Round #322 (Div.2) Editorial 1700
1008 Magical Permutation bitmasks brute force constructive algorithms data structures graphs math Statement E Codeforces Round 558 (Div. 2) {1163} PROGRAMMING 66943 2800
3006 The LCMs Must be Large bitmasks brute force constructive algorithms math number theory Statement E Codeforces Round 561 (Div. 2) {1166} PROGRAMMING Codeforces Round #561 (Div. 2) Editorial 2000
3436 Perfect Triples bitmasks brute force constructive algorithms divide and conquer greedy implementation math Statement C Codeforces Round 633 (Div. 1) {1338} PROGRAMMING 1500.0 Editorial
19380 Factorials and Powers of Two bitmasks brute force constructive algorithms math Statement C Codeforces Round 774 (Div. 2) {1646} PROGRAMMING 1250.0 Codeforces Round #774 (Div. 2) Editorial 1500
10240 SlavicG's Favorite Problem bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy Statement G Codeforces Round 835 (Div. 4) {1760} PROGRAMMING 109348
13730 XOR Convenience (Easy Version) bitmasks brute force constructive algorithms math Statement C1 Codeforces Round 1075 (Div. 2) {2189} PROGRAMMING 1250.0 Codeforces Round 1075 (Div. 2) Editorial
6133 XOR-convenience (Hard Version) bitmasks brute force constructive algorithms math Statement C2 Codeforces Round 1075 (Div. 2) {2189} PROGRAMMING 750.0 Codeforces Round 1075 (Div. 2) Editorial