1096 Consecutive Factors (20 分)

质因分解

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

int main(){
	int n,ansI=-1,ansLen=0;
	cin >> n;
	int sqr=(int)sqrt(1.0*n);
	for(int i=2;i<=sqr;i++){
		int temp=1;
		for(int j=i;j<=sqr;j++){
			temp*=j;
			if(n%temp!=0) break;
			if(ansLen<j-i+1){
				ansLen=j-i+1;
				ansI=i;
			}
		}
	}
	if(ansLen==0) printf("1\n%d",n);
	else{
		int count;
		printf("%d\n",ansLen);
		for(int count=0;count<ansLen;count++){
			if(count>0) cout << "*";
			cout << ansI++;
		}
		
	}
	return 0;
}