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
493 Maximum Waterfall data structures dp graphs sortings Statement D Codeforces Round 165 (Div. 1) {269} PROGRAMMING Разбор Codeforces Round #165 2500
2617 Gosha is hunting brute force data structures dp flows math probabilities sortings Statement E Codeforces Round 381 (Div. 1) {739} PROGRAMMING 48582 2900
949 Economic Difficulties data structures dfs and similar dp flows graphs trees Statement F Codeforces Round 603 (Div. 2) {1263} PROGRAMMING Разбор Codeforces Round #603 (Div. 2) 2500
2289 Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees Statement D Codeforces Round 720 (Div. 2) {1521} PROGRAMMING 2250.0 90477
146 Panda Meetups data structures dp flows Statement F Codeforces Round 887 (Div. 1) {1852} PROGRAMMING 3000.0 Codeforces Round 887 (Div 1, Div 2) Tutorial
320 Two Characters, Two Colors binary search data structures dp flows geometry Statement G Educational Codeforces Round 157 (Rated for Div. 2) {1895} PROGRAMMING Educational Codeforces Round 157 Editorial
198 Farmer John's Favorite Intern data structures dp flows trees Statement H CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} PROGRAMMING 4500.0 CodeTON Round 8 Editorial
597 Another Folding Strip combinatorics data structures divide and conquer dp math sortings Statement E Codeforces Round 1008 (Div. 1) {2077} PROGRAMMING 2250.0 Codeforces Round 1008 (Div. 1, Div. 2) Editorial
565 23 Rises Again brute force data structures dfs and similar dp flows graphs implementation probabilities trees Statement H Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} PROGRAMMING 4000.0 Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial
260 Hanabi data structures dp flows graph matchings graphs greedy Statement F Codeforces Round 1085 (Div. 1 + Div. 2) {2207} PROGRAMMING 3250.0 Codeforces Round 1085 (Div. 1 + Div. 2) Editorial