Eddy's research I
来源:互联网 发布:大数据与生活的联系 编辑:程序博客网 时间:2024/05/04 15:25
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先把65535里面所有的素数都枚举出来,多组输入时查表,凡是能被整除的就输出,对n取整,判断n是否为1,若为1,结束,进行下次循环。
#include<stdio.h>#include<algorithm>#include<math.h>#include<string.h>#include<iostream>#include<string>using namespace std;int s(int n)//判断是否为素数{ int i; for(i=2; i<=sqrt(n); i++) if(n%i==0) return 0; return 1;} int a[60000]={0};int main(){ int i,j; for(i=2,j = 0; i <= 65535; i++)//素数存取 { if(s(i)) a[j++] = i; } a[j]='\0'; int tt=j,n; while(cin>>n) { for(i=0; i<tt;) { if(n%a[i]==0)//判断n是否为素数的倍数,若是,进行以下循环。 { cout<<a[i]; n=n/a[i]; if(n!=1)//若n不为1,输出* { cout<<"*"; } if(n==1)//结束 { cout<<endl; break; } } else i++; } } return 0;}
0 0
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- Eddy's research I
- HDU1164:Eddy's research I
- hdu1164-Eddy's research I
- Eddy\'s research I(HDU1164)
- hdu1164 Eddy's research I
- HDU Eddy's research I
- HDU_1164 Eddy's research I
- hdu1164 Eddy's research I
- HDU1164 Eddy's research I
- 你会做Web上的用户登录功能吗?
- windowsphone8 sdk api
- 在100G文件中找出出现次数最多的100个IP
- 面向对象总结
- spring基础知识汇总
- Eddy's research I
- DirectX11 编译着色器、创建顶点着色器、创建像素着色器
- swift2 枚举类型
- CSU 1655文本计算器
- Remove Nth Node From End of List
- CSU 1650影魔大战
- 安卓发版 混淆、第三方平台加固加密、渠道分发 完整教程(图文)
- Linux C编程——常用头文件
- JVM优化总结