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.

Get exact match for tags using this format, eg: [u'brute force', 'dp']

Solved
Name
Tags
Solutions
Index
Contest
Type
Points
Tutorial
Rating Level
2481 Fox and Minimal path bitmasks constructive algorithms graphs implementation math Statement B Codeforces Round 228 (Div. 1) {388} PROGRAMMING Codeforces Round #228 — Editorial 2000
3767 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
1301 Anton and School bitmasks constructive algorithms implementation math Statement F Codeforces Round 379 (Div. 2) {734} PROGRAMMING Tutorial of Codeforces Round #379 (Div. 2) 2600
1530 Decypher the String bitmasks chinese remainder theorem constructive algorithms interactive math Statement E Educational Codeforces Round 60 (Rated for Div. 2) {1117} PROGRAMMING 65365 2200
8949 Neko Performs Cat Furrier Transform bitmasks constructive algorithms dfs and similar math Statement B Codeforces Round 554 (Div. 2) {1152} PROGRAMMING T 1300
686 Magical Permutation bitmasks brute force constructive algorithms data structures graphs math Statement E Codeforces Round 558 (Div. 2) {1163} PROGRAMMING 66943 2800
14155 Make Good bitmasks constructive algorithms math Statement C Good Bye 2019 {1270} PROGRAMMING Разбор Goodbye 2019 1500
8199 Walk on Matrix bitmasks constructive algorithms math Statement D Codeforces Round 630 (Div. 2) {1332} PROGRAMMING 1250.0 Codeforces Round #630 Editorial 1700
3232 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
1175 Secure Password bitmasks combinatorics constructive algorithms interactive math Statement G Codeforces Round 648 (Div. 2) {1365} PROGRAMMING 3000.0 Editorial — Codeforces Round #648 2800