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]

Sample Input:

630

Sample Output:

3
5*6*7

題目大意：給出數N，找出其最長連續因子，因子要從小選起。

//哇好難，越做越難，，，

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

int main()
{
   int n;
   cin>>n;
   
 
int m=sqrt(n);
   int maxl=0,tp=0,bg=0;
   vector<int> vt;
   for(int i=2;i<=m;i++){
        int t=n;//這個i表示從哪個地方開始。
        if(n%i==0){
            tp++;
            t/=i;
            if(tp>maxl){
                maxl=tp;
                bg=i;//就是這個開始的時候。但是你得能整除才可以。哇這個好難。
            }
        }else{
            tp=0;
        }
   }
    cout<<maxl<<‘\n‘;
    for(int i=bg;i<maxl+tp;i++){
        cout<<i;
        if(i!=maxl+tp-1)
            cout<<"*";
    }
   return 0;
}

//寫不下去了，要考慮好多問題啊。

PAT 1096 Consecutive Factors[難]