【Enumeration】Continuous factor

连续因子

#include <math.h>
#include <stdio.h>
// Common methods for determining whether a number is prime or not
int is_prime(int n) {
    
    if (n <= 1) return 0;
    for (int i = 2; i <= sqrt(n); i++) {
    
        if (n % i == 0) return 0;
    }
    return 1;
}
int main() {
    
    int i = 0, j = 0, n = 0, s = 0, maxs = 0, maxl = 0;
    scanf("%d", &n);
    if (is_prime(n)) {
    
        //若为素数则不符合题意,直接处理
        printf("1\n");
        printf("%d\n", n);
        return 0;
    }
    int tmp = sqrt(n) + 1;
    for (i = 2; i <= tmp; i++) {
    
        if (n % i == 0) {
    
            s = i;
            for (j = i + 1; j <= tmp; j++) {
    
                s *= j;
                if (n % s != 0) break;
            }  //判断因子是否连续 ,若不连续则寻找下一个
            if (maxs < j - i)  //判断j-i>0,说明有连续
            {
    
                maxs = j - i;  //给maxs赋值,继续循环找出最长的
                maxl = i;
            }
        }
    }

    // 输出结果
    printf("%d\n", maxs);
    for (i = maxl; i <= maxs + maxl - 1; i++) {
    
        if (i != maxl) printf("*");
        printf("%d", i);
    }
    return 0;
}