1096. Consecutive Factors
2016-09-29 19:00
295 查看
1096. Consecutive Factors (20)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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.
Input Specification:
Each input file contains one test case, which gives the integer N (1<N<231).
Output Specification:
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.
Sample Input:
630
Sample Output:
3 5*6*7
容易超时,从2到sqrt(num),找对应值作为累乘起点时连续因子的个数的最大值和对应的因子值,输出。
#include <iostream> #include <cmath> using namespace std; int main() { int num; cin>>num; int maxn=sqrt((double)num); int maxcnt=0; int maxstart=1; for(int i=2;i<=maxn;++i) { int tmp=num; int start=i; int cnt=0; while(tmp%start==0) { cnt++; tmp/=start; start++; } if(cnt>maxcnt) { maxcnt=cnt; maxstart=start; } } maxstart=maxstart-maxcnt; if(maxcnt==0) { maxcnt=1; maxstart=num; } cout<<maxcnt<<endl; cout<<maxstart; while(--maxcnt) cout<<"*"<<++maxstart; return 0; }
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C++联合体转换成C#结构的实现方法
- C++高级程序员成长之路
- C++编写简单的打靶游戏
- C++ 自定义控件的移植问题
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- 使用Lua来扩展C++程序的方法
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例
- C++的template模板中class与typename关键字的区别分析
- C与C++之间相互调用实例方法讲解