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 |
|---|---|---|---|---|---|---|---|---|---|
| 1989 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 221 | Fake bullions | combinatorics dfs and similar dp graphs number theory | Statement | F | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3400 | |
| 854 | An unavoidable detour for home | combinatorics dp graphs shortest paths | Statement | E | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 2700 | |
| 1050 | Singer House | combinatorics dp graphs trees | Statement | D | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 2800 | |
| 509 | Shake It! | combinatorics dp flows graphs | Statement | D | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2900 | |
| 1555 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 723 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 271 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 1396 | Clusterization Counting | combinatorics dp dsu fft graphs | Statement | G | Grakn Forces 2020 {1408} | PROGRAMMING | 3000.0 | Grakn Forces -- Editorial | |
| 14063 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1480 | Sports Betting | bitmasks combinatorics dp graphs math probabilities | Statement | F | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2500.0 | 94384 | 2500 |
| 795 | Occurrences | combinatorics dp dsu fft graphs | Statement | F | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 2591 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 1493 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 11397 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 387 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 2486 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 1910 | Light Bulbs (Hard Version) | combinatorics data structures dfs and similar dp dsu graphs hashing | Statement | G2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 3070 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 3474 | Tree Colorings | combinatorics dp graphs math trees | Statement | E | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 3953 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2792 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2048 | Deconstruction Tree | combinatorics data structures dp graphs trees | Statement | E | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 671 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 6466 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial |