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 |
|---|---|---|---|---|---|---|---|---|---|
| 44 | Zero-XOR Array | *special dp | Statement | J | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 219 | Palindromic Doubles | *special data structures dp | Statement | E | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 85 | Submatrices | *special bitmasks data structures dp | Statement | H | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 209 | Kotlinforces | *special constructive algorithms dp | Statement | F | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 78 | A Battle Against a Dragon | *special data structures dp | Statement | G | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 52 | Inverse Problem | *special combinatorics dp | Statement | I | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 210 | Maximum Sum Subarrays | *special dp | Statement | E | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 2081 | 1-3-5 | *special dp | Statement | A | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1100 | |
| 81 | Composite Spells | *special dp | Statement | H | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2600 |