HDOJ 题目4983 Goffi and GCD（数学，欧拉函数）

Goffi and GCD

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 592    Accepted Submission(s): 214

Problem Description

Goffi is doing his math homework and he finds an equality on his text book: \(\gcd(n - a, n) \times \gcd(n - b, n) = n^k\).

Goffi wants to know the number of (\(a, b\)) satisfy the equality, if \(n\) and \(k\) are given and \(1 \le a, b \le n\).

Note: \(\gcd(a, b)\) means greatest common divisor of \(a\) and \(b\).

 

Input

Input contains multiple test cases (less than 100). For each test case, there's one line containing two integers \(n\) and \(k\) (\(1 \le n, k \le 10^9\)).

 

Output

For each test case, output a single integer indicating the number of (\(a, b\)) modulo \(10^9+7\).

 

Sample Input

  
  

   
   2 1
3 2
  
  

 

Sample Output

  
  

   
   2
1

   
   

    
    

     
     Hint
    
    
For the first case, (2, 1) and (1, 2) satisfy the equality.

   
   
   
    
  
  

 

Source

BestCoder Round #6

 

Recommend

heyang   |   We have carefully selected several similar problems for you:   5053  5052  5051  5050  5049 

思路：http://blog.csdn.net/ck_boss/article/details/38822259

题意：
给你 N 和 K,问有多少个数对满足 gcd(N-A, N) * gcd(N - B, N) = N^K

分析：
由于 gcd(a, N) <= N,于是 K>2 都是无解,K=2 只有一个解 A=B=N,只要考虑 K = 1 的情况就好了
其实上式和这个是等价的 gcd(A, N) * gcd(B, N) = N^K,我们枚举 gcd(A, N) = g,那么gcd(B, N) = N / g。问题转化为统计满足 gcd(A, N) = g 的 A 的个数。这个答案就是 ɸ(N/g)
只要枚举 N 的 约数就可以了。答案是 Σɸ(N/g)*ɸ(g) g | N
计算 ɸ 可以递归,也可以直接暴力计算,两个都可以。

 

ac代码

#include<stdio.h>
#include<string.h>
#define mod 1000000007
__int64 eular(__int64 n)
{
	int i;
	__int64 ans;
	ans=n;
	for(i=2;i*i<=n;i++)
	{
		if(n%i==0)
		{
			ans-=ans/i;
			while(n%i==0)
				n/=i;
		}
	}
	if(n>1)
		ans-=ans/n;
	return ans;
}
int main()
{
	__int64 n,k;
	while(scanf("%I64d%I64d",&n,&k)!=EOF)
	{
		__int64 i;
		__int64 sum=0,g;
		if(n==1)
			printf("1\n");
		else
			if(k>2)
				printf("0\n");
			else
				if(k==2)
					printf("1\n");
				else
				{
					for(i=1;i<=n;i++)
					{
						if(i*i>n)
							break;
						if(n%i==0)
						{
							g=n/i;
							if(g!=n/g)
							{
								sum=(sum+(eular(n/g)*eular(g)*2)%mod)%mod;	
							}
							else
								sum=(sum+eular(n/g)*eular(g))%mod;
						}
					}
					printf("%I64d\n",sum);
				}
	}
}