Is there an efficient way to calculate the sum of lcm(x,y) for every value x and y such that 1<=x<=n && 1<=y<=n with a given n ?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/25/2024 18:09:37 (k1).
Desktop version, switch to mobile version.
Supported by
Mobius Inversion
You can also do dp where you dp[i] is sum of all x * y numbers with gcd(x, y) equal to i, and to transition u find with basic math sum of all x * y with gcd(x, y) >= i by taking sum of all multiples of i and squaring it like sieve then in sieve like fashion subtract out dp values that are multiples of i as that gets rid of overcounting. Obviously you then just take sum of dp[i] / i for all dp values. I'm p sure this dp method and mobius inversion are almost always interchangeable but not sure...