So the question is count the number of increasing subsequence such that the gcd of subsequence will be equal to 1.
1 <= size of array <= 1e5 1 <= a[i] <= 1e6
can anyone help me solve this problem.
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3620 |
5 | orzdevinwang | 3612 |
6 | Benq | 3586 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 155 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
6 | cry | 148 |
9 | Petr | 147 |
10 | nor | 145 |
count increasing subsequence in O(n)
So the question is count the number of increasing subsequence such that the gcd of subsequence will be equal to 1.
1 <= size of array <= 1e5 1 <= a[i] <= 1e6
can anyone help me solve this problem.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | i_am_not_special | 2024-08-08 17:19:56 | 19 | |||
en3 | i_am_not_special | 2024-08-08 10:38:39 | 4 | |||
en2 | i_am_not_special | 2024-08-08 10:35:06 | 2 | |||
en1 | i_am_not_special | 2024-08-08 10:30:34 | 239 | Initial revision (published) |
Name |
---|