【题意】
找出一个给定数字分解因数的所有可能中连续因数最长的串
【思路】
暴力找每一个数字为起始的因数串即可
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int maxCnt = 1, first = n;
for (int i = 2; i <= sqrt(n) + 0.5; ++i){
int cnt = 0, remain = n, j;
for (j = i; remain % j == 0; remain /= j, ++j);
if (j - i > maxCnt || (j - i == maxCnt && i < first)){
maxCnt = j - i;
first = i;
}
}
cout << maxCnt << endl;
cout << first;
for (int i = 1; i < maxCnt; ++i){
cout << '*' << first + i;
}
system("pause");
return 0;
}