hdu4135Co-prime

Co-prime

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

Problem Description

Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N.
Two integers are said to be co-prime or relatively prime if they have no common positive divisors other than 1 or, equivalently, if their greatest common divisor is 1. The number 1 is relatively prime to every integer.

 

Input

The first line on input contains T (0 < T <= 100) the number of test cases, each of the next T lines contains three integers A, B, N where (1 <= A <= B <= 10 ¹⁵) and (1 <=N <= 10 ⁹).

 

Output

For each test case, print the number of integers between A and B inclusive which are relatively prime to N. Follow the output format below.

 

Sample Input

  
  

   
   2
1 10 2
3 15 5
  
  

 

Sample Output

  
  

   
   Case #1: 5
Case #2: 10
  
  
  
  

   
   #include<stdio.h>
#define LL long long
LL num;
LL p[20];
void get(LL n)
{

   
   	num=0;

   
   	for(LL i=2;i*i<=n;i++)

   
   	if(n%i==0)

   
   	{

   
   		p[num++]=i;

   
   		while(n%i==0)

   
   		n/=i;

   
   	}

   
   	if(n>1)

   
   	p[num++]=n;
}
LL solve(LL n)
{

   
   	LL sum=0;

   
   	for(LL i=1;i<(1LL<<num);i++)

   
   	{

   
   		LL l=1;

   
   		LL s=0;

   
   		for(LL j=0;j<num;j++)

   
   		if(i>>j&1)

   
   		{

   
   			s++;

   
   			l*=p[j];

   
   		}

   
   		if(s&1)

   
   		sum+=n/l;

   
   		else

   
   		sum-=n/l;

   
   	}

   
   	return sum;
}
int main()
{

   
   	int t;

   
   	LL a,b,n;

   
   	scanf("%d",&t);

   
   	int l=0;

   
   	while(t--)

   
   	{

   
   		scanf("%lld%lld%lld",&a,&b,&n);

   
   		get(n);

   
   		printf("Case #%d: %lld\n",++l,b-a+1-solve(b)+solve(a-1));

   
   	}

   
   	return 0;
}