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 |
|---|---|---|---|---|---|---|---|---|---|
| 18871 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 6356 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 3968 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 2193 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 15068 | Iva & Pav | binary search bitmasks data structures greedy | Statement | E | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 6286 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 16085 | Game with Multiset | binary search bitmasks greedy | Statement | C | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 18130 | XOR and Triangle | binary search bitmasks brute force greedy | Statement | C | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING |