HDU 2710

Max Factor

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11584    Accepted Submission(s): 3665

 

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

这道题目只需要找到数据含有最大质数的数，如：36 38 40 42 即19为38的最大质数，也是4个数中最大的质数。

所以输出包含最大质数的数38，还要题目最后说如果有多个，要输出最前面的那个数。

打表就好了。

#include<cstdio>
#include<cstring>

int book[20050];

void init()
{
	memset(book, 0, sizeof(book));
	book[1] = 1; // 这道题目是这样 
    for (int i = 2; i <= 20050; i++)
    {
        if(book[i] == 0)//没有被更新过
            for(int j = i; j < 20050; j+=i)
            {
                book[j] = i;
            }

    }
}

int main()
{
    init();
/*	memset(book, 0, sizeof(book));
	book[1] = 1; // 这道题目是这样 
    for (int i = 2; i < 20050; i++)
    {
        if(book[i] == 0)//没有被更新过
            for(int j = i; j < 20050; j+=i)
            {
                book[j] = i;
            }
    }*/
    int n, ans, max = -1;
	while(~ scanf ("%d", &n))
   {
   		max = -1;
	    while (n --)
 	   {
 	       int x;
 	       scanf ("%d", &x);
			if (book[x] > max)	
			{
				max = book[x];
				ans = x;
			}
 	   }
	    printf ("%d\n", ans);
	}
    return 0;
}