链接
HDU 2588 GCD - http://acm.hdu.edu.cn/showproblem.php?pid=2588
分析
欧拉函数 φ ( n ) \varphi(n) φ(n)
设 n = p 1 k 1 ⋅ p 2 k 2 ⋯ p r k r n= p_1^{k_1}\cdot p_2^{k_2} \cdots p_r^{k_r} n=p1k1⋅p2k2⋯prkr,则 φ ( n ) = n ⋅ ( 1 − 1 p 1 ) ⋅ ( 1 − 1 p 2 ) ⋯ ( 1 − 1 p r ) \varphi(n)=n\cdot (1-\frac{1}{p_1})\cdot (1-\frac{1}{p_2}) \cdots (1-\frac{1}{p_r}) φ(n)=n⋅(1−p11)⋅(1−p21)⋯(1−pr1)
欧拉函数的计算 O ( n ) O(\sqrt{n}) O(n)
int phi(int x){
int res = x;
for(int i = 2; i*i <= x; ++i){
if(x%i == 0){
res = res/i*(i-1);
while(x%i == 0) x /= i;
}
}
if(x > 1) res = res/x*(x-1);
return res;
}
代码
代码说明
- phi函数,求单个数的欧拉函数值, O ( n ) O(\sqrt{n}) O(n)
- 设 ( x , n ) = s (x, n) = s (x,n)=s,则 ( x s , n s ) = 1 (\frac{x}{s},\frac{n}{s})=1 (sx,sn)=1,遍历最大公约数,计算相应的互质的数对的数量
参考代码
// hdu 2588 GCD
#include<bits/stdc++.h>
using namespace std;
int phi(int x){
int res = x;
for(int i = 2; i*i <= x; ++i){
if(x%i == 0){
res = res/i*(i-1);
while(x%i == 0) x /= i;
}
}
if(x > 1) res = res/x*(x-1);
return res;
}
int main(){
int n, m, ans, t;
scanf("%d", &t);
while(t--){
ans = 0;
scanf("%d%d", &n, &m);
for(int i = 1; i*i <= n; ++i){
if(n % i == 0){
if(i >= m) ans += phi(n/i);
if(i*i != n && n/i >= m) ans += phi(i);
}
}
printf("%d\n", ans);
}
return 0;
}