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 |
|---|---|---|---|---|---|---|---|---|---|
| 309 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 165098 | Queue at the School | constructive algorithms graph matchings implementation shortest paths | Statement | B | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 900 | |
| 172 | Princess and Her Shadow | constructive algorithms shortest paths | Statement | E | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Codeforces Round #188 (разбор) | 3200 | |
| 8750 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 857 | Wrong Floyd | brute force constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2200 | |
| 2597 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 1995 | Arthur and Walls | constructive algorithms data structures graphs greedy shortest paths | Statement | D | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2300 | |
| 4568 | Destroying Roads | constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 3320 | Complete The Graph | binary search constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 2200 | |
| 4844 | Santa Claus and Robot | constructive algorithms math | Statement | C | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 1400 | |
| 917 | PolandBall and White-Red graph | constructive algorithms graphs shortest paths | Statement | E | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2400 | |
| 7146 | Police Stations | constructive algorithms dfs and similar dp graphs shortest paths trees | Statement | D | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2100 | |
| 5537 | Jamie and Interesting Graph | constructive algorithms graphs shortest paths | Statement | C | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1600 | |
| 851 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 3143 | K-th Path | brute force constructive algorithms shortest paths sortings | Statement | F | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 2500 | |
| 162 | Alpha planetary system | constructive algorithms graphs shortest paths | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 3300 | |
| 20687 | Solve The Maze | constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 1885 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 1419 | Capitalism | constructive algorithms dfs and similar graphs shortest paths | Statement | E | Codeforces Global Round 12 {1450} | PROGRAMMING | 2500.0 | Codeforces Global Round 12 Editorial | |
| 3345 | Paired Payment | binary search constructive algorithms dp graphs shortest paths | Statement | E | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 2250.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 1921 | Cakewalk | constructive algorithms greedy implementation shortest paths | Statement | E | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 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 |
| 2073 | Lost Array | constructive algorithms dp graphs interactive shortest paths | Statement | E | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 2250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 14957 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 383 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 419 | Anti-Tetris | constructive algorithms graphs shortest paths | Statement | A | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 123 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 384 | Reindeer Games | constructive algorithms flows graphs shortest paths | Statement | H | Codeforces Global Round 18 {1615} | PROGRAMMING | 4000.0 | Global Round 18 Editorial | |
| 6004 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 1373 | Connectivity Addicts | constructive algorithms dsu graphs greedy interactive shortest paths sortings trees | Statement | F | Codeforces Global Round 22 {1738} | PROGRAMMING | 2750.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 1194 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 386 | The Game of the Century | constructive algorithms graphs shortest paths | Statement | G | Hello 2023 {1779} | PROGRAMMING | 2750.0 | ||
| 1311 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | 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 |
| 2349 | Between | constructive algorithms dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #865 | 2200 |
| 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 |
| 4715 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 9487 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 3724 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) 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 | |
| 875 | Spruce Dispute | constructive algorithms dfs and similar graphs implementation shortest paths trees | Statement | E | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2750.0 | Codeforces Round 1022 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 |