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 |
|---|---|---|---|---|---|---|---|---|---|
| 29366 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 3582 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 3843 | Carrots for Rabbits | binary search data structures greedy math | Statement | E | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 5870 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 2177 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 3910 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 4822 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 2175 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 5985 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 1494 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 2037 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | ||
| 6641 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | ||
| 4841 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
| 9285 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
| 10848 | Two Colors | binary search data structures dp math | Statement | C | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING |