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 |
|---|---|---|---|---|---|---|---|---|---|
| 31747 | Winner | hashing implementation | Statement | A | Codeforces Beta Round 2 {2} | PROGRAMMING | Codeforces Beta Round #2 - Tutorial | 1600 | |
| 112355 | Registration System | data structures hashing implementation | Statement | C | Codeforces Beta Round 4 (Div. 2 Only) {4} | PROGRAMMING | 1500 | ||
| 3629 | Spelling Check | hashing implementation strings | Statement | J | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 1600 | |
| 921 | Cutting Jigsaw Puzzle | hashing implementation | Statement | B | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 1800 | |
| 2343 | Sets | constructive algorithms hashing implementation | Statement | B | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1700 | |
| 2914 | String | brute force constructive algorithms hashing implementation string suffix structures strings | Statement | B | Codeforces Beta Round 94 (Div. 1 Only) {128} | PROGRAMMING | 3219 | 2200 | |
| 9349 | Common Divisors | brute force hashing implementation math strings | Statement | D | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1400 | |
| 386 | Polycarpus is Looking for Good Substrings | bitmasks hashing implementation | Statement | B | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2300 | ||
| 545 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2800 | |
| 9243 | Gargari and Bishops | greedy hashing implementation | Statement | C | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1800 | |
| 19336 | OR in Matrix | greedy hashing implementation | Statement | B | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1400 | |
| 408 | Berland Local Positioning System | constructive algorithms greedy hashing implementation | Statement | E | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2600 | ||
| 2481 | Messenger | data structures hashing implementation string suffix structures strings | Statement | D | Codeforces Round 344 (Div. 2) {631} | PROGRAMMING | Editorial Codeforces Round #344 (Div. 2) | 2100 | |
| 3427 | Spy Syndrome 2 | data structures dp hashing implementation sortings string suffix structures strings | Statement | C | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1900 | |
| 3083 | Fibonacci-ish | brute force dp hashing implementation math | Statement | D | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2000 | |
| 1270 | Bear and Polynomials | hashing implementation math | Statement | C | VK Cup 2016 - Round 1 {639} | PROGRAMMING | Tutorial | 2200 | |
| 2289 | Ray Tracing | greedy hashing implementation math number theory sortings | Statement | C | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1800 | |
| 1624 | Swapping Characters | brute force hashing implementation strings | Statement | E | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2200 | |
| 171 | Optimizer | graphs greedy hashing implementation | Statement | G | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 3100 | |
| 1037 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 9649 | Compress Words | brute force hashing implementation string suffix structures strings | Statement | E | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2000 | |
| 5458 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 3284 | Let's Play the Words? | data structures hashing implementation math | Statement | D | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1800 | |
| 13629 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 471 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 2168 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 4798 | Trash Problem | data structures hashing implementation two pointers | Statement | D | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17404 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 3264 | Funny Substrings | brute force data structures hashing implementation strings | Statement | E | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 897 | Playoff Restoration | bitmasks brute force hashing implementation meet-in-the-middle | Statement | E | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 4890 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 1608 | Red-Blue Matrix | constructive algorithms data structures hashing implementation sortings two pointers | Statement | D | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 4655 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 18723 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 981 | BinCoin | divide and conquer hashing implementation probabilities trees | Statement | B | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2200 | ||
| 1567 | Labeling the Tree with Distances | data structures dp hashing implementation trees | Statement | E | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 13225 | Torn Lucky Ticket | brute force dp hashing implementation math | Statement | C | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 4659 | Non-Palindromic Substring | data structures hashing implementation math strings | Statement | B | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 4582 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 412 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 3958 | ''a'' String Problem | hashing implementation math string suffix structures strings | Statement | D | Codeforces Global Round 26 {1984} | PROGRAMMING | 2500.0 | Codeforces Global Round 26 Editorial | |
| 5170 | DFS Checker (Easy Version) | constructive algorithms data structures dfs and similar hashing implementation | Statement | D1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2924 | DFS Checker (Hard Version) | constructive algorithms data structures dfs and similar hashing implementation trees | Statement | D2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 21027 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 2048 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial |