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
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | Petr | 146 |
10 | SecondThread | 144 |
Summation of all pair of number's LCM(Lowest Common Multiple)
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
Name |
---|