1096 Consecutive Factors (20 分)

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+100;

int main()
{
    ll n;
    scanf("%lld",&n);
    ll ansi=0;
    ll anslen=0;
    for(ll i=2;i*i<=n;i++)
    {
        ll temp=1,j=i;

        while(1)
        {
            temp*=j;
            if(n%temp!=0) break;
            if(j-i+1>anslen)
            {
                ansi=i;
                anslen=j-i+1;
            }
            j++;
        }
    }
    if(anslen==0)
    {
        printf("1\n%lld",n);
    }
    else
    {
        printf("%lld\n",anslen);
        for(ll i=0;i<anslen;i++)
        {
            printf("%lld",ansi+i);
            if(i!=anslen-1) printf("*");
        }
    }
}

标签：1096,20,temp,ll,anslen,ansi,printf,Consecutive,lld
来源： https://blog.csdn.net/b_o_n_z_t_f/article/details/120944114