1096. Consecutive Factors
来源:互联网 发布:优惠券制作软件 编辑:程序博客网 时间:2024/06/10 22:54
1096. Consecutive Factors (20)
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:630Sample Output:
35*6*7
#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; }
- PAT 1096. Consecutive Factors
- 1096.Consecutive Factors
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- Problem C: 星球联盟(并查集+lca)
- [转]Uboot对Ext4文件系统的支持
- effective stl 第36条:理解copy_if的正确实现
- icpc大连栈
- python pil安装
- 1096. Consecutive Factors
- 排列组合问题初步
- NOIP历年搜索整理
- LeetCode 32. Longest Valid Parentheses(hard)
- 多态,抽象类,接口,UML图
- 为button添加href
- MySQL学习笔记
- Android 观察者模式
- 写wal log日志