RGCDQ
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 853 Accepted Submission(s): 386
Problem Description
Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Greatest Common Divisor Query (RGCDQ). What’s RGCDQ? Please let me explain it to you gradually. For a positive integer x, F(x) indicates the number of kind of prime factor of x. For example F(2)=1. F(10)=2, because 10=2*5. F(12)=2, because 12=2*2*3, there are two kinds of prime factor. For each query, we will get an interval [L, R], Hdu wants to know
maxGCD(F(i),F(j))
(L≤i<j≤R)
Input
There are multiple queries. In the first line of the input file there is an integer T indicates the number of queries.
In the next T lines, each line contains L, R which is mentioned above.
All input items are integers.
1<= T <= 1000000
2<=L < R<=1000000
In the next T lines, each line contains L, R which is mentioned above.
All input items are integers.
1<= T <= 1000000
2<=L < R<=1000000
Output
For each query,output the answer in a single line.
See the sample for more details.
See the sample for more details.
Sample Input
2 2 3 3 5
Sample Output
1 1
Source
Recommend
题目首先定义了一个函数F[x]: F(x) indicates the number of kind of prime factor of x.
然后T组测试数据(1<= T <= 1000000)每组测试数据求maxGCD(F(i),F(j))
maxGCD(F(i),F(j))
GCD(F(i),F(j))
(L≤i<j≤R)
首先会发现F[x] (1<=x<=1000000) 不会是一个很大的数(实际最大为7),对于已经求出F[i]值的一个区间只有几个数
,即使暴力也可行。
若同一个F[i]值出现两次以上,要考虑到他们的gcd()就是自身。
首先肯定是要求F[i]的,因为T非常大,就要考虑到每次输入区间L,R,能快速得到该区间有没有1到7这7个F[i]值。
解决办法是开一个数组p[8][maxn],对于[L,R]区间 使得f[x]==k的x个数为 p[k][R]-p[k][L-1];
这样就能判断1到7中的每个值到底有没有 。
最终修改代码:
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
using namespace std;
const int maxn=1000000;
int F[maxn+10];
int p[8][maxn+10];
int ans[12];
int gcd(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
inline void Eratosthenes() //直接的得出F[j]值,所以这个筛法的本质是每次都用一个不同的素数筛
{
memset(F,0,sizeof F);
int m=sqrt(maxn);
for(int i=2;i<=maxn;i++)
{
if(!F[i])
for(int j=i;j<=maxn;j+=i)
F[j]++;
}
}
inline void getp()
{
for(int i=1;i<=7;i++)
p[i][0]=p[i][1]=0;
for(int i=2;i<=maxn;i++)
{
for(int j=1;j<=7;j++)
{
p[j][i]=p[j][i-1];
if(F[i]==j) p[j][i]++;
}
}
}
int main()
{
Eratosthenes();
getp();
int n,m;
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
memset(ans,0,sizeof ans);
for(int i=1;i<=7;i++)
{
int tmp=p[i][m]-p[i][n-1];
ans[i]+=tmp;
}
int maxi=1;
for(int i=7;i>=3;i--)
{
if(ans[i]>=2)
{maxi=i;break;}
}
if(maxi >=3 ) {printf("%d\n",maxi);continue;} //情况无非这几种
if(ans[2]&&ans[4]) maxi=2;
if(ans[3]&&ans[6]) maxi=3;
printf("%d\n",maxi);
}
return 0;
}
之前比赛的代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAXN=1000000+10;
int prime[78510];
int F[MAXN];
bool noprime[MAXN];
//int dp[10][MAXN]
int p[7][MAXN];
int gcd(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int cnt;
inline void Eratosthenes()
{
memset(noprime,0,sizeof(noprime));
int m=sqrt(MAXN);
for(int i=2;i<=m;i++)
{
if(!noprime[i])
for(int j=i*i;j<=MAXN;j+=i)
noprime[j]=1;
}
}
inline void Get_prime()
{
/*
memset(prime,0,sizeof prime);
for (int i=2;i<=MAXN;i++)
{
if (!prime[i]) { prime[++prime[0]]=i;
for (int j=1;j<=prime[0]&&prime[j]<=MAXN/i;j++){
prime[prime[j]*i]=1;
if (i%prime[j]==0) break;
}
}
}*/
memset(prime,0,sizeof prime);
// cout<<prime[0]+cnt<<endl;
for(int i=2;i<=MAXN;i++)
{
if(!noprime[i])
prime[++prime[0]]=i;
else
cnt++;
}
// for(int i=2;i<=MAXN;i++)
// {
// if(noprime[i])
// cnt++;
// }
}
inline void numprime()
{
memset(F,0,sizeof F);
for(int i=1;i<=prime[0];i++)
{
for(int j=prime[i];j<=MAXN;j+=prime[i])
{
F[j]++;
}
}
int ret=0;
for(int i=0;i<7;i++)
p[i][1]=0;
for(int i=2;i<=MAXN;i++)
{
for(int j=0;j<7;j++)
{
p[j][i]=p[j][i-1];
if( j+1==F[i] )
p[j][i]++;
}
}
/*
for(int i=1;i<=100;i++)
{
cout<<F[i]<<" "<<p[0][i]<<endl;
}*/
// cout<<p[0][3]<<" "<<" "<<p[0][1]<<endl;
}
int main()
{
cnt=0;
Eratosthenes();
Get_prime();
numprime();
int n,m;
int T;
cin>>T;
while(T--)
{
scanf("%d%d",&n,&m);
int ans[12];
memset(ans,0,sizeof ans);
for(int i=0;i<7;i++)
{
int tmp=p[i][m]-p[i][n-1];
ans[i+1]+=tmp;
}
int mannum=0;
for(int i=1;i<10;i++)
{
if(ans[i]>=2)
mannum=max(mannum,i);
}
for (int i=1;i<10;i++)
{
if (!ans[i]) continue;
for (int j=1;j<10;j++)
{
if (!ans[j]) continue;
if(i==j) continue;
mannum=max(mannum,gcd(i,j));
}
}
printf("%d\n",mannum);
}
return 0;
}
先判断自大区间内每个数的是否是素数,在来对每个数进行分解,找出质因子种类,单纯这样做应该超时,所以比赛时的代码改进了些,又加了剪枝,没有前面的简洁
还有个地方可以改进:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAXN=1000000;
int prime[78510];
int F[MAXN+10];
int maxprime[MAXN+10];
//int dp[10][MAXN]
int p[7][MAXN+10];
int gcd(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
inline void Eratosthenes()
{
memset(maxprime,0,sizeof(maxprime));
for(int i=2;i<=MAXN;i++)
{
if(!maxprime[i])
for(int j=i;j<=MAXN;j+=i)
maxprime[j]=i;
}
}
inline void numprime()
{
memset(F,0,sizeof F);
F[1]=0;
for(int i=2;i<=MAXN;i++) //求F[x],这个地方看了别人的博客,可以改进,dp的思想
{
if(!maxprime[i]) {F[i]=1;continue;}
int y=i;
int x=maxprime[i];
while(y%x==0) y/=x;
F[i]=F[y]+1;
}
for(int i=0;i<7;i++)
p[i][1]=0;
for(int i=2;i<=MAXN;i++)
{
for(int j=0;j<7;j++)
{
p[j][i]=p[j][i-1];
if( j+1==F[i] )
p[j][i]++;
}
}
}
int main()
{
Eratosthenes();
numprime();
int n,m;
int T;
cin>>T;
while(T--)
{
scanf("%d%d",&n,&m);
int ans[12];
memset(ans,0,sizeof ans);
for(int i=0;i<7;i++)
{
int tmp=p[i][m]-p[i][n-1];
ans[i+1]+=tmp;
}
int mannum=0;
for(int i=1;i<10;i++)
{
if(ans[i]>=2)
mannum=max(mannum,i);
}
for (int i=1;i<10;i++)
{
if (!ans[i]) continue;
for (int j=1;j<10;j++)
{
if (!ans[j]) continue;
if(i==j) continue;
mannum=max(mannum,gcd(i,j));
}
}
printf("%d\n",mannum);
}
return 0;
}