天梯赛 L1-006 连续因子 (20 分)

直接暴力枚举即可

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

int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
    int start = 0, len = 0;
    int n; cin >> n;
    int half = sqrt(n) + 1;
    
    for (int i = 2; i <= half; i ++ )
    {
        int tmp = 1;
        for (int j = i; j <= n; j ++ )
        {
            tmp *= j;
            if (n % tmp != 0)
            {
                if (j - 1 - i + 1 > len)
                {
                    len = j - 1 - i + 1;
                    start = i;
                }
                break;
            }
        }
    }
    
    if (start == 0) cout << 1 << '\n' << n << '\n';
    else
    {
        cout << len << '\n';
        for (int i = start; i <= start + len - 1; i ++ )
        {
            cout << i;
            if (i != start + len - 1) cout << '*';
        }
    }
}