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 |
|---|---|---|---|---|---|---|---|---|---|
| 1548 | Knights | geometry graphs shortest paths sortings | Statement | D | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | Codeforces Beta Round #33. Analysis of problem A | 2000 | |
| 79 | BerPaint | geometry graphs | Statement | F | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of A-E, H, J. | 2600 | |
| 1096 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 151 | Darts | geometry probabilities | Statement | E | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2600 | |
| 348 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 208 | Planar Graph | flows geometry graphs | Statement | E | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | Tutorial | 3000 | |
| 80 | Spider | geometry graphs | Statement | D | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 3000 | ||
| 4948 | A Problem about Polyline | geometry math | Statement | A | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1700 | |
| 511 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 644 | A Colourful Prospect | geometry graphs | Statement | C | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 2400 | |
| 893 | Jog Around The Graph | binary search dp geometry graphs | Statement | F | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 675 | Shifting Dominoes | data structures geometry graphs trees | Statement | G | Codeforces Global Round 8 {1368} | PROGRAMMING | 3500.0 | Codeforces Global Round 8: editorial | |
| 215 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 893 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 877 | One-Four Overload | 2-sat constructive algorithms dfs and similar geometry graphs implementation | Statement | F | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2750.0 | Codeforces Round #742 Editorial | |
| 653 | Not Splitting | geometry graphs implementation shortest paths | Statement | F | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 2118 | Long Way Home | data structures divide and conquer dp geometry graphs shortest paths | Statement | E | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 152 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 14148 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 2745 | Disks | dfs and similar geometry graphs | Statement | I | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1801 | Manhattan Triangle | binary search constructive algorithms data structures geometry graphs two pointers | Statement | E | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 5686 | Fibonacci Paths | data structures dp geometry graphs sortings | Statement | D | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2000.0 | Codeforces Round 1070 (Div.2) Editorial |