PAT 1096 Consecutive Factors (20)

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^31^).

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.

解答：我的思路是这样的，从数字2开始遍历，然后记录最长数字串，一直遍历到N为止。但不幸的是，有一个用例超时，可能是N太大而且是质数的原因，所以我另外对N进行素数判定，顺利AC。

AC代码如下:

#include<cstdio>
#include<cmath>
#include<iostream>

using namespace std;

bool isPrime(int num)
{
	int border = sqrt(num);
	int i = 2;
	for(; i <= border; ++i)
	{
		if(num % i == 0) 
			break;
	}
	
	if(i > border) return true;
	else return false;
}
int main()
{
	int N;
	int start, maxlen = 0;
	
	scanf("%d", &N);
	if(isPrime(N))
	{
		printf("1\n%d\n", N); return 0;
	}
	else
	{
		for(int i = 2; i <= N; ++i)
		{
			int len = 0, val = N;
			for(int j = i; j <= N; ++j)
			{
				if(val % j == 0)
				{
					val /= j;
					len++;
				}
				else break;
			}
			if(len > maxlen)
			{
				start = i; maxlen = len;
			}
		}
	}
	int first = 1;
	printf("%d\n", maxlen);
	for(int i = 0; i < maxlen; ++i)
	{
		if(first){
			printf("%d", start+i); first = 0;	
		}
		else{
			printf("*%d", start+i);
		}
	}
	return 0;
}