hdu 1405（水题，格式，分解质因子）

最新推荐文章于 2020-05-03 19:42:23 发布

starlet_kiss

最新推荐文章于 2020-05-03 19:42:23 发布

阅读量245

点赞数

本文链接：https://blog.csdn.net/starlet_kiss/article/details/82862403

版权

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.
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
60
12
-1
Sample Output
Case 1.
2 2 3 1 5 1
Case 2.
2 2 3 1
Hint
60=2^2*31*5^1
说句实话，这个题没啥技术含量，不过我在这里弄了好半天，一开始是循环结束的条件没有判断好，然后就一直循环，呜呜呜。弄好了就提交，一直显示格式错误，fuck。这个题的本意绝对不是分解质因子，就是想搞一搞我们，yyy。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;

int n;

int main()
{
	int k=0;
	while(cin>>n,n>1)
	{
		int x=n;
		if(k) cout<<endl;
		printf("Case %d.\n",++k);
		int t=2;
		int count=0;
		while(x)
		{
			if(x%t==0)
			{
				x/=t;
				count++;
			}
			else
			{
				if(count) 
				cout<<t<<" "<<count<<" ";
				if(x==1) break;
				t++;
				count=0;
			}
		}
		cout<<endl;
	}
}

努力加油a题啊，ヾ(◍°∇°◍)ﾉﾞ