1096 Consecutive Factors (20 分)
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<231).
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:
630
Sample Output:
3
5*6*7
思路分析
因式分解问题
注意分解的时候%的是前一次的乘积,而不是用输入值%前一项因子
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
typedef long long LL;
int main()
{
LL n;
scanf("%lld",&n);
LL sqr = (LL)sqrt(1.0*n);
LL begin = 0;
LL length = 0;
for(LL i=2;i<=sqr;i++)
{
LL temp =1,rear=i;
while(1)
{
temp*=rear;
if(n%temp!=0)break;
if(rear-i+1>length)
{
begin = i;
length = rear-i+1;
}
rear++;
}
}
if(length == 0)printf("1\n%lld",n);
else
{
printf("%lld\n",length);
for(LL i=0;i<length;i++)
{
printf("%lld",begin+i);
if(i<length-1)printf("*");
}
}
}