HDU 2710

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

#include <iostream>
#include <string.h>
using namespace std;

int n[20017];

int main()
{
    int a,i,j,b,ma=-1,g;
    memset(n,0,sizeof(n));
    n[1]=1;
    for(i=2; i<20017; i++)
    {
        if(n[i]==0)
        {
            for(j=i; j<20010; j=j+i)
            {
                n[j]=i;
            }
        }
    }
    while(cin >> a)
    {
        ma=-1;
        for(i=1; i<=a; i++)
        {
            cin >> b;
            if(n[b]>ma)
            {
                ma=n[b];
                g=b;
            }
        }
        cout << g << endl;;
    }
    return 0;
}