HDU1405 The Last Practice

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

lx0208

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

阅读量240

点赞数 1

分类专栏： AC历程

本文链接：https://blog.csdn.net/lx0208/article/details/76640671

版权

AC历程专栏收录该内容

54 篇文章 0 订阅

订阅专栏

1405

The Last Practice

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

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

#include<stdio.h>
#include<vector>
using namespace std;
int isPrime(int n)
{
    int i;
    for (i = 2; i*i <= n; i++)
        if (n%i == 0)
            return false;
    return true;
}
int main()
{
    bool flag = false;
    vector<int>Prime;
    vector<int>::iterator Iter;
    int n, i, count,cns=1;
    for (i = 2; i <= 65536; i++)
    {
        if (isPrime(i))
            Prime.push_back(i);
    }
    while (scanf("%d", &n)&&(n>=0)) 
    {
        if(flag)printf("\n");
        flag = true;
        printf("Case %d.\n", cns++);
        for (Iter = Prime.begin(); Iter != Prime.end(); Iter++)
        {
            count = 0;
            while (n%(*Iter)==0)
            {
                count++;
                n /= *Iter;
            }
            if(count)
            printf("%d %d ", *Iter, count);
            if (n < 2)
            {
                printf("\n");
                break;
            }           
        }       
    }
    return 0;
}