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 |
|---|---|---|---|---|---|---|---|---|---|
| 15662 | Lucky Numbers (easy) | binary search bitmasks brute force | Statement | B | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1400 | |
| 244 | Minimum Diameter | binary search brute force | Statement | D | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2900 | |
| 3046 | Number of Triplets | binary search brute force | Statement | B | Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) {181} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1300 | |
| 26781 | Hamburgers | binary search brute force | Statement | C | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | 1600 | ||
| 2684 | Sereja and Prefixes | binary search brute force | Statement | A | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | 1700 | ||
| 14228 | Multiplication Table | binary search brute force | Statement | D | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 7478 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 |