The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6.
(a,b) can be easily found by the Euclidean algorithm. Now Carp is considering a little more difficult problem:
Given integers N and M, how many integer X satisfies 1<=X<=N and (X,N)>=M.
Input
The first line of input is an integer T(T<=100) representing the number of test cases. The following T lines each contains two numbers N and M (2<=N<=1000000000, 1<=M<=N), representing a test case.
Output
For each test case,output the answer on a single line.
Sample Input
3
1 1
10 2
10000 72
Sample Output
1
6
260
枚举 NN 的大于等于 MM 的约数 xx,这样,gcd(N,x)≥Mgcd(N,x)≥M,最后的结果为所有 N/xN/x 的欧拉函数之和。
设 y=N/xy=N/x,欧拉函数是小于 yy 并且与 yy 互质的数的个数,这样 gcd(x∗pi,N)gcd(x∗pi,N) 依然是等于 xx 的,这样就能避免重复计算。
这是他的博客,他的讲解如下,本来我是看懂了的,,,再一看代码。。。给跪了orz,我来替大佬补充
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T,n,m,res;
ll phi(ll x)
{
if(x==1) return 1;
ll res=x;
for(ll i=2;i*i<=x;i++)
{
if(x%i==0)
{
res-=res/i;
while(x%i==0) x/=i;
}
}
if(x>1) res-=res/x;
return res;
}
int main()
{
cin>>T;
while(T--)
{
cin>>n>>m; res=0;
for(ll i=1;i*i<=n;i++)
{
if(n%i) continue;//只取n的因子,因为其他满足条件的数字可以用
//n的因子*n的因子的素因子来推出来
//比如 10 5--1,2,3,4(与5互质的数,欧拉函数)
//满足条件的是1*2 2*2 3*2 4*2;
if(i>=m&&i*i!=n) res+=phi(n/i);
//&&i*i是因为下一步取得时候会重复
//因为这个大于等于m且是10的因子的数,那么gcd(10,它*任意一个数)肯定>=m
//这一步就是取了因子*(10/这个因子)的素因子。。10这个样例的2 4 6 8
if(n/i>=m) res+=phi(i);
//这边跑的是i的素因子*(10/i)
}
cout<<res<<endl;
}
return 0;
}