HDU 5317 RGCDQ

最新推荐文章于 2017-03-21 12:09:49 发布

Ritchie丶

最新推荐文章于 2017-03-21 12:09:49 发布

阅读量194

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/qq_33328072/article/details/51655553

版权

数论专栏收录该内容

25 篇文章 0 订阅

订阅专栏

RGCDQ

Time Limit: 3000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

Submit Status

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

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

Source

2015 Multi-University Training Contest 3

题意

定义函数f(x)表示：x的不同素因子个数。

给定L和R(L<=i< j<=R),求区间内任意不相等的两个数f(x)的最大公约数的最大值。

解法

2*3*5*7*11*13*17 > 10 ^ 6 ,所以f(x)的最大值为7.

先用筛素数的方法求出每个数素因子的个数，然后记录一下每个数i是否有j个素因子（f[i][j]）再求出其前缀和就是2到i中素因子个数为j的数的个数。

对于每次查询[l, r]，如果存在j对任意k(j < k)有sum[l-1][j] - sum[r][j] > 1并且sum[l-1][k] - sum[r][k] <= 1, 那么说明存在 l <= x < y <=r 使 gcd(f(x),f(y)) = f(x) = f(y) 即此时的f(x)为答案。

#include <iostream>
#include <stdio.h>
using namespace std;
const int maxn=1000005;
int a[maxn]={0};
int sum[maxn][8];
void get()
{
    int i,j;
    for(i=2;i<=maxn;i++)
    {
        if(!a[i])
        {
            for(j=i;j<=maxn;j+=i)
            a[j]++;
        }
    }
    for(i=2;i<=maxn;i++)
    for(j=1;j<=7;j++)
    sum[i][j]=sum[i-1][j]+(a[i]==j);
}
int main()
{
    get();
    int T;
    scanf("%d",&T);
    while(T--){
        int l, r;
        scanf("%d%d",&l,&r);
        int ans = 1;
        for(int i = 7; i > 0; i--)
        {
            if(sum[r][i] - sum[l-1][i] > 1){
                ans = i;
                break;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}