Q: Given an array of n integers, find the sum of value of GCD for all possible pairs.
2 <= n <= 10 ^ 5
1 <= a[i] <= 10 ^ 5
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Q: Given an array of n integers, find the sum of value of GCD for all possible pairs.
2 <= n <= 10 ^ 5
1 <= a[i] <= 10 ^ 5
Название |
---|
u can use gcd convulation
I'm unaware about that technique, can you please describe the algorithm ?
or what we can do is count no.of pairs having (gcd=x) for every x from 1 to 1e5 using dp,now iterate over this x,so your answer is summation(x*(cnt)),this is standard question,ping me if you want implementation
please show the implementation
isn't it n square solution?
no
It's nlogn like sieve of erato something
.
it's an upper bound for harmonic series
you can dp on number of pairs with gcd x, an then simply sum and multiply
you can look up here, recent Div 2 D question Solution by MagentaCobra
you may look at submissions / Tutorial for this problem
it discus the same idea you talk about....
This one is also kinda similar