[PAT]1096. Consecutive Factors (20)

#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
using namespace std;
  

vector<int> finalfactors;

long long jiecheng[14];

long long jc(long long k,long long n)
{
	 

	long long rt=1;
	for(int i=0;i<n;i++)
		rt =rt*(k+i);

	return rt;
}

 



int main(void)
{

	 

	 int length =0;
	 int start,end;
	 int minstart,minend;
	 long long N;
	 cin>>N;
 
	 
 
	 for(long long i=2;i<=(int)sqrt((double)N)+2;i++)//判断是否为质数，否则超时
	 {
		 long long jcvalue =1;

		 for(long long j=1;j<=N-i+1;j++)
		 {  
			 jcvalue = jcvalue *(i+j-1);

			 

			 if(jcvalue>N)
				 break;

			 if(N%jcvalue ==0)
			 {
				 start = i;
				 end = i+j-1;

				 if(length <j)
				 {
					 length = j;
					 minstart = start;
					 minend = end;
				 }
			 }
			// else break;

		 }
	 }

	 
	 if(length ==0)
	 {
		  cout<<1<<endl;
		   cout<<N<<endl;

		   	system("pause");
		   return 0;
	 }
 
	 cout<<length<<endl;
	

	 for(int k=minstart;k<minend;k++)
		 cout<<k<<"*";
	 cout<<minend<<endl;


	return 0;
}