CodeForces 797A k-Factorization
2017-05-09 09:42
316 查看
质因数分解。
分解一下质因数,如果个数小于$k$个,则无解,否则把多出来的合成一个数。
分解一下质因数,如果个数小于$k$个,则无解,否则把多出来的合成一个数。
#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <queue> #include <stack> #include <vector> #include <algorithm> using namespace std; int b[100010],sz; int n,k; int a[100010]; vector<int>ans; bool prime(int x) { for(int i=2;i*i<=x;i++) { if(x%i==0) return 0; } return 1; } void init() { for(int i=2;i<=100000;i++) { if(prime(i)) b[sz++] =i; } } int main() { init(); scanf("%d%d",&n,&k); for(int i=0;i<sz;i++) { while(n%b[i]==0) { ans.push_back(b[i]); n=n/b[i]; } if(n==1) break; } if(ans.size()<k) { printf("-1\n"); } else { for(int i=0;i<k-1;i++) { printf("%d ",ans[i]); } int p=1; for(int i=k-1;i<ans.size();i++) { p=p*ans[i]; } printf("%d\n",p); } return 0; }
相关文章推荐
- Codeforces 797A k-Factorization
- Codeforces 797A k-Factorization
- CodeForces 797A k-Factorization
- codeforces] ECR19 A. k-Factorization [数论]
- 【CodeForces 797A】k-Factorization(分解质因数)
- Codeforces 333D Characteristics of Rectangles
- codeforces 589H DFS
- 【1】【数学】CodeForces 588C Duff and Weight Lifting
- codeforces-776D-The Door Problem(染色+建边+dfs)
- CodeForces - 837C
- codeforces 903e Swapping Characters
- CodeForces 425B Sereja and Table(枚举)
- codeforces 585F - Digits of Number Pi (dp + acauto)
- codeforces 706D Vasiliy's Multiset
- CodeForces - 540C Ice Cave(BFS)
- codeforces 450-B Jzzhu and Sequences 矩阵快速幂
- 【codeforces】Bear and Three Balls(排序,去重)
- codeforces 191D Dynasty Puzzles (图论,疑难杂题)
- Codeforces 625D Finals in arithmetic(Codeforces Round #342 (Div. 2) D) 题解
- CodeForces 675A Infinite Sequence(等差数列求项)