Consecutive Factors

题目描述

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.

 

输入描述:

Each input file contains one test case, which gives the integer N (131).

 

输出描述:

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.

 

输入例子:

630

 

输出例子:

3
5*6*7

题意是让求出n的连续因子，刚开始毫无思路，以为要分解质因数什么的，后来看了大佬的代码，大概是有了思路。

思路：通过嵌套循环，从2开始乘，2*3*...直到乘积不能被n整数，然后从3开始乘，直到sqrt(n)，可用擂台比较法求出最大长度，然后输出。

#include<iostream>
#include<cmath>

using namespace std;

int main(void)
{
    int n;
    cin>>n;
    int len=0;
    int a[2]={0};
    for(int i=2;i<sqrt(n);i++)
    {
        int temp =1;
        int j;
        for(j=i;;j++)
        {
            temp*=j;
            if(n%temp!=0)
                break;
        }
        if(len<j-i)
        {
            len=j-i;
            a[0]=i;
            a[1]=j;
        }
    }
    if(len==0)
        cout<<"1"<<endl<<n;
    else
        cout<<len<<endl;
    for(int i=a[0];i<a[1];i++)
    {
        if(i!=a[1]-1)
            cout<<i<<"*";
        else
            cout<<i;
    }
    return 0;
}