HDU 1164 Eddy's research I【素数筛选法】
2015-03-28 16:13
176 查看
思路:将输入的这个数分成n个素数的相乘的结果,用一个数组存储起来。之后再输出就能够了
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6633 Accepted Submission(s): 3971
Problem Description
Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write
a program which can do the number to divided into the multiply of prime number factor .
Input
The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.
Output
You have to print a line in the output for each entry with the answer to the previous question.
Sample Input
11 9412
Sample Output
11 2*2*13*181
Author
eddy
#include<stdio.h> #include<string.h> int a[55]; int getprime(int x) { memset(a,0,sizeof(a)); int i,cnt=0; for(i=2; i<=x; i++) { while(x%i==0) { a[cnt++]=i; x=x/i; } } return cnt; } int main() { int n; while(~scanf("%d",&n)) { int k,i; k=getprime(n); for(i=0; i<k-1; i++) printf("%d*",a[i]); printf("%d\n",a[k-1]); } return 0; }
相关文章推荐
- 杭电OJ——1164 Eddy's research I——素数筛选
- HDU 1164 Eddy's research I【素数筛选法】
- HDU 1164 Eddy's research I 素数因子
- hdu 1164 Eddy's research I 素数筛选法
- POJ 2262 Goldbach's Conjecture 素数筛选
- HDU-Eddy's research I-拆分素数
- 51nod 1536不一样的猜数游戏 O(n)素数筛选法。同Codeforces 576A Vasya and Petya's Game。
- POJ 2262 Goldbach's Conjecture ( 筛选法求素数 )
- HDOJ 1397:Goldbach's Conjecture 哈希加筛选法求素数
- Goldbach's Conjecture(筛选法求素数)
- zoj 1951 Goldbach's Conjecture(素数筛选继续水)
- 筛选法求素数
- 素数筛选法
- Visual Basic中的素数筛选
- LightOj 1236 Pairs Forming LCM (素数筛选&&唯一分解定理)
- 筛选法求素数
- 求初等欧拉公式 -39 ~ 40 范围内的素数
- POJ-2635 The Embarrassed Cryptographer 万进制+素数筛选
- 筛选素数空间压缩(数论)&& Double Happiness
- POJ题目2689 Prime Distance(任何区间素数筛选)