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
< 1 2 3 ... 6 7 8Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1357 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 10496 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 244 | Familiar? | brute force combinatorics dp | Statement | F | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3000.0 | ||
| 48 | Connect Connect See | brute force data structures | Statement | H | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 5000.0 | ||
| 2776 | diss_quack and Array Game | bitmasks brute force games greedy | Statement | D | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1750.0 | ||
| 7075 | Rank Subsequence | brute force greedy implementation | Statement | A | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 750.0 |