PAT1096

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
#include
#include
#include
using namespace std;

int main(){
	int n;
	cin>>n;
	vectora(1,n), replace;
	for(int i=2;i<=sqrt(n);i++){
		int m=n;
		if(m%i==0){
			replace.clear();
		for(int j=i;j<=m;j++){
			if(m%j==0){
				replace.push_back(j);
				m/=j;
			}
			else break;
		}

		if(a.size()replace[0])){
			a=replace;
		}
	}
	}
	cout<