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 |
|---|---|---|---|---|---|---|---|---|---|
| 2121 | Substrings in a String | bitmasks brute force data structures string suffix structures strings | Statement | F | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 2171 | 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 |
| 3945 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 1008 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 2041 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 6769 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 937 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 3172 | 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 | |
| 1962 | 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 | |
| 2545 | Prefix Function Queries | bitmasks brute force data structures hashing string suffix structures strings trees | Statement | E | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 10240 | 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 | ||
| 1897 | Three Chairs | bitmasks brute force combinatorics data structures number theory sortings | Statement | F | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2000.0 | 111841 | |
| 1946 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 14730 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 2227 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 2106 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 274 | 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 | |
| 195 | Simons and Diophantus Equation | bitmasks brute force data structures number theory | Statement | G | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 3250.0 | Tutorial |