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
#include <iostream>
#include <cmath>
bool isPrime(int num);
int main(int argc, const char* argv[])
{
int n = 0;
while (std::cin >> n)
{
int *pArr = new int[n];
for (int i=0; i<n; ++i)
{
std::cin >> pArr[i];
}
int nFind = 1, nPrime = 0;
for (int i=0; i<n; ++i)
{
for (int j=1; j<=sqrt((double)pArr[i]); ++j)
{
if (pArr[i]%j == 0 && isPrime(pArr[i]/j) && (pArr[i]/j > nPrime))
{
nPrime = pArr[i]/j;
nFind = pArr[i];
}
}
}
std::cout << nFind << std::endl;
delete[] pArr;
}
return 0;
}
bool isPrime(int num)
{
if (1 == num)
{
return false;
}
else
{
for (int i=2 ; i<=sqrt((double)num); ++i)
{
if (num%i == 0)
{
return false;
}
}
return true;
}
}