hi how to solve the problem change from the spoj (http://www.spoj.com/problems/TPC07/)
i read concrete mathematics chapter 7 about coin change. but i can't able to understand can anybody help me to get idea about solving this problem ?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
3 | nor | 156 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | cry | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
hi how to solve the problem change from the spoj (http://www.spoj.com/problems/TPC07/)
i read concrete mathematics chapter 7 about coin change. but i can't able to understand can anybody help me to get idea about solving this problem ?
Name |
---|
This is a dynamic programming problem. First learn something about it, then approach this problem
The upper limit of n is quite large, where 1 ≤ n ≤ 1000000000. How to cater for this with DP?
Probably there is a more general formula?
Well the idea is for dp, but you need to use matrices to run it fast, in time
(50 is the maximal value of a coin).
I can explain more if you want.
It can be solved in O(1).
We want to count the number of solutions of x1 + 5x2 + 10x3 + 25x4 + 50x5 = N.
x1 must be congruent with n%5, so is equivalent to count the number of solutions of x1 + x2 + 2x3 + 5x4 + 10x5 = ⌊ N / 5⌋ = M
Let's suppose
(i.e xi = 5ai + ri), for i ≤ 3.
We can brute force all possibilities of ri, now we have to count the solutions of
a1 + a2 + 2a3 + x4 + 2x5 = ⌊ (M - r1 - r2 - 2r3) / 5⌋ = P
Grouping, (a1 + a2 + x4) + 2(a3 + x5) = P which can be solved by![](https://espresso.codeforces.com/12f6f19f038e4068db66e710394f405e2190c5a4.png)