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 |
---|---|---|---|---|---|---|---|---|---|
477 | Berserk Robot | constructive algorithms math sortings | Statement | G | Codeforces Round 300 {538} | PROGRAMMING | 3100 | ||
7224 | Pasha and Tea | constructive algorithms implementation math sortings | Statement | B | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1500 | |
33763 | Mahmoud and a Triangle | constructive algorithms geometry greedy math number theory sortings | Statement | B | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1100 | |
2798 | Train Hard, Win Easy | constructive algorithms greedy math sortings | Statement | E | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1900 | |
4242 | Magic Stones | constructive algorithms math sortings | Statement | E | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
1972 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
4715 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 |