首页 > 试题广场 >

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
算法知识视频讲解
开通博客
头像 懒散之魂
发表于 2021-09-17 19:46:51
更多PAT题解尽在我的个人博客---我的个人bok 题目 OJ平台 题目翻译 题目描述 原文Among all the factors of a positive integer N, there may exist several consecutive numbers. For examp 展开全文
去ta的博客 赞 (0) 回复(0) 收起

问题信息

高级算法
难度：
35条回答 13487浏览

热门推荐

通过挑战的用户

相关试题

Consecutive Factors (20)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号