boj 1339 简单题 用递归找到最大素数因子即可
2011-03-22 17:52
169 查看
地址:http://acm.scs.bupt.cn/onlinejudge/showproblem.php?problem_id=1339
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
jyc
#include<iostream>
using namespace std;
int ifprime(int x)
{
int max,i=2;
while(i*i<=x) //i的平方如果大于x,则i以后的因子都曾经在前面出现过
{
if(x%i==0)
{
max=ifprime(x/i); //递归判断
return max;
}
i++;
}
return x;
}
int main()
{
int i,j,n,max,sign=1;
int a[5001],b[5001];
while(cin>>n)
{
max=1;
for(i=0;i<n;i++)
{
cin>>a[i];
j=ifprime(a[i]);
b[i]=j;
}
for(i=0;i<n;i++)
{
if(max<b[i])
{
max=b[i];
sign=a[i];
}
}
cout<<sign<<endl;
}
system("pause");
return 0;
}
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
jyc
#include<iostream>
using namespace std;
int ifprime(int x)
{
int max,i=2;
while(i*i<=x) //i的平方如果大于x,则i以后的因子都曾经在前面出现过
{
if(x%i==0)
{
max=ifprime(x/i); //递归判断
return max;
}
i++;
}
return x;
}
int main()
{
int i,j,n,max,sign=1;
int a[5001],b[5001];
while(cin>>n)
{
max=1;
for(i=0;i<n;i++)
{
cin>>a[i];
j=ifprime(a[i]);
b[i]=j;
}
for(i=0;i<n;i++)
{
if(max<b[i])
{
max=b[i];
sign=a[i];
}
}
cout<<sign<<endl;
}
system("pause");
return 0;
}
相关文章推荐
- HDU Largest prime factor && nyoj 520 最大素因子【素数】
- hdu 2136Largest prime factor n的最大因子是第几个素数
- 平均年龄 开始以为用递归,后来发现,直接循环即可,挺简单
- 素数筛选,整数的唯一分解,整数所有因子之和,递归求等比数列前n项和
- 最大素数因子(hdu2136)
- PE3 Largest prime factor(最大素数因子)
- hdu2710(找出这个数的最大素数因子,并输出这个数)
- 百练习+最大生成树,在其中找到最小的边,1,N链接即可
- hdu 2136(最大素数因子)
- poj3048--Max Factor(最大素数因子)
- 【ZOJ 1562和 BZOJ 1053】【反素数】【求n以内的因子最多的那个数(即不超过n的最大反素数)】
- hdoj2136 求数的最大素数因子
- HDU 2136 找出某数的最大素数因子
- Largest prime factor(最大素数因子)
- 求数n的最大素因子是第几个素数
- POJ 1118(斜率,排序,找到最大的简单方法)
- hdu 2136(最大素数因子)
- 简单编程(十六)编写递归方法返回x和y的最大公约数
- hdu 2710 最大的素数因子
- ny520 最大素因子 筛选法求素数