【团体天梯赛/PTA】7-51 Consecutive Factors (20 分)

最新推荐文章于 2021-04-28 19:20:58 发布

笙箫夜弥

最新推荐文章于 2021-04-28 19:20:58 发布

阅读量338

点赞数

分类专栏：团体天梯赛文章标签： C++ 团体天梯赛

本文链接：https://blog.csdn.net/weixin_43460427/article/details/103092782

版权

该博客介绍了如何使用C++解决一道名为'Consecutive Factors'的团体天梯赛编程题目。题目要求找出一个整数N的最大连续因子数及其序列。当N为素数时，输出N本身；否则，从2开始遍历到sqrt(N)，找出连续因子序列。样例输入630，输出3，因子序列5*6*7。

摘要由CSDN通过智能技术生成

【团体天梯赛】7-51 Consecutive Factors (20 分)

【团体天梯赛】7-51 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], where the factors are listed in increasing order, and 1 is NOT included.