PAT 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.

输入描述:
Each input file contains one test case, which gives the integer N (131).

输出描述:
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.

输入例子:
630

输出例子:
3

5*6*7

一：题目意思

找出整数n的个数最大的但是数值最小的连续乘积因子（妈的真的很烦题目叽叽歪歪就是感觉说不清楚）

二：解题思路

1.循环到根号n，检查每个数有多少个连续乘积因子

2.找乘积因子的话就是如果i能被n整除就把i压入容器（我这里是vector<int>a）,然后检查i+1，如果是则压入，不是则退出循环

三：解题代码

#include<iostream>
#include<math.h>
#include<vector>
using namespace std;

int  maxSize=0;
int main()
{
	int n;
	//a是用来装每次连续的乘积因子的，c是用来装a的
	vector<vector<int> >c;
	vector<int> a;
	cin >> n;
	//循环到根号n
	for (int i=2; i < sqrt(n); i++)
	{
		//如果能被n整除
		while (n%i==0)
		{
			int k = i+1;
			int b = n;
			//这个是记录i+1能否被n整除，如果能整除就入a
			while (1)
			{
				a.push_back(i);
				b = b / i;
				i = i + 1;
				if (b%i!=0)break;
			}
			//判断a的大小决定是否将c中的a排除来，将新的a压入
			if (maxSize<(int)a.size())
			{
				maxSize = (int)a.size();
				if (!c.empty())
				{
					c.clear();
				}
				c.push_back(a);
			}
			a.clear();
			i = k;
		}

		
	}
	//输出
	if (!c.empty())
	{
		cout << maxSize << endl;
		for (int i = 0; i < c[0].size(); i++)
		{
			cout << c[0][i];
			if (i != (int)c[0].size() - 1)
			{
				cout << "*";
			}
			else
			{
				cout << endl;
			}
		}
	}
	else
	{
		cout << 1 << endl;
		cout << n << endl;
	}
	
	
	return 0;
}