PAT (Advanced Level) Practise 1096 Consecutive Factors (20)
来源:互联网 发布:东莞金博软件 编辑:程序博客网 时间:2024/05/18 23:29
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 <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int main(){ int n; while(~scanf("%d",&n)) { int ma=0,ans=n,m=sqrt(n);; for(int i=2;i<=m;i++) { int k=i,kk=n; while(kk%k==0) { kk/=k; k++; } if(k-i>ma) { ma=k-i; ans=i; } } if(!ma) { printf("1\n%d\n",n); continue; } printf("%d\n",ma); printf("%d",ans); for(int i=ans+1;i<ans+ma;i++) printf("*%d",i); printf("\n"); } return 0;}
- PAT (Advanced Level) Practise 1096 Consecutive Factors (20)
- PAT (Advanced Level) Practise 1096 Consecutive Factors (20)
- 1096. Consecutive Factors (20)——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1096(Consecutive Factors)
- 【PAT】【Advanced Level】1096. Consecutive Factors (20)
- PAT (Advanced Level) 1096. Consecutive Factors (20) 连续质因数
- PAT (Advanced Level) Practise 1059 Prime Factors (25)
- PAT (Advanced Level) Practise 1059 Prime Factors (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- C++中指针和引用
- 时间高效过滤词算法
- git:辅助
- Vue.js学习
- Uri转换为String类型路径
- PAT (Advanced Level) Practise 1096 Consecutive Factors (20)
- 6月30日云栖精选夜读:程序员技术与文艺的PK_来首届阿里巴巴研发效能嘉年华
- 数据压缩算法LZO
- MD5加密工具类
- JUnit单元测试,及实例
- centos6.5环境下操作nginx
- Java中CAS详解
- JSON.parse()和JSON.stringify()
- Android中ImageView自适应高度