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 |
|---|---|---|---|---|---|---|---|---|---|
| 1321 | Odd Mineral Resource | bitmasks data structures hashing probabilities trees | Statement | D | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #700 | |
| 403 | The Sum of Good Numbers | hashing probabilities | Statement | G | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 1497 | Two Arrays | bitmasks brute force combinatorics hashing probabilities two pointers | Statement | D | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1750.0 | Codeforces Round #773 editorial | |
| 8350 | Problem with Random Tests | brute force hashing probabilities | Statement | D | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1700 | |
| 2637 | Kazaee | data structures hashing probabilities | Statement | F | Codeforces Global Round 23 {1746} | PROGRAMMING | 2500.0 | Codeforces Global Round 23 Editorial | |
| 1519 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 969 | 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 | ||
| 660 | Frequency Mismatch (Easy Version) | binary search data structures divide and conquer hashing probabilities trees | Statement | F1 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2600 |
| 605 | Frequency Mismatch (Hard Version) | binary search data structures dfs and similar hashing probabilities trees | Statement | F2 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2700 |