hdu2710Max Factor(水题)
来源:互联网 发布:淘宝手链店 编辑:程序博客网 时间:2024/06/06 23:50
Max Factor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6283 Accepted Submission(s): 2056
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.
(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
* 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
436384042
Sample Output
38
题意:给你n个数,求素因子最大的那个数,如果素因子大小相同,结果为最小的那个数
思路:素数筛法,然后逐个求出最大的因数
code:
#include <stdio.h>#include <string.h>int main(){ int t,prim[20000],i,j,a,max,maxn; memset(prim,0,sizeof(prim)); prim[1]=prim[2]=prim[3]=0; for(i=3;i<=20000;i++) { for(j=i*2;j<=20000;j+=i) prim[j]=1; } while(scanf("%d",&t)>0) { max=0; maxn=0; for(i=0;i<t;i++) { scanf("%d",&a); for(j=a;j>0;j--) { if(!prim[j]) { if((a%j==0)&&(j>max)) { max=j; maxn=a; break; } } } } printf("%d\n",maxn); } return 0;}
思路很简单,但写的时候出现了一些小问题,调了很久擦 。。。
0 0
- hdu2710Max Factor(水题)
- HDU2710_Max Factor【水题】【筛法求素数】
- HDOJ 题目Largest prime factor(水题)
- HDU2136_Largest prime factor【水题】【筛法求素数】
- HDU2710 Max Factor【水题】【素因子】
- BC水题--The Factor(质因分解)
- UVALive 7035 Built with Qinghuai and Ari Factor(水题)
- CLUSTERING FACTOR
- factor因子
- Hakan factor
- Krypton Factor
- The Factor
- factor analysis
- Factor Combinations
- Factor Combinations
- Factor Combinations
- Factor Combinations
- Max Factor
- Shader Alpha混合Blend[转]
- .....
- sdutoj 3377 数据结构实验之查找五:平方之哈希表
- 汇编语言 2位十六进制数(字符),转换成数值保存到字节变量num(需要用逻辑左移指令或乘法指令)
- C#学习笔记
- hdu2710Max Factor(水题)
- 降维(子空间学习)的matlab代码程序 Matlab codes for dimensionality reduction (subspace learning)
- spark性能优化:shuffle调优
- 进程与程序的比较?
- 数据库慢了怎么办
- LeetCode---Linked List Cycle、Linked List Cycle II解题分析
- POJ3070(快速幂)
- OC 函数和对象方法的区别
- 杭电 2057 (关于十六进制的输入输出)