Eddy's research I
2015-07-18 21:24
435 查看
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
Sample Output
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 先把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; }
相关文章推荐
- 【Spark Core】TaskScheduler源码与任务提交原理浅析1
- 每个程序员都需要了解的一个SQL技巧
- SWIFT中获取配置文件路径的方法
- 迭代器模式
- git使用的基础及常用命令
- ACdream 1727 Sequence
- 添加view类图中的二级菜单
- IntelliJ公司版破解方法
- LeetCode-Add and Search Word - Data structure design(C++)
- Java HashMap 的实现原理详解
- odoo联调补充
- 简单理解锁
- 1289 大鱼吃小鱼
- LeetCode: Rotate Array
- HDU 1233 还是畅通工程(Prim求最小生成树)
- 用这些专用工具让你截图更简单
- java中RowSet用法
- codeforces Gym 100187H H. Mysterious Photos 水题
- 什么是mimorGC什么是Full GC
- ACdream 1726 A Math game