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 |
|---|---|---|---|---|---|---|---|---|---|
| 288 | Chess | math shortest paths | Statement | E | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2900 | |
| 353 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 983 | BerDonalds | graphs math shortest paths | Statement | D | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 11995 | Rook, Bishop and King | graphs math shortest paths | Statement | A | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1200 | |
| 61809 | Two Buttons | dfs and similar graphs greedy implementation math shortest paths | Statement | B | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1400 | |
| 4202 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 739 | Oppa Funcan Style Remastered | graphs math number theory shortest paths | Statement | F | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 3200 | |
| 2981 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 3588 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 3167 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 10402 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 4375 | Hexagons | brute force implementation math shortest paths ternary search | Statement | D | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2000.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 1530 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 3692 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 2283 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 2730 | Omkar and Forest | combinatorics graphs math shortest paths | Statement | E | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2250.0 | Codeforces Round #724 — Editorial | 2300 |
| 5337 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 1008 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 7262 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 18633 | Weird Sum | combinatorics data structures geometry math matrices sortings | Statement | A | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 19361 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 8406 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 3983 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 3593 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 315 | OH NO1 (-2-3-4) | constructive algorithms graphs math shortest paths | Statement | F | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #865 | 3500 |
| 25493 | 2D Traveling | geometry math shortest paths | Statement | B | Codeforces Round 896 (Div. 2) {1869} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 1341 | Moving Platforms | graphs math number theory shortest paths | Statement | G | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 105 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 1492 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 924 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14807 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial |