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.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
count increasing subsequence in O(n) -> OA Problem
Revision en4, by i_am_not_special, 2024-08-08 17:19:56
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/22/2025 07:23:48 (k2).
Desktop version, switch to mobile version.
Supported by
