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 |
|---|---|---|---|---|---|---|---|---|---|
| 3378 | Party | constructive algorithms graphs math | Statement | B | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 1600 | |
| 1135 | Idempotent functions | constructive algorithms graphs math | Statement | C | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2000 | |
| 393 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 | |
| 8501 | Dividing the numbers | constructive algorithms graphs math | Statement | C | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 1300 | |
| 853 | Johnny Solving | constructive algorithms dfs and similar graphs math | Statement | C | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2800 | |
| 2301 | Subset with Zero Sum | constructive algorithms dfs and similar graphs math | Statement | G | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2700 |