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 |
|---|---|---|---|---|---|---|---|---|---|
| 282 | BHTML+BCSS | *special dfs and similar expression parsing | Statement | E | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 2500 | ||
| 1564 | Tree-String Problem | *special dfs and similar hashing strings | Statement | E | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2400 | ||
| 83 | Chain Letter | *special dfs and similar graphs | Statement | D | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2300 | ||
| 18755 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 2111 | Making Genome in Berland | *special dfs and similar strings | Statement | B | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 1800 |