Can anyone help me with this problem:
Problem: Number of Solution of equation x_1 + x_2 + x_3 + ... x_k = N
for all i: x_i>=0 and x_i<=x_(i+1) constraints:[N<= 10^9 k<=10]
[basically non-decreasing solutions]
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | cry | 158 |
4 | atcoder_official | 156 |
4 | nor | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
8 | Um_nik | 153 |
10 | djm03178 | 146 |
Can anyone help me with this problem:
Problem: Number of Solution of equation x_1 + x_2 + x_3 + ... x_k = N
for all i: x_i>=0 and x_i<=x_(i+1) constraints:[N<= 10^9 k<=10]
[basically non-decreasing solutions]
Name |
---|
Generate the solution for small N and K and look for a recurrence relation.
Wouldn't you get a O(NK) solution with that?
By the way, I already thought of an O(NK) solution:![](https://espresso.codeforces.com/761f4d8484df9154d6f054b2ecf24519c0035c97.png)
You can get O(logN * K3) by using matrix exponentiation (if your formula allows it).
EDIT: That formula is not compatible with matrix exponentiation. Maybe there is another one.
I think it is compatible because f(n, k - 1) + f(n - k, k) = f(n - k, k) + f(n - k + 1, k - 1) + ... + f(n - 1, 1).
For example when k = 3:![](https://espresso.codeforces.com/2431fe334d3d3a1315a91337dfd347b0e0f452f9.png)
Its time complexity is O(K6logN).
I think this should work...
The 'x' values must be integers?
Aren't there infinitely many solutions if we don't assume it?
Hint 1: Prove that the equation is equivalent to y_1 + 2y_2 + ... + ky_k = N. Hint 2: Digit DP. Represent each y_i as a binary number and fix the parity.