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 |
|---|---|---|---|---|---|---|---|---|---|
| 859 | Superset | constructive algorithms divide and conquer | Statement | B | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Yandex.Algorithm final: Problem D tutorial | 2300 | |
| 522 | Fox And Polygon | constructive algorithms divide and conquer | Statement | E | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2800 | ||
| 5998 | Code For 1 | constructive algorithms dfs and similar divide and conquer | Statement | B | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 1600 | |
| 3185 | Merge Sort | constructive algorithms divide and conquer | Statement | D | Educational Codeforces Round 30 {873} | PROGRAMMING | 1800 | ||
| 361 | SmartGarden | constructive algorithms divide and conquer | Statement | M | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2700 |