HDU 1405 The Last Practice
2015-08-22 12:39
387 查看
Description
Tomorrow is contest day, Are you all ready?We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no chance to attend the Province-Final.
Now, your task is relaxing yourself and making the last practice. I guess that at least there are 2 problems which are easier than this problem.
what does this problem describe?
Give you a positive integer, please split it to some prime numbers, and you can got it through sample input and sample output.
Input
Input file contains multiple test case, each case consists of a positive integer n(1Output
For each test case you should output its factor as sample output (prime factor must come forth ascending ), there is a blank line between outputs.Sample Input
6012
-1
Sample Output
Case 1.2 2 3 1 5 1
Case 2.
2 2 3 1
Hint
60=2^2*3^1*5^1题意:
将给定的数据进行质因子分解,输出格式有坑,每个案例输出后面有空格,最后一个案例没有空行
代码实现
#include<iostream> using namespace std; #define MAXN 100 int main() { int n,t=1,test=0; while(scanf("%d",&n)&&n>0) { if(test) printf("\n"); int ans1[MAXN]={0}; int ans2[MAXN]={0}; int cnout=0; for(int i=2;i<=n;i++) { if(n%i==0) { ans1[cnout]=i; while(n%i==0) { ans2[cnout]++; n/=i; } cnout++; } } int j; printf("Case %d.\n",t++); for(j=0;j<cnout;j++) printf("%d %d ",ans1[j],ans2[j]); printf("\n"); test=true; } return 0; }
相关文章推荐
- 2015 Top10 最成功的网页设计趋势(业界主流设计思想)
- Asp.Net 一个请求的处理流程
- 在Windows8.1下配置Hadoop2.7.0的源代码阅读环境
- iOS中多线程知识总结:进程、线程、GCD、串行队列、并行队列、全局队列、主线程队列、同步任务、异步任务等
- iOS中多线程知识总结:进程、线程、GCD、串行队列、并行队列、全局队列、主线程队列、同步任务、异步任务等
- C#文件断点续传实现方法
- 动画的方法
- hdu 2669 Romantic 扩展欧几里德
- 网上购物六注意事项,你知道几个?
- PowerDesigner实体模型CDM中关于建立Entity之间关系的备忘
- Shell编程之Shell变量学习总结
- 读书笔记之计算机系统(6)
- Objective-C 里的 Alloc 和 AllocWithZone的区别
- Wow! Such Doge! - HDU 4847 (水题)
- Js apply()使用详解
- hdu 4548(美素数)
- [Unity]背包效果-使用NGUI实现物品的拖拽效果Drag
- python文件读写模式解析
- Ubuntu备份还原
- Buff系统设计