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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
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
Название |
---|