HDU 1164 Eddy's research I
来源:互联网 发布:怎么申请不了淘宝直播 编辑:程序博客网 时间:2024/06/06 01:17
链接 : http://acm.hdu.edu.cn/showproblem.php?pid=1164
题意 : 将任意一个数拆成多个素数相乘的形式(素数可重复)
水题,本来想素数表,发现有点脱裤子放屁的意味= =
#include <iostream>using namespace std;int main(){ int n,a[21]; while(cin>>n) { int i=2,k=0; while(i<=n) { if(!(n%i)) { a[k++]=i; n/=i; } else i++; } cout<<a[0]; for(i=1; i<k; i++) cout<<"*"<<a[i]; cout<<endl; } return 0;}
0 0
- 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 1164 Eddy's research I
- HDU 1164 Eddy's research I
- POJ-1797Heavy Transportation,最短路变形,用dijkstra稍加修改就可以了;
- Python正则表达式指南
- 斐波那契数列的非递归c语言实现以及斐波那契数列的应用
- 在Express中使用模板引擎
- 动态规划10010
- HDU 1164 Eddy's research I
- 多线程安全计数器
- REACT学习笔记
- E: Some index files failed to download. They have been ignored, or old ones used instead.
- 杭电oj~~2005
- Problem A: 求倒数和【简单循环】
- leetcode--001. Two Sum
- WCF 找不到类型 WcfService
- 利用静态数码管实现从9到0 再从0到9