PAT甲级1096 Consecutive Factors//质因子分解

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
567

题目大意

求一段连续的正数，能让输入的n被这段连续整数的乘积整除。注意you are supposed to find the maximum number of consecutive factors, and list the smallest sequence of the consecutive factors.如果有多个方案，输出连续整数个数最多的那个方案；如果还有多个方案，输出第一个数最小的方案。

思路

其实只要在2~√n之间找这串连续的数就行了，因为大于√n的连续整数相乘肯定大于n。然后同时记录这串数字的长度和开头数字即可。遇到长度更长的就更改两个变量。注意如果题目给的是一个质数，最后要输出1和这个数本身。

#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
	long long n;
	cin >> n;
	long long ans_start = 0, ans_len = 0;
	for (long long i = 2; i * i <= n; i++)
	{
		long long j = i, ans = 1;
		while (1)
		{
			ans *= j;
			if (n % ans != 0)
				break;
			if (j - i + 1 > ans_len)
			{
				ans_start = i;
				ans_len = j - i + 1;
			}
			j++;
		}
	}
	if (ans_len == 0)
	{
		cout << 1 << endl;
		cout << n << endl;
	}
	else
	{
		cout << ans_len << endl;
		for (long long i = 0; i < ans_len; i++)
		{
			if (i > 0)
				cout << "*";
			cout << ans_start;
			ans_start++;
		}
	}
	system("pause");
	return 0;
}