【 PAT 1007 Consecutive Factors (20)】

最新推荐文章于 2022-04-15 16:39:29 发布

楚江枫

最新推荐文章于 2022-04-15 16:39:29 发布

阅读量328

点赞数

本文链接：https://blog.csdn.net/WYK1823376647/article/details/77961383

版权

该博客介绍了PAT 1007题目的解决方案，内容包括问题描述、输入输出格式以及暴力求解的方法。博主分享了如何找到正整数N的最大连续因子个数，并给出最小连续因子序列的思路和AC代码。

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

题目描述
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.

输入描述:
Each input file contains one test case, which gives the integer N (131).

输出描述:
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.

输入例子:
630

输出例子:
3
5*6*7

题意：找到最长的的连续数序列相乘可以整除n的序列，并输出最小的序列

思路：暴力 ~ QAQ

AC代码：