PATL1-006 连续因子

这道题复杂度够直接暴力就好了

AC代码：

/* ***********************************************
Author        :yzkAccepted
Created Time  :2016/7/10 15:00:29
TASK      :ggfly.cpp
LANG          :C++
************************************************ */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    long long n;
  cin>>n;
  long long i,j,k,ans,cnt;
  ans=0;k=0;
  for(i=2;i*i<=n;i++)
  {
    cnt=1;
    for(j=i;cnt*j<=n;j++)
    {
      cnt=cnt*j;
      if(n%cnt==0)
      {
        if(ans<j-i+1)
        {
          k=i;
          ans=j-i+1;
        }

      }
    }
  }
  if(k==0)
  {
    ans=1;
    k=n;
  }
  cout<<ans<<endl;
  cout<<k;
  for(i=k+1;i<ans+k;i++)
    printf("*%d",i);
  printf("\n");
    return 0;
}