Link to the yesterday's codechef contest.
Unable to solve it.
Any hint or approach would be Appreciated.
Link to the yesterday's codechef contest.
Unable to solve it.
Any hint or approach would be Appreciated.
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Auto comment: topic has been updated by HaabyHings (previous revision, new revision, compare).
You can split a number
Xin sum ofMnon-negative numbers inC(X+M-1, M-1)ways. Find this answer for all such multiples ofNbelowR.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