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^31^).
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
思路:
给一个正整数N,求一段连续的整数,使得N能被这段连续整数整除。如果有多个方案,输出连续数最多的方案,如果还有多个方案,输出qizh其中第一个数最小的方案
N不会比大于根号N的数整除
C++:
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int main(){
ll n;
scanf("%lld",&n);
ll sqr=(ll)sqrt(1.0*n),ansI=0,ansLen=0;
for(ll i=2;i<=sqr;i++){
ll temp=1,j=i;
while(1){
temp*=j;
if(n%temp!=0)break;
if(j-i+1>ansLen){
ansI=i;
ansLen=j-i+1;
}
j++;
}
}
if(ansLen==0){
printf("1\n%lld",n);
}else{
printf("%lld\n",ansLen);
for(ll i=0;i<ansLen;i++){
printf("%lld",ansI+i);
if(i<ansLen-1){
printf("*");
}
}
}
return 0;
}