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 |
---|---|---|---|---|---|---|---|---|---|
2471 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
1446 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
2086 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
11204 | Maximum Crossings (Hard Version) | data structures divide and conquer sortings | Statement | H2 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
2307 | Permutation Sorting | data structures divide and conquer sortings | Statement | E | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
14841 | Greetings | data structures divide and conquer sortings | Statement | F | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 |