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
3436 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
9502 Edge Weight Assignment bitmasks constructive algorithms greedy math trees Statement B Codeforces Round 633 (Div. 1) {1338} PROGRAMMING 1000.0 Editorial
9335 Phoenix and Science binary search bitmasks constructive algorithms greedy math Statement D Codeforces Round 638 (Div. 2) {1348} PROGRAMMING 2000.0 Codeforces Round #638 (Div. 2) Editorial 1900
5431 GameGame bitmasks constructive algorithms dp games greedy math Statement B Codeforces Round 659 (Div. 1) {1383} PROGRAMMING 1000.0 Codeforces Round #659 Editorial
954 Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math Statement F Codeforces Round 785 (Div. 2) {1673} PROGRAMMING 3250.0 Codeforces Round #785 (Div. 2) Editorial
16982 Absolute Maximization bitmasks constructive algorithms greedy math Statement A Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} PROGRAMMING 500.0 Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial
2714 The Harmonization of XOR bitmasks constructive algorithms greedy math Statement E TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} PROGRAMMING 2250.0 TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial
2739 Candy Party (Hard Version) bitmasks constructive algorithms dp graphs greedy implementation math Statement B2 Codeforces Round 896 (Div. 1) {1868} PROGRAMMING 750.0 Codeforces Round 896 (Div. 1, Div. 2) Editorial
8299 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math Statement B1 Codeforces Round 896 (Div. 1) {1868} PROGRAMMING 500.0 Codeforces Round 896 (Div. 1, Div. 2) Editorial
8637 Bitwise Operation Wizard bitmasks constructive algorithms greedy interactive math Statement A Codeforces Round 930 (Div. 1) {1936} PROGRAMMING 500.0 Codeforces Round 930 (Div. 1, Div. 2) Editorial
19862 Binary Colouring bitmasks constructive algorithms greedy math Statement B Codeforces Round 948 (Div. 2) {1977} PROGRAMMING 1250.0 129858 1100
6329 Turtle and an Incomplete Sequence bitmasks constructive algorithms greedy implementation math Statement C Codeforces Round 949 (Div. 2) {1981} PROGRAMMING 1500.0 Simplified Chinese Tutorial
7869 Prime XOR Coloring bitmasks constructive algorithms graphs greedy math number theory Statement D Pinely Round 4 (Div. 1 + Div. 2) {1991} PROGRAMMING 1500.0 Video Tutorial
19429 Fun Game bitmasks constructive algorithms greedy math Statement B Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} PROGRAMMING 1000.0 Video Tutorial
13696 Trip to the Olympiad bitmasks constructive algorithms greedy math Statement C Hello 2025 {2057} PROGRAMMING 1500.0
14479 SUMdamental Decomposition bitmasks constructive algorithms greedy implementation math Statement B Codeforces Round 1022 (Div. 2) {2108} PROGRAMMING 1250.0 Codeforces Round 1022 Editorial
13361 Blackslex and Penguin Civilization bitmasks constructive algorithms greedy math Statement D Codeforces Round 1071 (Div. 3) {2179} PROGRAMMING Codeforces Round 1071 (Div. 3) Editorial
6386 XOR-factorization bitmasks constructive algorithms dp greedy number theory Statement C Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} PROGRAMMING 1500.0 Codeforces Global Round 31