Given a number N we have to find the summation of all possible LCM(i,j) where i <= j <= N.
Constraints: N<=10^6 and total test case <= 10^5
Problem Link : Light OJ 1375
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 16:17:51 (i1).
Desktop version, switch to mobile version.
Supported by
Use the explanation of this problem as a hint: http://blog.forthright48.com/2015/08/spoj-lcmsum-lcm-sum.html
Thank you so much :) Sam vai already wrote about this didn't notice earlier :P
You're welcome :P
Can you please provide the solution for this? The above link seems dead
https://forthright48.com/spoj-lcmsum-lcm-sum/
Here you go