Sum of GCD pairs in a given range of integers

Правка en1, от yyjhzx, 2018-01-15 22:41:09

Hi, i'm trying to solve the following problem : Given 1 ≤ m ≤ n ≤ 100000 , calculate:

If n = m is kind of easy, but i can't think of anything for n > m.

PS:I think an solution or anything similar can be squeezed to pass TL , if you have any idea please share :D

Теги gcd, nt, mobius?, moo00oo

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский yyjhzx 2018-01-15 22:41:09 380 Initial revision (published)