hdu 2710 Max Factor 筛法

hdu 2710 Max Factor 筛法

Max Factor

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 6828    Accepted Submission(s): 2258

Problem Description

To improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the range 1..20,000. Unfortunately, he is unaware that the cows interpret some serial numbers as better than others. In particular, a cow whose serial number has the highest prime factor enjoys the highest social standing among all the other cows.

(Recall that a prime number is just a number that has no divisors except for 1 and itself. The number 7 is prime while the number 6, being divisible by 2 and 3, is not).

Given a set of N (1 <= N <= 5,000) serial numbers in the range 1..20,000, determine the one that has the largest prime factor.

 

Input

* Line 1: A single integer, N

* Lines 2..N+1: The serial numbers to be tested, one per line

 

Output

* Line 1: The integer with the largest prime factor. If there are more than one, output the one that appears earliest in the input file.

 

Sample Input

  
  

   
   4
36
38
40
42
  
  

 

Sample Output

  
  

   
   38
  
  
  
  

   
   

  
  
  
  

   
   找n个数的最大素因子的最大值,筛法找到素数后,对每个数的最大素因子预处理即可
  
  
  
  

   
   
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define M 20001
int ww[M] = {0,1} ;
bool visit[M];
int main ()
{
    int i, j, ans,Max;
    memset(visit,true,sizeof(visit));
    for(int i=2; i<M; ++i)
    {
        if(visit[i]==true)
        {
            for(int j=i*i; j<M; j+=i)
            {
                visit[j]=false;
            }
        }
    }
    for (i = 2 ; i <= 20000 ; i++)
        if (visit[i])
        {
            for (j = i ; j <= 20000 ; j+=i)
                ww[j] = i ;
        }
    while(~scanf ("%d", &j))
    {
        ans=0,Max=-1;
        while (j--)
        {
            scanf ("%d", &i) ;
            if (ww[i]>Max)
            {
                ans = i;
                Max=ww[i];
            }
        }
        printf ("%d\n", ans) ;
    }
    return 0 ;
}