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 |
|---|---|---|---|---|---|---|---|---|---|
| 386 | INOI Final Contests | combinatorics dp | Statement | D | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 1517 | Chaotic Merge | combinatorics dp | Statement | E | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 441 | A Perfect Problem | combinatorics dp | Statement | E | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #752 | |
| 307 | PalindORme | combinatorics dp | Statement | F | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 3500.0 | tutorial | 2900 |
| 3575 | Arena | combinatorics dp | Statement | E | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 609 | MEX counting | combinatorics dp | Statement | F | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 1183 | Fancy Stack | combinatorics dp | Statement | F | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 468 | Illumination | combinatorics dp | Statement | G | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 9249 | Binary Strings are Fun | combinatorics dp | Statement | C | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 1036 | Wooden Spoon | combinatorics dp | Statement | D | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 2000.0 | Codeforces Round #850 Editorial | |
| 449 | Prediction | combinatorics data structures dp | Statement | G | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 1756 | Non-Intersecting Subpermutations | combinatorics dp | Statement | E | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 745 | Twin Friends | combinatorics dp | Statement | H | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 819 | Count BFS Graph | combinatorics dp | Statement | J | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 1507 | Counting Is Fun (Easy Version) | combinatorics dp | Statement | D1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 803 | Counting Is Fun (Hard Version) | combinatorics dp | Statement | D2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 1987 | Distance to Different | combinatorics dp | Statement | E | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 223 | Deterministic Heap (Hard Version) | combinatorics dp | Statement | E2 | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 |