zoukankan      html  css  js  c++  java
  • hdu 5317 RGCDQ

    RGCDQ

    Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 309    Accepted Submission(s): 156


    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)) (Li<jR)
     

    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
     

    Recommend



    /*
    dp[i][j]记录小于等于i的含有不同质因子的个数
    
    */
    
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    #include<queue>
    #include<stack>
    #include<vector>
    #include<set>
    #include<map>
    
    #define L(x) (x<<1)
    #define R(x) (x<<1|1)
    #define MID(x,y) ((x+y)>>1)
    
    #define bug printf("hihi
    ")
    
    #define eps 1e-8
    typedef __int64 ll;
    
    using namespace std;
    
    
    #define INF 0x3f3f3f3f
    #define N 1000005
    #define M 8
    
    int dp[N][M];
    int pri[9]={2,3,5,7,11,13,17,19,23};
    int a[N];
    
    void inint()
    {
        int i,j;
         for(i=2;i<N;i++)
            if(!a[i])
             for(j=1;i*j<N;j++)
                a[i*j]++;
    
       for(i=1;i<M;i++)
          for(j=1;j<N;j++)
             if(a[j]==i) dp[j][i]=dp[j-1][i]+1;
               else  dp[j][i]=dp[j-1][i];
    }
    
    int main()
    {
       inint();
       int i,j,t;
       scanf("%d",&t);
       int le,ri;
       int ans;
       while(t--)
       {
           scanf("%d%d",&le,&ri);
    
           for(i=8;i>=1;i--)
           {
               if(dp[ri][i]-dp[le-1][i]>1)
               {
                   ans=i;
                   break;
               }
               for(j=i+i;j<8;j+=i)
               {
                   if(dp[ri][j])
                   {
                       ans=i;
                       i=10;
                       break;
                   }
               }
           }
           printf("%d
    ",ans);
       }
       return 0;
    }
    


  • 相关阅读:
    Weebly轻松创建个人网站
    人生如游戏
    1 欧拉角与四元数计算机动画笔记
    图形学相关的一些数学基础书
    1047 Student List for Course (25 分)
    1124 Raffle for Weibo Followers (20 分)
    1065 A+B and C (64bit) (20 分)
    1036 Boys vs Girls (25 分)
    1039 Course List for Student (25 分)
    1054 The Dominant Color (20 分)
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/6791539.html
Copyright © 2011-2022 走看看