Given an array of integers A of length N. For each index i, find number of indices j(j!=i) such that gcd(A[i],A[j])>1.
Constraints:
N<=1e5
1<=A[i]<=N
Example:
A = [4,3,2,4] output = [2,0,2,2]
A = [2,3,6,4,6,5] output = [3,2,4,3,4,0]
# | 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 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 151 |
8 | awoo | 151 |
10 | TheScrasse | 147 |
Help needed in this number theory problem
Given an array of integers A of length N. For each index i, find number of indices j(j!=i) such that gcd(A[i],A[j])>1.
Constraints:
N<=1e5
1<=A[i]<=N
Example:
A = [4,3,2,4] output = [2,0,2,2]
A = [2,3,6,4,6,5] output = [3,2,4,3,4,0]
Name |
---|