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 |
|---|---|---|---|---|---|---|---|---|---|
| 1249 | Nanami's Digital Board | ds implementation | Statement | D | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | 2300 | ||
| 6087 | Queue | ds implementation | Statement | B | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1500 | |
| 1527 | st-Spanning Tree | ds graphs greedy implementation | Statement | F | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 2200 | ||
| 9767 | Mahmoud and Ehab and the message | ds greedy implementation | Statement | B | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | 1300 | ||
| 5081 | Alice and Hairdresser | ds implementation | Statement | B | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 1300 | |
| 544 | Number of Components | ds implementation | Statement | F | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2800 |