Summation of all pair of number's LCM(Lowest Common Multiple)

Revision en2, by flash_7, 2016-09-16 14:15:09

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

Tags number theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English flash_7 2016-09-16 14:15:09 4
en1 English flash_7 2016-09-16 14:11:30 276 Initial revision (published)