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 |
|---|---|---|---|---|---|---|---|---|---|
| 128 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 1188 | Permutation and Queries | brute force data structures | Statement | H | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 18779 | 3SUM Closure | brute force data structures | Statement | C | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 1426 | Balance (Hard version) | brute force data structures | Statement | D2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 2400 |
| 720 | Magician and Pigs (Hard Version) | brute force data structures | Statement | F2 | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial |