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 |
|---|---|---|---|---|---|---|---|---|---|
| 282 | Bitonix' Patrol | bitmasks brute force combinatorics dfs and similar math | Statement | D | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2800 | |
| 4694 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 37831 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 6505 | Fox And Jumping | bitmasks brute force dp math | Statement | D | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2100 | |
| 4285 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 4864 | Three Logos | bitmasks brute force constructive algorithms geometry implementation math | Statement | D | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1700 | |
| 2537 | Binary Table | bitmasks brute force divide and conquer dp fft math | Statement | C | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2800 | |
| 559 | Random Elections | bitmasks brute force divide and conquer fft math | Statement | E | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2800 | |
| 81 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 3300 | |
| 2044 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 2233 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 1053 | Pave the Parallelepiped | bitmasks brute force combinatorics math number theory | Statement | B | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2400 | |
| 489 | Boolean Computer | bitmasks brute force fft math | Statement | F | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2800 | |
| 1140 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 234 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 1047 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 3032 | The LCMs Must be Large | bitmasks brute force constructive algorithms math number theory | Statement | E | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2000 | |
| 9859 | p-binary | bitmasks brute force math | Statement | C | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1600 | |
| 883 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 605 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 3482 | 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 | |
| 6818 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 13931 | Cobb | bitmasks brute force greedy math | Statement | B | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #735 (Div. 2) | 1700 |
| 7318 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 2271 | Math Test | bitmasks brute force greedy | Statement | E | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 14195 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 20356 | Factorials and Powers of Two | bitmasks brute force constructive algorithms math | Statement | C | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1250.0 | Codeforces Round #774 (Div. 2) Editorial | 1500 |
| 3207 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 2011 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 12948 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 7787 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 12484 | Even Subarrays | bitmasks brute force hashing math number theory | Statement | C | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 13585 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 10638 | 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 | ||
| 2865 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 971 | Maximize the Difference | bitmasks brute force dfs and similar | Statement | F | think-cell Round 1 {1930} | PROGRAMMING | 2750.0 | think-cell Round 1 Editorial | |
| 1214 | Turtle Magic: Royal Turtle Shell Pattern | bitmasks brute force combinatorics math | Statement | G | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 5955 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 2286 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 1075 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 1666 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | Video Tutorial | |
| 4078 | Expected Power | bitmasks brute force dp math number theory probabilities | Statement | E | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2000.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 258 | Bit Game (Easy Version) | bitmasks brute force games math | Statement | E1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 2000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 13762 | Shohag Loves XOR (Easy Version) | bitmasks brute force math number theory | Statement | C1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5047 | Shohag Loves XOR (Hard Version) | bitmasks brute force math number theory | Statement | C2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5968 | Equalization | bitmasks brute force dp greedy math | Statement | D | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 1692 | Zebra-like Numbers | bitmasks brute force dfs and similar dp math | Statement | E | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 5610 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 3879 | Wafu! | bitmasks brute force dp math | Statement | G | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 3794 | Taiga's Carry Chains | bitmasks brute force dp greedy | Statement | D | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1750.0 | ||
| 699 | Cool Problem | bitmasks brute force divide and conquer dp math | Statement | D | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 14610 | XOR Convenience (Easy Version) | bitmasks brute force constructive algorithms math | Statement | C1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 6475 | XOR-convenience (Hard Version) | bitmasks brute force constructive algorithms math | Statement | C2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 310 | Fuzzy Concatenation (Easy Version) | binary search bitmasks brute force data structures greedy string suffix structures | Statement | E1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2000.0 | Tutorial | |
| 8145 | Exceptional Segments | bitmasks brute force math | Statement | D | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 1202 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING |