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 |
---|---|---|---|---|---|---|---|---|---|
1077 | Seller Bob | brute force dp greedy | Statement | D | Codeforces Beta Round 18 (Div. 2 Only) {18} | PROGRAMMING | Codeforces Beta Round #18(Div. 2) Tutorial | 2100 | |
266 | Power Defence | brute force dp geometry greedy | Statement | E | Codeforces Round 115 {175} | PROGRAMMING | 2500 | ||
6676 | Color Stripe | brute force dp greedy | Statement | C | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1600 | |
761 | Special Grid | brute force dp greedy | Statement | D | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2200 | |
139 | To Hack or not to Hack | brute force dp greedy | Statement | E | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | 2800 | ||
5875 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
791 | Abandoning Roads | brute force dp graphs greedy | Statement | D | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
6962 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
1737 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
10476 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
7192 | K-periodic Garland | brute force dp greedy | Statement | E | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1900 |