HDU The Last Practice
来源:互联网 发布:java定义一个圆类 圆心 编辑:程序博客网 时间:2024/06/15 21:39
The Last Practice
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 36 Accepted Submission(s) : 8
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem 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.
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(1<n<65536), one per line. a negative terminates the input, and it should not to be processed.
Output
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 1Case 2.2 2 3 1<div style='font-family:Times New Roman;font-size:14px;background-color:F4FBFF;border:#B7CBFF 1px dashed;padding:6px'><div style='font-family:Arial;font-weight:bold;color:#7CA9ED;border-bottom:#B7CBFF 1px dashed'><i>Hint</i></div>60=2^2*3^1*5^1</div>
Author
Source
杭电ACM集训队训练赛(IV)
AC代码:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ int t,a[65536],i,n,s=0; cin>>n; while(n>0) { memset(a,0,65536*sizeof(int)); t=n; for(i=2; i<=t; i++) { if(t%i==0) { a[i]++; t/=i; i--; } if(t==1) break; } s++; cout<<"Case "<<s<<"."<<endl; for(i=2; i<=n; i++) { if(a[i]!=0) cout<<i<<" "<<a[i]<<" "; } cout<<endl; cin>>n; if(n>0) { cout<<endl; } }return 0;}
学习心得:
此题坑在最后一组输出无换行~
0 0
- HDU The Last Practice
- hdu 1405 The Last Practice
- The Last Practice hdu 1405
- HDU 1405 The Last Practice
- HDU 1405The Last Practice
- HDU 1405 The Last Practice
- HDU 1405 The Last Practice
- hdu 1405 The Last Practice (数学)
- hdu-oj 1405 The Last Practice
- HDU The Last Practice
- HDU 1405 The Last Practice(暴力枚举)
- HDU1405:The Last Practice
- hdu_1405 The Last Practice
- HDU1405 The Last Practice
- hdu1405 The Last Practice
- hdu1405 The Last Practice
- The Last Practice
- The Last Practice
- 如何理解貌似陌生的文件系统
- Objective-C 代码规范(Code Style)(二)
- Linux命令之<grep命令>
- CSUOJ1630--Plane Ticket Pricing
- spring定时任务
- HDU The Last Practice
- Android SDK目录结构及作用
- 网站常用数据库
- Java NIO系列教程(十二) Java NIO与IO
- Javascript作用域和变量提升
- 新浪微博API错误代码说明对照表
- UV分解
- Git 命令
- python中的闭包