Link to the yesterday's codechef contest.
Unable to solve it.
Any hint or approach would be Appreciated.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
Link to the yesterday's codechef contest.
Unable to solve it.
Any hint or approach would be Appreciated.
Name |
---|
Auto comment: topic has been updated by HaabyHings (previous revision, new revision, compare).
You can split a number
X
in sum ofM
non-negative numbers inC(X+M-1, M-1)
ways. Find this answer for all such multiples ofN
belowR
.You can view my submission here.
Thanks asawasa that was helpful.
I am getting Access Denied to the page.
please ideone your submission.
EDIT — never mind, done that.
how to solve the problem 'Greedy Harshit' from the contest?
dpk
I solved the problem using dynamic programming.
let dp[i][j] be the maximum amount of gold harshit can get using subarray a[i].....a[j].
Answer needed is dp[1][n].
dp[i][j] can be calculated using dp[i + 1][j] by picking a[i]th jar or using dp[i][j — 1] by picking a[j]th jar
base case would be picking the a[i]th element at last.
link to my submission.
thanks for the help