欧美1区2区3区激情无套,两个女人互添下身视频在线观看,久久av无码精品人妻系列,久久精品噜噜噜成人,末发育娇小性色xxxx

首頁 > 試題廣場 >

Consecutive Factors (20)

[編程題]Consecutive Factors (20)
  • 熱度指數(shù)：8617 時間限制：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
算法知識視頻講解

這道題你會答嗎？花幾分鐘告訴大家答案吧！