PAT 1096. Consecutive Factors (20)(最大连续乘积因子)(sqrt(n)判断一个数是否为质数的深刻理解)

官网

题目

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

解题思路

• 1.题目是要找最大连续乘积因子，可以联想到判断一个数是否为质数的例子，一般的，连续乘积 因子的初始位置最多到达sqrt(n),因为sqrt(n)*sqrt(n)=n了，再多来几个连续的乘积因子肯定也不合适了。
• 2.注意输入为4，为7这种例子等等。

AC代码

#include<iostream>
#include<math.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    double sqr = sqrt((double)n);
    int first = n, len = 0, maxlen = 1;
    for (int i = 2; i <= sqr; i++)
    {
        //tem记录初始位置
        int tem = i;
        int tem_n = n;
        //len记录最新的长度
        len = 0;
        while (tem_n%tem==0)
        {
            tem_n = tem_n / tem;
            tem++;
            len++;
        }
        //长度比原来的长了，或者如果等于初始长，但是初始位置的数值比较小（初始长为1，大小为n本身）
        //注意输入为4 这种情况，输出最小的应该是2吧
        if (len>maxlen||(len==maxlen&&i<first))
        {
            first = i;
            maxlen = len;
        }
    }
    cout << maxlen << endl;
    cout << first;
    while (maxlen>1)
    {
        cout << "*" << ++first;
        maxlen--;
    }
    cout << endl;
    return 0;
}