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 |
|---|---|---|---|---|---|---|---|---|---|
| 14405 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 1879 | Excellent Arrays | brute force combinatorics constructive algorithms implementation math | Statement | D | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 29966 | Escalator Conversations | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 1569 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 |