Co-prime
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6840 Accepted Submission(s): 2699
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 <= 1015) and (1 <=N <= 109).
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
Hint
In the first test case, the five integers in range [1,10] which are relatively prime to 2 are {1,3,5,7,9}.
题意:就是让你求(a,b)区间于n互质的数的个数.
分析:我们可以先转化下:用(1,b)区间与n互质的数的个数减去(1,a-1)区间与n互质的数的个数,那么现在就转化成求(1,m)区间于n互质的数的个数,如果要求的是(1,n)区间与n互质的数的个数的话,我们直接求出n的欧拉函数值即可,可是这里是行不通的!我们不妨换一种思路:就是求出(1,m)区间与n不互质的数的个数,假设为num,那么我们的答案就是:m-num!现在的关键就是:怎样用一种最快的方法求出(1,m)区间与n不互质的数的个数?方法实现:我们先求出n的质因子(因为任何一个数都可以分解成若干个质数相乘的),如何尽快地求出n的质因子呢?我们这里又涉及两个好的算法了!第一个:用于每次只能求出一个数的质因子,适用于题目中给的n的个数不是很多,但是n又特别大的;(http://www.cnblogs.com/jiangjing/archive/2013/06/03/3115399.html)第二个:一次求出1~n的所有数的质因子,适用于题目中给的n个数比较多的,但是n不是很大的。(http://www.cnblogs.com/jiangjing/archive/2013/06/01/3112035.html)本题适用第一个算法!举一组实例吧:假设m=12,n=30.
第一步:求出n的质因子:2,3,5;
第二步:(1,m)中是n的因子的倍数当然就不互质了(2,4,6,8,10)->n/2 6个,(3,6,9,12)->n/3 4个,(5,10)->n/5 2个。
如果是粗心的同学就把它们全部加起来就是:6+4+2=12个了,那你就大错特错了,里面明显出现了重复的,我们现在要处理的就是如何去掉那些重复的了!
第三步:这里就需要用到容斥原理了,公式就是:n/2+n/3+n/5-n/(2*3)-n/(2*5)-n/(3*5)+n/(2*3*5).
第四步:我们该如何实现呢?我在网上看到有几种实现方法:dfs(深搜),队列数组,位运算三种方法都可以!上述公式有一个特点:n除以奇数个数相乘的时候是加,n除以偶数个数相乘的时候是减。我这里就写下用队列数组如何实现吧:我们可以把第一个元素设为-1然后具体看代码如何实现吧!
#include<bits/stdc++.h>
using namespace std;
long long a[1000],num;
void init(long long n)//求一个数的质因子
{
__int64 i;
num=0;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
a[num++]=i;
while(n%i==0)
n=n/i;
}
}
if(n>1)//这里要记得
a[num++]=n;
}
long long haha(long long m)//用队列数组实现容斥原理
{
long long que[10000],i,j,k,t=0,sum=0;
que[t++]=-1;
for(i=0;i<num;i++)
{
k=t;
for(j=0;j<k;j++)
que[t++]=que[j]*a[i]*(-1);
}
for(i=1;i<t;i++)
sum=sum+m/que[i];
return sum;
}
int main()
{
long long T,x,y,n,i,sum;
while(scanf("%lld",&T)!=EOF)
{
for(i=1;i<=T;i++)
{
scanf("%lld%lld%lld",&x,&y,&n);
init(n);
sum=y-haha(y)-(x-1-haha(x-1));
printf("Case #%lld: ",i);
printf("%lld\n",sum);
}
}
return 0;
}
二进制枚举法:
#include<bits/stdc++.h>
using namespace std;
#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}
ll a,b;
int n,prime[100005];
ll slove(ll m,int cnt)
{
ll ans=0;
for(ll i=1; i<(ll)(1<<cnt); i++)
{
ll lcm=1,p=0;
for(int j=0; j<cnt; j++)
{
if((ll)(1<<j)&i)
{
p++;
lcm*=prime[j];
}
}
if(p&1)ans+=m/lcm;
else ans-=m/lcm;
}
return ans;
}
int main()
{
int T,cas=1;scanf("%d",&T);
while(T--)
{
scanf("%lld%lld%d",&a,&b,&n);
int cnt=0;
for(int i=2; i*i<=n; i++)
{
if(n%i==0)
prime[cnt++]=i;
while(n%i==0)n/=i;
}
if(n>1)prime[cnt++]=n;
printf("Case #%d: %lld\n",cas++,b-slove(b,cnt)-(a-1-slove(a-1,cnt)));
}
}