首页 > 试题广场 >

Consecutive Factors (20)

[编程题]Consecutive Factors (20)
  • 热度指数:8626 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 64M,其他语言128M
  • 算法知识视频讲解
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.
示例1

输入

630

输出

3
5*6*7

这道题你会答吗?花几分钟告诉大家答案吧!