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
1008 Magical Permutation bitmasks brute force constructive algorithms data structures graphs math Statement E Codeforces Round 558 (Div. 2) {1163} PROGRAMMING 66943 2800
1776 Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math Statement C Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} PROGRAMMING Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial 2300
2791 Kill Anton brute force constructive algorithms data structures math strings Statement D Codeforces Round 723 (Div. 2) {1526} PROGRAMMING 2250.0 Codeforces Round #723 (Div. 2) Editorial
7244 Integral Array brute force constructive algorithms data structures math Statement B Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} PROGRAMMING 1000.0 Codeforces Round #775 Editorial
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
10254 Squaring brute force constructive algorithms data structures greedy implementation math number theory Statement C Codeforces Round 961 (Div. 2) {1995} PROGRAMMING 1750.0 Video Tutorial
14621 Kevin and Geometry brute force constructive algorithms data structures geometry greedy implementation math two pointers Statement B IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} PROGRAMMING 1000.0 IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial
1492 Gleb and Boating brute force constructive algorithms data structures dp graphs greedy math shortest paths Statement G Codeforces Round 1013 (Div. 3) {2091} PROGRAMMING Codeforces Round 1013 (Div. 3) Editorial