HDU 1405 The Last Practice

The Last Practice

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9226 Accepted Submission(s): 1960


[align=left]Problem Description[/align]
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.

[align=left]Input[/align]
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.

[align=left]Output[/align]
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.

[align=left]Sample Input[/align]

60

12

-1

[align=left]Sample Output[/align]

Case 1.

2 2 3 1 5 1

Case 2.

2 2 3 1

Hint

60=2^2*3^1*5^1

[align=left]Author[/align]
lcy

[align=left]Source[/align]
杭电ACM集训队训练赛（IV）

解析：给定一个正整数，将它分解为素数的乘积。

#include <cstdio>

int main()
{
int n,cn = 0;
while(scanf("%d",&n), n>0){
if(cn != 0)
printf("\n");
printf("Case %d.\n",++cn);
for(int i = 2; i*i <= n; ++i){
int cnt = 0;
while(n%i == 0){
++cnt;
n /= i;
}
if(cnt != 0)
printf("%d %d ",i,cnt);
}
if(n>1)
printf("%d 1 ",n);
printf("\n");
}
return 0;
}