1096. Consecutive Factors
来源:互联网 发布:mac全选照片 编辑:程序博客网 时间:2024/05/16 18:23
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<stdio.h>#include<vector>#include<math.h>using namespace std;int main(){int n = 0;scanf("%d", &n);vector<int> v;if(n == 2 || n == 3 || n == 5){printf("1\n%d", n);return 0;}//case6:超时在于计算整除的时候,判断条件,如果是i*i<=n,这样会超时的 int num = (int)sqrt(n);for(int i = 2; i <= num; i ++)if(n % i == 0)v.push_back(i);v.push_back(n);int maxLen = 0, maxFactor = n;int tmpLen = 0, tmpFactor = 0;for(int i = 0; i < v.size(); i ++){num = n;tmpFactor = v[i];tmpLen = 0;while(num%tmpFactor == 0){tmpLen ++;num /= tmpFactor;tmpFactor ++;}if(tmpLen > maxLen){maxLen = tmpLen;maxFactor = v[i];}}printf("%d\n", maxLen);for(int i = 0; i < maxLen; i ++){if(i)printf("*%d", maxFactor);elseprintf("%d", maxFactor);maxFactor++;} printf("\n");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)
- Passing cookie to webview
- 关于googlge浏览器升级到46+版本之后NPAPI 的插件不能用
- linux 解压 war 包
- java获取服务器CPU,内存,硬盘使用量
- 看到一篇文章刷CSDN博客访问量,目前没有环境实现,抽空可以去跑跑看或者改为其他方式实现
- 1096. Consecutive Factors
- HDU 2161 数学
- Hibernate主键生成策略
- javascript 回调函数(闭包)
- 堆排序
- [leetcode][C++]Find Median from Data Stream
- LayoutInflater
- 用XRDP方式远程桌面连接CentOS6(centos7好像不能直接按以下操作)
- 解决no cpu/abi system image available for this target的问题