连续因子

来源：互联网发布：最新网络电话软件下载编辑：程序博客网时间：2024/04/30 14:41

#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#define INF 0x3f3f3f3fusing namespace std;typedef long long ll;int main(){    ll n;    scanf("%lld",&n);    ll l,r;    ll sum;    ll len=0;    ll flag=0;    ll up=sqrt(n);//****    for(ll i=2;i<=up;i++)    {        sum=1;        for(ll j=0;j<13;j++)        {            sum*=(i+j);            if(sum>n)            {                flag=1;                break;            }            if(n%sum!=0)                break;            if(j+1>len)            {                len=j+1;                l=i;                r=i+j;            }        }        if(flag) break;    }    if(len==0) printf("1\n%lld\n",n);    else    {        printf("%lld\n%lld",len,l);        for(int i=l+1;i<=r;i++)            printf("*%lld",i);        puts("");    }}

0 0