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
992 Tree Recovery bitmasks brute force constructive algorithms dfs and similar ds graphs trees Statement F Codeforces Global Round 21 {1696} PROGRAMMING 2500.0 Editorial of Codeforces Global Round 21
6140 Xor-Subsequence (easy version) bitmasks brute force dp strings trees Statement D1 Codeforces Round 815 (Div. 2) {1720} PROGRAMMING 1500.0 Codeforces Round #815 (Div. 2) Editorial
2054 Prefix Function Queries bitmasks brute force data structures hashing string suffix structures strings trees Statement E Educational Codeforces Round 134 (Rated for Div. 2) {1721} PROGRAMMING 106416
995 Algebra Flash bitmasks brute force dp graphs meet-in-the-middle trees Statement E Educational Codeforces Round 140 (Rated for Div. 2) {1767} PROGRAMMING 110225
1755 Sasha and the Happy Tree Cutting bitmasks brute force dp fft graphs greedy trees Statement E Codeforces Round 926 (Div. 2) {1929} PROGRAMMING 2500.0 Codeforces Round #926 (Div. 2) Editorial.
721 MST with Matching bitmasks brute force trees Statement G Educational Codeforces Round 163 (Rated for Div. 2) {1948} PROGRAMMING Educational Codeforces Round 163 Editorial
1820 Fenwick Tree bitmasks brute force combinatorics data structures dp math trees Statement C Codeforces Round 942 (Div. 1) {1967} PROGRAMMING 1250.0 Tutorial 2300
218 Your Loss bitmasks brute force trees Statement G Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} PROGRAMMING 3000.0
20778 Substring and Subsequence bitmasks brute force dp graphs greedy hashing strings trees Statement B Educational Codeforces Round 167 (Rated for Div. 2) {1989} PROGRAMMING Educational Codeforces Round 167 Editorial