PAT 1096. Consecutive Factors (20)

最新推荐文章于 2020-07-26 21:07:28 发布

yxpandjay

最新推荐文章于 2020-07-26 21:07:28 发布

阅读量153

点赞数

分类专栏： PAT A

本文链接：https://blog.csdn.net/yxpandjay/article/details/77910298

版权

PAT A 专栏收录该内容

72 篇文章 0 订阅

订阅专栏

1096. Consecutive Factors (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3*5*6*7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, you are supposed to find the maximum number of consecutive factors, and list the smallest sequence of the consecutive factors.

Input Specification:

Each input file contains one test case, which gives the integer N (1<N<2³¹).

Output Specification:

For each test case, print in the first line the maximum number of consecutive factors. Then in the second line, print the smallest sequence of the consecutive factors in the format "factor[1]*factor[2]*...*factor[k]", where the factors are listed in increasing order, and 1 is NOT included.

Sample Input:

Sample Output:

3
5*6*7

最笨的办法。一开始以为会超时，并没有。注意对质数特殊处理下，即当p2==0时特殊处理。

#include <iostream>
#include<stdio.h>
#include<string>
#include<queue>
#include<algorithm>
#include<string.h>
#include<vector>
#include<map>
#include<math.h>
using namespace std;

int main()
{
    int x;
    cin>>x;
    int maxx=-1;
    int path[1000];
    int lpath[1000];
    int p1=0;
    int p2=0;
    if(x==2) {cout<<1<<endl<<2;return 0;}
    if(x==3) {cout<<1<<endl<<3;return 0;}
    for(int i=2;i<=sqrt(x);i++)
    {
        if(x%i==0)
        {
             int tmp=x;
             int p1=0;
            for(int j=i;j<=sqrt(x)&&tmp%j==0;j++)
            {

                  path[p1++]=j;
                  tmp/=j;
            }
            if(p1>p2)
            {
                for(int i=0;i<p1;i++)
                  lpath[i]=path[i];
                p2=p1;
            }
        }


    }
     if(p2==0) cout<<1<<endl<<x;
     else {
      cout<<p2<<endl<<lpath[0];
      for(int i=1;i<p2;i++)
        cout<<'*'<<lpath[i];
     }

    return 0;
}