Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4386 | Obsession with Robots | constructive algorithms graphs implementation | Statement | B | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 1500 | |
| 534 | Two Paths | constructive algorithms ds graphs implementation | Statement | E | Codeforces Beta Round 36 {36} | PROGRAMMING | 2500 | ||
| 250 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | 2400 | ||
| 165 | Deja Vu | constructive algorithms graphs implementation | Statement | E1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 3000 | ||
| 4678 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 3481 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1802 | Restoration of string | constructive algorithms graphs implementation | Statement | D | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2000 | |
| 688 | Degree Set | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2400 | |
| 3845 | Graph And Its Complement | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1700 | |
| 3822 | Maximum Diameter Graph | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1800 | |
| 4024 | Time to Run | constructive algorithms graphs implementation | Statement | D | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1750.0 | Codeforces Round #619 (Div. 2) Editorial | 1900 |
| 3399 | Nash Matrix | constructive algorithms dfs and similar graphs implementation | Statement | D | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1750.0 | Codecraft-20 (Div.2) Editorial | 2000 |
| 7340 | Minimum Euler Cycle | constructive algorithms graphs greedy implementation | Statement | D | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial |