HDU The Last Practice

最新推荐文章于 2020-03-31 20:30:01 发布

遥遥未可期

最新推荐文章于 2020-03-31 20:30:01 发布

阅读量383

点赞数

分类专栏：杭电OJ

本文链接：https://blog.csdn.net/aliujiaqi/article/details/45972645

版权

杭电OJ 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

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.

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
<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

lcy

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;
}

学习心得：

此题坑在最后一组输出无换行~