PAT (Advanced Level) Practise 1096 Consecutive Factors (20)
2016-03-25 21:10
447 查看
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:
35*6*7
找连续的因子,因为范围不超过int,那其实最多能连续的也就12!来着的,所以暴力搞
#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF = 0x7FFFFFFF;
const int maxn = 2e3 + 10;
LL n;
int main()
{
scanf("%lld", &n);
for (LL i = 11; i > 1; i--)
{
for (LL j = 2;; j++)
{
LL cnt = 1;
for (LL k = j; k < j + i; k++) cnt *= k;
if (cnt > n) break;
if (n%cnt == 0)
{
printf("%d\n", i);
for (LL k = j; k < j + i; k++) printf("%d%s", k, k + 1 == j + i ? "\n" : "*");
return 0;
}
}
}
for (LL i = 2; i*i <= n; i++) if (n%i == 0) {
printf("1\n%d\n", i); return 0;
}
printf("1\n%d\n", n);
return 0;
}
相关文章推荐
- libdvbpsi源码分析(四)PAT表解析/重建
- PAT配置
- 什么是端口复用动态地址转换(PAT) 介绍配置实例
- MikroTik layer7-protocol
- PAT是如何工作的
- PAT 乙级题:1002. 写出这个数 (20)
- PAT (Advanced Level) Practise 1001-1010
- 数据结构学习与实验指导(一)
- PAT Basic Level 1001-1010解题报告
- 1001. 害死人不偿命的(3n+1)猜想
- 1002. 写出这个数
- 1032. 挖掘机技术哪家强
- 1001. 害死人不偿命的(3n+1)猜想 (PAT basic)
- 1002. 写出这个数(PAT Basic)
- 1004. 成绩排名(PAT Basic)
- 1006. 换个格式输出整数(PAT Basic)
- 1007. 素数对猜想(PAT Basic)
- 1008. 数组元素循环右移问题
- 1009. 说反话(PAT Basic)
- 1011. A+B和C(PAT Basic)