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 |
|---|---|---|---|---|---|---|---|---|---|
| 15378 | Bear and Prime 100 | constructive algorithms interactive math | Statement | A | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 1400 | |
| 8913 | Guess the Array | constructive algorithms interactive math | Statement | C | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1400 | |
| 1635 | Decypher the String | bitmasks chinese remainder theorem constructive algorithms interactive math | Statement | E | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2200 | |
| 1591 | Point Ordering | constructive algorithms geometry interactive math | Statement | C | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2300 | |
| 4862 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 | |
| 1577 | Madhouse (Easy version) | brute force constructive algorithms interactive math | Statement | C1 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2400 | |
| 744 | Madhouse (Hard version) | brute force constructive algorithms hashing interactive math | Statement | C2 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 462 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |
| 1413 | Secure Password | bitmasks combinatorics constructive algorithms interactive math | Statement | G | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #648 | 2800 |
| 2502 | Integer Game | brute force constructive algorithms games interactive math | Statement | F | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 3736 | Omkar and Duck | bitmasks constructive algorithms interactive math | Statement | E | Codeforces Global Round 10 {1392} | PROGRAMMING | 2000.0 | Codeforces Global Round 10 — Editorial | |
| 1269 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 14616 | Chocolate Bunny | constructive algorithms interactive math two pointers | Statement | C | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1500.0 | Codeforces Round #669 Editorial | |
| 4894 | Bitwise Queries (Easy Version) | bitmasks constructive algorithms interactive math | Statement | E1 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #685 | |
| 3359 | Bitwise Queries (Hard Version) | bitmasks constructive algorithms interactive math | Statement | E2 | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #685 | |
| 7995 | RPD and Rap Sheet (Easy Version) | bitmasks constructive algorithms interactive math | Statement | D1 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1000.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 2162 | RPD and Rap Sheet (Hard Version) | constructive algorithms dp interactive math | Statement | D2 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1250.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 605 | AquaMoon and Wrong Coordinate | constructive algorithms interactive math | Statement | D | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2250.0 | Codeforces Round #732 Editorial | 3000 |
| 8548 | Take a Guess | bitmasks constructive algorithms interactive math | Statement | D | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 1500.0 | 94384 | 1800 |
| 152 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 3569 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 4625 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) 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 | |
| 692 | Mark and the Online Exam | bitmasks constructive algorithms interactive math probabilities | Statement | F | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 3000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 588 | Crop Squares | constructive algorithms geometry interactive math | Statement | F | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 3000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 1688 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 2781 | In Search of Truth (Easy Version) | brute force constructive algorithms interactive math probabilities | Statement | G1 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 1180 | In Search of Truth (Hard Version) | constructive algorithms interactive math probabilities | Statement | G2 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 4323 | Salyg1n and Array (simple version) | constructive algorithms interactive math | Statement | E1 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 3747 | Salyg1n and Array (hard version) | constructive algorithms interactive math | Statement | E2 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 1565 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 2503 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 8057 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 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 | |
| 3642 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 11324 | Hacking Numbers (Easy Version) | bitmasks constructive algorithms interactive math number theory | Statement | C1 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 1250.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 8586 | Hacking Numbers (Medium Version) | constructive algorithms interactive math number theory | Statement | C2 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 750.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 3175 | Hacking Numbers (Hard Version) | constructive algorithms interactive math number theory | Statement | C3 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 500.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 104 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 986 | From the Unknown (Hard Version) | binary search brute force constructive algorithms interactive math | Statement | D2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 7299 | For the Champion | constructive algorithms interactive math | Statement | B | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 2409 | From the Unknown (Easy Version) | constructive algorithms interactive math | Statement | D1 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 2757 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 5337 | Find the Last Number | bitmasks constructive algorithms interactive math | Statement | D | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2000.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 402 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 297 | Binary Strings are Simple? | constructive algorithms dsu interactive number theory | Statement | E | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2750.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2563 | Unique Values (Hard version) | binary search constructive algorithms divide and conquer interactive math | Statement | B2 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 |