PAT(Advanced Level)1103. Integer Factorization
来源:互联网 发布:星空直播网络电视apk 编辑:程序博客网 时间:2024/04/29 08:47
1103. Integer Factorization (30)
The K-P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K-P factorization of N for any positive integers N, K and P.
Input Specification:
Each input file contains one test case which gives in a line the three positive integers N (<=400), K (<=N) and P (1<P<=7). The numbers in a line are separated by a space.
Output Specification:
For each case, if the solution exists, output in the format:
N = n1^P + ... nK^P
where ni (i=1, ... K) is the i-th factor. All the factors must be printed in non-increasing order.
Note: the solution may not be unique. For example, the 5-2 factorization of 169 has 9 solutions, such as 122 + 42 + 22 + 22 + 12, or 112+ 62 + 22 + 22 + 22, or more. You must output the one with the maximum sum of the factors. If there is a tie, the largest factor sequence must be chosen -- sequence { a1, a2, ... aK } is said to be larger than { b1, b2, ... bK } if there exists 1<=L<=K such that ai=bi for i<L and aL>bL
If there is no solution, simple output "Impossible".
Sample Input 1:169 5 2Sample Output 1:
169 = 6^2 + 6^2 + 6^2 + 6^2 + 5^2Sample Input 2:
169 167 3Sample Output 2:
Impossible
#include <bits/stdc++.h>using namespace std;int n,m,k,flag = 0,ans = 0;int a[500],b[500];void dfs(int d,int sum,int cnt,int t){ if(sum>n)return; if(cnt==m){ if(sum==n){ flag = 1; if(t>ans){ ans = t; for(int i = 0;i < m;i++) b[i] = a[i]; } } return; } for(int i = d;i >= 1;i--){ a[cnt] = i; dfs(i,sum+pow(i,k),cnt+1,t+i); }}int main(){ cin>>n>>m>>k; int temp = sqrt(n); dfs(temp,0,0,0); if(!flag)cout<<"Impossible"<<endl; else { cout<<n<<" = "; for(int i = 0;i < m;i++){ cout<<b[i]<<"^"<<k; if(i!=m-1){ cout<<" + "; } } } return 0;}
- PAT(Advanced Level)1103. Integer Factorization
- 【PAT】【Advanced Level】1103. Integer Factorization (30)
- PAT (Advanced Level) 1103. Integer Factorization (30) 解题报告
- PAT (Advanced Level) Practise 1103 Integer Factorization (30)
- PAT (Advanced Level) Practise 1103 Integer Factorization (30)
- 1103. Integer Factorization (30)【搜索+剪枝】——PAT (Advanced Level) Practise
- PAT 1103. Integer Factorization
- 【PAT】1103. Integer Factorization
- [PAT]1103. Integer Factorization (30)
- 【PAT】1103. Integer Factorization (30)
- PAT 1103. Integer Factorization (30)
- PAT 1103. Integer Factorization (30)
- pat 1103. Integer Factorization (30)
- PAT 1103. Integer Factorization (30)
- pat 1103. Integer Factorization (30)
- PAT(A) - 1103. Integer Factorization (30)
- 1103. Integer Factorization (30) PAT 甲级
- pat甲 1103. Integer Factorization ( dfs)
- java虚拟机内部原理分析
- JavaScript之Prototype学习(一)
- CSS3 遇到的问题
- Android入门之搭建开发环境
- JAVA垃圾回收机制分析
- PAT(Advanced Level)1103. Integer Factorization
- POJ2559 Largest Rectangle in a Histogram
- NOI 2011 阿狸的打字机 AC自动机
- cocos2d-x 基础系列 (12) ParticleFireworks ParallaxNode示例
- 算法训练 瓷砖铺放
- [github项目]迅雷吸血进程自动清扫工具thunderAutoManager
- Ubuntu vi 上下左右变ABCD问题解决方法
- eclipse部署web项目至本地的tomcat但在webapps中找不到问题
- sdut 3867