The 2018 Egyptian Collegiate Programming Contest was held yesterday this was a problem from it where he asks for
Where n<=10^5 and a[i]<=10^5 answer should be printed %10^9+7
I would appreciate any help in solving this problem and thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 3778 |
2 | Benq | 3592 |
3 | ecnerwala | 3521 |
4 | Um_nik | 3423 |
5 | jiangly | 3375 |
6 | Petr | 3342 |
7 | Radewoosh | 3337 |
8 | scott_wu | 3313 |
9 | maroonrk | 3265 |
10 | yosupo | 3259 |
# | User | Contrib. |
---|---|---|
1 | Errichto | 201 |
2 | 1-gon | 200 |
3 | rng_58 | 194 |
4 | SecondThread | 193 |
5 | awoo | 187 |
6 | vovuh | 183 |
7 | Um_nik | 181 |
8 | antontrygubO_o | 177 |
9 | Ashishgup | 175 |
10 | -is-this-fft- | 171 |
The 2018 Egyptian Collegiate Programming Contest was held yesterday this was a problem from it where he asks for
Where n<=10^5 and a[i]<=10^5 answer should be printed %10^9+7
I would appreciate any help in solving this problem and thanks in advance
Name |
---|
Auto comment: topic has been updated by Dijkstra. (previous revision, new revision, compare).
inclusion exclusion
For a fixed g how many pairs that will have this g as a gcd, it'll be all multiples of g, it's easy to get the sum of multiplying those pairs.
but there is a problem with this, there will be some pairs that will be calculated multiple times, so we have to exclude the answer of (2 * g, 3 * g, ...), for example if we are solving when g = 2 we know that all the numbers divisible by 4 is also divisible by 2, so we have to exclude the answer of 4, and so on.
so the answer is iterate from the max number in descending order to 1 and solve for each fixed g, the total complexity of this solution is
Why do you need to, if for example g=2, to exclude twice the answer of 4?
EDIT: I got it. It turns out that in the calculation of g=2, I overcount the pairs that have 4 as a gcd and I count them as having 2 as a gcd... In the ans[4], they are divided by 4 (their gcd), so to remove the overcounting I multiply the ans[4] by 2.
Mhm... nice problem. Do you agree, mnbvmar?
<3
Story: We proposed this exact task (under a tiny bit different constraints, though) to our high school students back in 2015. I was quite surprised that apparently it has never appeared anywhere even though the statement feels really natural and obvious. So it seems it eventually did!
I think Proszek_na_ludka came up with another solution, involving...
the Möbius inversion formula
I can't remember any details, though. Mind sharing (if you still remember it)?
First I calculated an array B[n] such, that
(how: first set
, then for each i from 1 to n iterate over all multiples of i and subtract B[i] from B[di]).
Now we can just iterate over all possible d and add to accumulator sum of entries divisible by d squared times B[d]. This way for each pair a[i], a[j] we have added
, which is equal to 
The only moment where Möbius inversion formula came into play was calculating B[n] array. It can also be done using that formula, but the way I posted here is much easier. I think i used this approach on that contest back in 2015, but I'm not sure