The answer is coming 0 instead of some positive value for some test cases Submission: https://codeforces.me/contest/1703/submission/164043486
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
The answer is coming 0 instead of some positive value for some test cases Submission: https://codeforces.me/contest/1703/submission/164043486
Name |
---|
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