1096 Consecutive Factors

#include"iostream"
#include"cmath"

int main() {
    long long  N;
    scanf("%lld",&N);
    long long t = (long long)sqrt(N*1.0),MAX = -1,start = -1;//记录连续序列的最大长度;
    for(long long i = 2; i <=t; ++i) {
        long long temp = 1;
        for(long long j = i; j<=t; ++j) {
            temp*=j;//获取当前连续整数的乘积
            if(N % temp == 0) {
                if(MAX < j-i+1) {
                    MAX = j-i+1;
                    start = i;
                }
            } else break;
        }
    }
    if(MAX == -1) printf("1\n%lld",N);//如果是素数，那么输出N本身
    else {
        printf("%lld\n",MAX);
        for(long long i = 0; i < MAX; ++i) {
            printf("%lld",start+i);
            if(i < MAX - 1)
                printf("*");
        }
    }
    return 0;
}