杭电 HDU 1164 Eddy's research I
来源:互联网 发布:万科金域名邸二手房 编辑:程序博客网 时间:2024/06/04 22:48
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7117 Accepted Submission(s): 4268
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
119412
Sample Output
112*2*13*181
Author
eddy
重点是素数判定
#include<iostream>#include<algorithm>using namespace std;int prime[65536]={0}; int main(){for(int i=2;i<=(65535/2);i++){int q;for( q=i+i;q<=65535;q+=i)prime[q]=1; }int ls[10000];int n;int gq[100];while(cin>>n){int t=0;for(int j=2;j<=65535;j++){if(!prime[j]&&!(n%j)){ls[t++]=j; n/=j;if(n==1)break;}if(n<=j)j=1;}sort(ls,ls+t);for(int k=0;k<t-1;k++)cout<<ls[k]<<"*";cout<<ls[t-1]<<endl;}return 0;}
1 0
- 杭电 HDU 1164 Eddy's research I
- 杭电oj-1164-Eddy's research I
- HDU 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- Hdu 1164-Eddy's research I
- hdu(1164)Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu-1164-Eddy's research I
- hdu-oj 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I.doc
- HDU 1316 How Many Fibs?(大数+字符串数字比较)
- 博客开播
- 自动色阶算法实现
- c++ STL容器初探
- 实现对一个8bit数据指定位(例如第n位)的置0或置1操作
- 杭电 HDU 1164 Eddy's research I
- 库函数API和C代码中嵌入汇编代码两种方式使用同一个系统调用
- java8 lambda表达式
- Java之美[从菜鸟到高手演变]之设计模式三
- 中文开发者技术文档(Cocos,Cocos2d-X,Cocos2d-JS)
- DC poj 1064 Cable master
- “斐波那契查找”真的比“二分查找”快么?
- pat_1009
- 堆栈详解