A1096 Consecutive Factors (20分)【C语言】
分解因子,找出能够整除的最长连续数字相乘,采用实时更新的方法
题目描述:
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 (1<N<2 31 ).
输出格式:
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
567
实现代码:
#include <cstdio>
#include