HDOJ 5317 RGCDQ water

Source: Internet
Author: User
Tags greatest common divisor

HDOJ 5317 RGCDQ water

 

The number of different factors in each number after preprocessing. The factor cannot exceed 7.

 

RGCDQ Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission (s): 641 Accepted Submission (s): 304



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
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
22 33 5

Sample Output
11

Source 2015 Multi-University Training Contest 3

 

 

/*************************************** * ******** Author: CKbossCreated Time: Tuesday, January 1, July 28, 2015 27 seconds File Name: HDOJ5317.cpp *************************************** * *********/# include
   
    
# Include
    
     
# Include
     
      
# Include
      
       
# Include
       
        
# Include
        
          # Include
         
           # Include
          
            # Include
           
             # Include
            Using namespace std; const int maxn = 1000100; int kut [maxn]; int num [10] [maxn]; int ggd [10] [10]; void init () {for (int I = 2; I
             
               = 1; j --) {if (nb [j] = 0) continue; for (int I = 7; I> = 1; I --) {if (nb [I] = 0) continue; if (j = I) {if (nb [j]> 1) ans = max (ans, j );} else ans = max (ans, ggd [I] [j]);} return ans;} int main () {// freopen(in.txt, r, stdin); // freopen(out.txt, w, stdout); init (); int T_T; scanf (% d, & T_T); while (T_T --) {scanf (% d, & L, & R); int ans = solve (); printf (% d, ans);} return 0 ;}
             
           
          
         
        
       
      
     
    
   


 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.