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 3Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 746 | String Cutting | binary search brute force greedy hashing string suffix structures strings | Statement | F | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 17034 | Alternating String | brute force greedy | Statement | B | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 13628 | Palindromex | binary search brute force constructive algorithms data structures greedy implementation two pointers | Statement | D | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 18407 | Slimes on a Line | brute force greedy math | Statement | A | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 9007 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 20231 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 14192 | Annoying the Ghost | brute force greedy | Statement | B | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1000.0 | ||
| 1202 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 2477 | diss_quack and Array Game | bitmasks brute force games greedy | Statement | D | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 1750.0 |