阅读背景:

Sum Of Gcd(欧拉函数+莫队算法详解)

来源:互联网 

Sum Of Gcd

 Given you a sequence of number a 1, a 2, ..., a n, which is a permutation of 1...n.
You need to answer some queries, each with the following format:
Give you two numbers L, R, you should calculate sum of gcd(a[i], a[j]) for every L <= i < j <= R. 
 Given you a sequence of numbe



你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: