Max Factor
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
Source
USACO 2005 October Bronze
一开始智障的胖头鱼,神奇的超时,因为没有用更好的套路。
AC代码
#include <cstdio>
#include <cstring>
#define MAXN 20005
int s[MAXN];
int main()
{
int n, m;
memset(s, 0, sizeof(s));
s[1] = 1;
for (int i = 2; i < MAXN; i++)
{
if (s[i] == 0)
for (int j = i; j < MAXN; j += i)//此处的更新是个套路~
{
s[j] = i;
}
}
while (~scanf("%d", &n))
{
int ans;
int maxx = -1;
for (int i = 0; i < n; i++)
{
scanf("%d", &m);
if (s[m] > maxx)
{
maxx = s[m];
ans = m;
}
}
printf("%d\n", ans);
}
return 0;
}