| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
A counting subarray problem
You are given an array A of size N. You have to find the number of subarrays with gcd equal to K. Constraints : 1) 1 <= n <= 1e3 and 2) 1 <= A[i], K <= 1e9
I solved this question using brute force in O(N*N*log(N)) complexity. But I am just curious if there is any O(N*logN) solution to solve it. I have searched for sometime but could not find anything. Can someone pls tell if there is any way to do it O(N*logN)? Thanks.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
I_am_Noobieee | 2024-09-16 14:32:39 | 10 | ||
| en6 |
|
I_am_Noobieee | 2024-09-16 14:32:15 | 19 | Tiny change: ' and 2) 1 <= A[i], K <= 1e9\' -> ' and 2) 0 <= A[i] <= 1e9 3) 1 <= K <= 1e9\' | |
| en5 |
|
I_am_Noobieee | 2024-09-16 14:30:13 | 12 | ||
| en4 |
|
I_am_Noobieee | 2024-09-16 14:29:16 | 19 | Tiny change: '= n <= 1e3\n 2) 1 <= ' -> '= n <= 1e3 and 2) 1 <= ' | |
| en3 |
|
I_am_Noobieee | 2024-09-16 14:28:51 | 4 | Tiny change: ' ' -> ' ' | |
| en2 |
|
I_am_Noobieee | 2024-09-16 14:28:30 | 6 | ||
| en1 |
|
I_am_Noobieee | 2024-09-16 14:27:53 | 452 | Initial revision (published) |
