Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 645 | Mirror Box | matrices trees | Statement | F | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 3400 | |
| 1280 | Magic Matrix | brute force divide and conquer graphs matrices trees | Statement | F | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2400 | |
| 1462 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 9217 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 233 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 1174 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 1754 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial |