1096. Consecutive Factors (20)

1096. Consecutive Factors (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3*5*6*7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, you are supposed to find the maximum number of consecutive factors, and list the smallest sequence of the consecutive factors.

Input Specification:

Each input file contains one test case, which gives the integer N (1<N<2³¹).

Output Specification:

For each test case, print in the first line the maximum number of consecutive factors. Then in the second line, print the smallest sequence of the consecutive factors in the format "factor[1]*factor[2]*...*factor[k]", where the factors are listed in increasing order, and 1 is NOT included.

Sample Input:

630

Sample Output:

3
5*6*7

【题解】：
题意很好理解的，就是求一个数的最长的连续质因子；
判断某个数是或否为这个数的质因子，在从这个数开始判断，是否满足为质因子，不满足就跳出来，找最长的就好了

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int m=sqrt((double)n);
	int maxCount=0;
	int first=n;
	for(int i=2;i<=m;i++)
    {
		int start=i;
		int tmp=n;
		while(tmp%start==0)
        {
			tmp=tmp/start;
			start++;
		}
		if(start-i>maxCount){
			maxCount=start-i;
			first=i;
		}
	}
	if(maxCount==0)
    {
		cout<<1<<endl;
		cout<<n;
		return 0;
	}
	cout<<maxCount<<endl;
	cout<<first;
	for(int i=1;i<maxCount;i++)
		cout<<"*"<<first+i;
	return 0;
}


 

---

提交代码