GCD
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1419 Accepted Submission(s): 662
Problem Description
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.
(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方法是先枚举大于等于M的因数,由于n与他的因数的最大公约数必定是因数本身,因此其余部分应该与n/相应因数互质,这就转化为求欧拉函数。数据量太大,不能打表只能现算。。代码:#include<cstdio> using namespace std; typedef __int64 ll; ll m; ll ouler(ll n){ ll res=n; if(n==1) return 1; for(ll i=2;i<=n;++i){ if(n%i) continue; res=res/i*(i-1); while(n%i==0) n/=i; } if(n>1) res=res/n*(n-1); return res; } int main(){ int t;ll n,m,ans;scanf("%d",&t); while(t--){ scanf("%I64d%I64d",&n,&m);ans=0; for(ll i=1;i*i<=n;++i){ if(n%i) continue; if(i>=m) ans+=ouler(n/i); if(n/i!=i&&n/i>=m) ans+=ouler(i); } printf("%I64d\n",ans); } return 0; }