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

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

题目大意：

题目要求找出一个正整数的最长最小连乘子列，注意到长度的优先级大于数字的大小，例如对于题目给出的630，能找到的最小子列是5*6*7，而对于633，能找到的则是3（另一个是211，3<211且长度均为1，故选择3）。

思路：

很简单的暴力算法，只有一点需要注意的地方，就是一个一个正整数n不可能被比根号n大的数整除，所以循环可以缩短为2~sqrt(n)

代码：

#include<iostream>
#include<cmath>
using namespace std;
int main() {
    int n,i,j,ans,max=0;
    scanf("%d",&n);
    int t = sqrt(n);
    for(i=2;i<=t;i++) {
        int count = 0;
        int s = i;
        int temp = n;
        while(temp%s == 0) {
            count++;
            temp = temp/s;
            s++;
        }
        if(count>max) {
            max = count;
            ans = i;
        }
    }
    if(max == 0) {
        printf("1\n%d",n);
        return 0;
    } 
    printf("%d\n%d",max,ans);
    for(i=1;i<max;i++) {
        printf("*%d",ans+i);
    }
    return 0;
}