Fastest way to calculate the sum of LCM(i,j) when i and j go from 1 to k

前端 未结 0 721
广开言路
广开言路 2021-01-24 04:56

I need to calculate the sum of the lcm(i,j) when i and j go from 1 to k. k can be = to numbers as big as 10^10.

its like this : https://www.programmersought.com/article/8

相关标签:
回答
  • 消灭零回复
提交回复
热议问题