hdu5317 RGCDQ

RGCDQ

题意：F(x)表示x的质因子的种数。给区间[L,R]，求max(GCD(F(i),F(j)) (L≤i<j≤R)。（2<=L < R<=1000000）

题解：可以用筛选法求质因子种数。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=1e6+5;

int f[N],num[N][10],b[10];
void init()
{
    memset(f,0,sizeof(f));
    for(int i=2;i<N;i++)
    {
        if(f[i]==0)
        {
            f[i]=1;
            for(int j=i+i;j<N;j+=i)
            {
                f[j]++;
            }
        }
    }
    for(int i=2;i<N;i++)
    {
        for(int j=1;j<8;j++)
        {
            num[i][j]=num[i-1][j];
        }
        num[i][f[i]]++;
    }
}

int main()
{
    int t,l,r;
    init();
    cin>>t;
    while(t--)
    {
        scanf("%d%d",&l,&r);
        int ans=0;
        for(int i=1;i<8;i++)
        {
            b[i]=num[r][i]-num[l-1][i];
            if(num[r][i]-num[l-1][i]>1)
                ans=i;
        }
        if(ans!=0)
            printf("%d\n",ans);
        else if((b[2]>0&&b[4]>0)||(b[2]>0&&b[6]>0)||(b[6]>0&&b[4]>0))
            printf("2\n");
        else if(b[3]>0&&b[6]>0)
            printf("3\n");
        else
            printf("1\n");
    }
    return 0;
}

RGCDQ

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

Output

For each query，output the answer in a single line.
See the sample for more details.

Sample Input

2
2 3
3 5

Sample Output

1
1

hdu5317 RGCDQ

原文：http://www.cnblogs.com/shentr/p/5323847.html