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
603 Hamming Distance constructive algorithms greedy math matrices Statement C Codeforces Round 122 (Div. 1) {193} PROGRAMMING Editoral Codeforces Round #122 2400
1151 Lovely Matrix dfs and similar graphs greedy sortings Statement D Codeforces Round 168 (Div. 1) {274} PROGRAMMING Codeforces Round #168 Editorial 2100
5933 Ilya and Matrix constructive algorithms greedy implementation sortings Statement C Codeforces Round 186 (Div. 2) {313} PROGRAMMING Tutorial 1400
5222 Quiz binary search greedy math matrices number theory Statement C Codeforces Round 196 (Div. 2) {337} PROGRAMMING Codeforces Round #196 — Problems Analysis 1700
19143 OR in Matrix greedy hashing implementation Statement B Codeforces Round 277 (Div. 2) {486} PROGRAMMING Codeforces Round #277(Div. 2) Editorial 1400
7174 Ramesses and Corner Inversion constructive algorithms greedy implementation math Statement C Codeforces Global Round 2 {1119} PROGRAMMING Codeforces Global Round 2 Editorial 1500
13749 Square Filling constructive algorithms greedy implementation Statement B Educational Codeforces Round 71 (Rated for Div. 2) {1207} PROGRAMMING Educational Codeforces Round 71 Editorial 1200
2411 Robots on a Grid data structures dfs and similar dsu graphs greedy matrices Statement F Codeforces Round 634 (Div. 3) {1335} PROGRAMMING 75993 2600
14250 Palindromic Paths dsu greedy math Statement C Educational Codeforces Round 89 (Rated for Div. 2) {1366} PROGRAMMING Educational Codeforces Round 89 Editorial
9216 TediousLee dp graphs greedy math matrices trees Statement D Codeforces Round 652 (Div. 2) {1369} PROGRAMMING 2000.0 Codeforces Round #652 (Div. 2) Editorial 1900
434 The Thorny Path greedy math matrices Statement F Technocup 2021 - Elimination Round 3 {1411} PROGRAMMING 2750.0 Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial
729 Nastia and a Beautiful Matrix binary search constructive algorithms greedy math Statement E Codeforces Round 720 (Div. 2) {1521} PROGRAMMING 2750.0 90477
931 Labyrinth Adventures data structures dp greedy matrices shortest paths Statement E Educational Codeforces Round 129 (Rated for Div. 2) {1681} PROGRAMMING 103163 2600
1968 Cross Swapping dsu greedy matrices Statement E Codeforces Round 812 (Div. 2) {1713} PROGRAMMING 2500.0 Codeforces Round #812 (Div. 2) Editorial 2400
2182 Max Plus Min Plus Size data structures dp dsu greedy implementation matrices Statement D Codeforces Round 975 (Div. 1) {2018} PROGRAMMING 1500.0 Editorial of Codeforces Round 975 (Div. 1, Div. 2)
18723 Set of Strangers greedy matrices Statement B Educational Codeforces Round 174 (Rated for Div. 2) {2069} PROGRAMMING 139774
1745 Tree Orientation (Hard Version) data structures dfs and similar dsu graphs greedy matrices sortings trees Statement D2 Codeforces Round 1086 (Div. 2) {2208} PROGRAMMING 1250.0 Tutorial