题目的意思是,给出两个数N、M,问有多少个数X,使得gcd(X,N)>= M,其中1<=X<=N。若设gcd(X,N)= Y,显然有gcd(X/Y,N/Y)= 1,此时X/Y和N/Y是互质关系。至此,联系1<=X<=N和Y>=M,问题就转化为有多少个<=N/Y的X/Y和其互质。所求正好符合欧拉函数的特点。
所以,首先需要找出所有符合要求的Y的值,就是N中大于等于M值的因数;然后将所有的N/Y的欧拉函数值相加,就是所求。另外要注意一些特殊情况,N<M,N==M,M=1,M=0
这四种情况,结果分别是0,1,N,N,这些都是易于推敲的。
另:在欧拉函数中,若是使用int类型,应该先除后乘,否则会溢出。
Run Time: 0.14sec
Run Memory: 304KB
Code length: 1183Bytes
SubmitTime: 2012-01-30 18:38:37
// Problem#: 1199
// Submission#: 1202645
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <cstdio>
#include <vector>
using namespace std;
int Euler( int n );
int main()
{
int T, N, M;
int i, r;
scanf( "%d", &T );
while ( T-- ) {
scanf( "%d%d", &N, &M );
if ( N < M )
r = 0;
else if ( N == M )
r = 1;
else if ( M == 0 || M == 1 )
r = N;
else {
vector<int> v;
for ( i = 2; i * i < N; i++ ) {
if ( N % i == 0 ) {
if ( i >= M )
v.push_back( i );
if ( N / i >= M )
v.push_back( N / i );
}
}
if ( i * i == N && i >= M )
v.push_back( i );
r = 1;
for ( i = 0; i < v.size(); i++ )
r += Euler( N / v[ i ] );
}
printf( "%d\n", r );
}
return 0;
}
int Euler( int n ) {
int r = n;
for ( int i = 2; i * i <= n; i++ ) {
if ( n % i == 0 ) {
while ( n % i == 0 )
n /= i;
r = r / i * ( i - 1 ) ;
}
}
if ( n != 1 )
r = r / n * ( n - 1 );
return r;
}