L1-006 连续因子

#include <iostream>
#include <cmath>
using namespace std;

int n, m, temp;
int maxcount = 0, start = 0;

int main()
{
    cin >> n;
    m = sqrt(n);
    //只需存储start和maxcount 
    for (int i = 2; i <= m; ++i) {
        temp = n;
        int t = 0;
        int j = i;
        while (temp % j == 0) {
            temp /= j;
            ++j;
            ++t;
        }
        if (t > maxcount) {
            maxcount = t;
            start = i;
        }
    }
    if (maxcount) {
        cout << maxcount << endl;
        while (maxcount--) {
            if (maxcount == 0) cout << start;
            else cout << start << "*";
            ++start;
        }
    }
    else {
        cout << 1 << endl << n;
    }
    cout << endl;
    return 0;
}