PAT甲级 1096 Consecutive Factors （20 分）

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

题目大意: 输入一个数，要求输出最大连续因素乘积。若有相同长度的，则输入最小序号的。

注意: 题目并不是要求 最大连续因素乘积 与 输入数相等，只要是连续最长的因数即可。

#include <iostream>
#include <cmath>
#include <cstdio> 
using namespace std;
long int num, temp;

int main(){
    cin >> num;
    int cnt = 0;
    int maxlen = 0,start = 0;
    for(int i=2;i<=sqrt(num);i++){
    	if(num%i == 0){
    		int a = num,b = i;
    		int n = 0;
    		while(a%b == 0){
    			a /= b;
    			b++;
    			n++;
    		}
    		if(maxlen < n){
    			maxlen = n;
    			start = i;
    		}
    	}
    } 
    if(maxlen == 0){
    	printf("1\n");
    	printf("%d",num); 
    }else{
    	printf("%d\n",maxlen);
    	for(int i=0;i<maxlen;i++){
    		printf("%d%s",start+i,i!=maxlen-1?"*":""); 
    	}
    }
    
    return 0;
}