【PAT甲级、C++、因数】1096 Consecutive Factors (20分)

模拟一下

i = 2

630/2 = 315

315/3 = 105

105/4 = 26.25 不能被整除，进入下一次for循环

更新maxseq = [2, 3]

i = 3

630/3 = 105;

105/4 = 26.25 不能被整除，进入下一次for循环

maxseq不更新为当前序列[2]

i = 4

630/4= 157.5 不能被整除，进入下一次for循环

maxseq不更新为当前序列[ ]

i = 5

630/5 = 126;

126/6 = 21

21 / 7 = 3

3 / 8 = 0 不能被整除，进入下一次for循环

更新maxseq = [5 ,6, 7]

i = 6

630/6 = 105;

…………

# include <iostream>
# include <vector>
# include <cmath>

using namespace std;

typedef long long LL;

vector<LL> factors;  // 存放当前的连续因子
vector<LL> maxseq;   // 存放最短的连续因子

int main()
{
    LL N;
    cin >> N;

    LL sq = (LL)sqrt(1.0 * N); // 因为sqrt的参数时double型，int可隐式转换为double而long long不能，所以要乘1.0
    for (LL i = 2; i <= sq; ++i) {
        LL j = i;
        LL n = N;
        factors.clear();
        // 求从i开始的连续序列的部分
        while (1) {
            if (n % j == 0) {
                factors.push_back(j);
                n /= j;
            }
            else break;  // 关键
            j++; // 连续序列的下一个数
        }
        
        // 更新最长序列的部分
        // 如果当前数的连续因子长度不为0且大于最长序列，当长度相等时要选择序列中第一个数最小的数
        if (factors.size() != 0) {  // 当前数的连续因子序列长度不为0
            if(maxseq.size() == 0)  // 最大序列长度为0
                maxseq = factors;
            else
            if(factors.size() > maxseq.size())  // 当前数的连续因子序列长度大于最长序列
                maxseq = factors;
            else
            if(factors.size() == maxseq.size()) // 当前数的连续因子序列长度等于最长序列，选择首元素最小的那个成为序列最大连续序列
                if(factors.front() < maxseq.front())
                maxseq = factors;
        }
        
        /* 更新部分可以写的这么短，但又有什么用呢~~~
        	if (factors.size() != 0 && (maxseq.size() == 0 || (factors.size() > maxseq.size() || factors.front() < maxseq.front())))
                maxseq = factors;
        */
    }

	// 输出
    if(maxseq.size() == 0){  // maxseq.size() == 0说明是n的根号小于n（例如根号2），这时就需要输出其自身
        cout << 1 << endl;
        cout << N;
    }
    else{
        cout << maxseq.size() << endl;
        for(size_t i=0;i<maxseq.size();++i){
            cout << maxseq[i];
            if(i != maxseq.size() - 1)
                cout << "*";
        }
    }

    return 0;
}