The answer is coming 0 instead of some positive value for some test cases Submission: https://codeforces.me/contest/1703/submission/164043486
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 08.11.2026 18:04:23 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Typecast pow into long long .it might work.
when printing the answer it's not enough to take dp [ n ] [ i ] , you need to take dp [ j ] [ i ] over all n elements..
Thank you!!! This worked and also I get it why it is not enough to take dp[n][i] while calculating the final answer.
there is a case when you will not to buy a good key anymore then you will never have a negative values in the next moves , from buying the bad key you will still add to your answer either 0 or some value greater than 0 .. I hope this is clear