PAT(甲级)渡劫(七)-Consecutive Factors
代码如下:
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int t = sqrt((double)n);
int s,maxlen = 0;
for(int i = 2 ; i <= t ; i++){
int m = n;
int curlen = 0;
int k = i;
while(m%k == 0){
++curlen;
m/=k;
k++;
}
if(curlen > maxlen){
maxlen = curlen;
s = i;
}
}
if(!maxlen){
printf("1\n%d",n);
return 0;
}
printf("%d\n%d",maxlen,s);
while(--maxlen){
printf("*%d",++s);
}
return 0;
}