A1096. 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.

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:

630

Sample Output:

3
5*6*7

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<math.h>
 using namespace std;
 int main(){
     int N, sqr, maxLen = -, index;
     long long P;
     scanf("%d", &N);
     sqr = (int)sqrt(N * 1.0);
     for(int i = ; i <= sqr + ; i++){
         int j = i;
         P = ;
         while(){
             P *= j;
             if(P < )
                 break;
             if(N % P != )
                 break;
             if(j - i +  > maxLen){
                 maxLen = j - i + ;
                 index = i;
             }
             j++;
         }
     }
     if(maxLen != -){
         printf("%d\n", maxLen);
         printf("%d", index++);
     }else{
         printf("%d\n%d", , N);
     }
     for(int i = ; i < maxLen; i++){
         printf("*%d", index++);
     }
     cin >> N;
     return ;
 }

总结：

1、测试630的序列，应该是测试 630 / 3， 630 /（3 * 4）， 630 / （3 * 4 * 5），而非测试630 / 3，630 / 4， 630 / 5。

2、 考虑到无解的可能，比如素数13， index 与maxlen没有进入循环，应单独输出。

3、有可能sqrt(N)后有误差，应该判断到 sqrt(N + 1)而非 sqrt(N)。

4、只要有累乘，就应该用long long，并且考虑到溢出为负的可能。