A. Consecutive Factors
来源:互联网 发布:mox反应堆 知乎 编辑:程序博客网 时间:2024/04/30 06:42
A. 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<cstdio>int main(){int N, i , j, max_no, temp, left;scanf("%d", &N);for(i = 2, max_no = 0; i <= N; i ++){temp = N;for(j = i; j <= N; j ++){if(temp % j != 0){break;}else{temp = temp / j;}}if(max_no < j - i) {max_no = j - i;left = i;}}printf("%d\n", max_no);for(i = 0; i < max_no; i ++){printf("%d", left ++);if(i != max_no - 1) {printf("*");}}return 0;}
- A. Consecutive Factors
- PAT A 1096. Consecutive Factors (20)
- PAT(A) - 1096. Consecutive Factors (20)
- PAT-A 1096. Consecutive Factors (20)
- PAT-A-1096. Consecutive Factors (20)
- PAT A 1096. Consecutive Factors (20)
- 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)
- pat 1096 Consecutive Factors
- 1096. Consecutive Factors
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- 1096. Consecutive Factors (20)
- hdoj 1071 The area
- 一个配置比较全的log4j.xml文件,配置的正确性已在项目中验证。
- 网段划分
- 将一句话的单词进行倒置,标点符号不倒换。比如一句话:“i love you.”倒换后变为"you. love i"
- POJ 3311-Hie with the Pie(floyd+TSP 状压DP)
- A. Consecutive Factors
- O(1) 空间复杂度逆序栈和排序栈
- 如何高效的结算一个正整数中二进制表示1的个数
- iPhone开发——AFN使用总结
- Flex RemoteObject 限制远程Java对象可访问方法
- Sicily 13862. Empty Stalls
- Android 横向带有吸附效果的横向拖动控件(效果同纵向下拉刷新ListView)
- 第9课时,自测
- [leetcode]Valid Phone Numbers