| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Recently, I was trying to solve a problem. To solve that I shall have to solve a sub problem. The sub problem is:
I will be provided some values. I want to find number of pairs possible for that set of values who have gcd>1
Can anyone suggest an efficient approach? I just want you to give me hints so that I can start from that point of view and move forward.
if the values are $$$\le 10^6$$$, you can try to check $$$d,2d,3d...$$$ for each $$$2\le d \le 10^6$$$
Can you please elaborate a little bit?
make the array $$$cnt$$$, where $$$cnt_d$$$ means the number of occurrences of value $$$d$$$ in the array.
And when you check $$$d$$$ and $$$2d$$$, whose gcd is $$$2$$$, the number of pairs they make is $$$cnt_d*cnt_{2d}$$$