flash_7's blog

Summation of all pair of number's LCM(Lowest Common Multiple)
By flash_7, history, 8 years ago, In English

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

  • Vote: I like it
  • +14
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Use the explanation of this problem as a hint: http://blog.forthright48.com/2015/08/spoj-lcmsum-lcm-sum.html

→ Reply