1096. Consecutive Factors (20)

最新推荐文章于 2024-08-13 15:00:16 发布

我是QQ浩

最新推荐文章于 2024-08-13 15:00:16 发布

阅读量219

点赞数

CC 4.0 BY-SA版权

分类专栏：浙大PAT

本文链接：https://blog.youkuaiyun.com/accbbbxx/article/details/50720620

浙大PAT 专栏收录该内容

96 篇文章

订阅专栏

本文探讨如何找到给定正整数的最大连续因子序列，并列出序列中最小的连续因子。通过数学算法实现，适用于计算机科学领域的整数分解研究。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

#include<iostream>
#include<math.h>
using namespace std;
int main(){
    long long n;
    cin>>n;
    int max=0,maxi=0;
    long long s=long(sqrt(1.0*n));
    for(long long  i=2;i<=s;i++){
        long long t=n,j=i;
        int k=0;
        while(t%j==0){
            k++;
            if(k>max){ 
                max=k;
                maxi=i;
            }
            t/=j;
            j++;
        }
    }
    if(max==0){
        max=1;
        maxi=n;
    }
    printf("%d\n%d",max,maxi);
    for(int i=maxi+1;i<maxi+max;i++){
        printf("*%d",i);
    }

    return 0;
}