PAT (Advanced Level) Practise - 1096. Consecutive Factors (20)

http://www.patest.cn/contests/pat-a-practise/1096

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

此题是2015年春季的研究生入学考试复试时的机试题，链接 http://www.patest.cn/contests/graduate-entrance-exam-2015-03-20此题不难，但是很多人没拿到分数，因为没有想到最简单的方法：暴力遍历。针对一个已确定是Factor的数tempfactor，进行如下处理：
 while(num%tempfactor==0) templen++,num/=tempfactor,tempfactor++;  
 if(templen>maxlen) maxlen=templen,maxfactor=factors[i];

 #include<stdio.h>
 #include<math.h>

 int main()
 {
     int N=;
     scanf("%d",&N);
     if(N== || N== || N==)  {printf("1\n%d",N);return ;}

     int num=(int)sqrt(N),len=,factors[]={};
     for(int i=;i<=num;i++)  if(N%i==) factors[len]=i,len++;
     factors[len]=N,len++;

     int maxlen=,maxfactor=N;
     int templen=,tempfactor=;
     for(int i=;i<len;i++)
     {
             num=N,tempfactor=factors[i],templen=;
             while(num%tempfactor==) templen++,num/=tempfactor,tempfactor++;
             if(templen>maxlen) maxlen=templen,maxfactor=factors[i];
     }

     printf("%d\n",maxlen);
     for(int i=;i<maxlen;i++)
     {
             if(i)  printf("*%d",maxfactor);
             else  printf("%d",maxfactor);
             maxfactor++;
     }
     return ;
 }