Tutorial uses mobius function to solve this problem. How can we solve this using DP, as I have seen many people use it in their solutions.
# | 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 | awoo | 163 |
1 | maomao90 | 163 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
Tutorial uses mobius function to solve this problem. How can we solve this using DP, as I have seen many people use it in their solutions.
Name |
---|
Let $$$dp[i]$$$ be the number of ways with $$$\gcd = i$$$.
If you calculate it in descending order of $$$i$$$, $$$dp[i] =$$$ (number of ways with values multiples of $$$i$$$) — $$$\sum_{k=2}^{\lfloor m/i \rfloor} dp[ik]$$$.
You can check out similar techniques in this blog.
Got this bit, thanks! I was looking at your solution 125973986 Just wanted to know if you're storing in kn[i][j] : number of ways after i terms and upto jth multiple of g, or something else?
The former.