# 1103 Integer Factorization（PAT 甲等 C++实现）

1103 Integer Factorization （30 point(s)）

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 = n^P + ... n[K]^P


where n[i] (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 12​2​​+4​2​​+2​2​​+2​2​​+1​2​​, or 11​2​​+6​2​​+2​2​​+2​2​​+2​2​​, 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 { a​1​​,a​2​​,⋯,a​K​​ } is said to be larger than { b​1​​,b​2​​,⋯,b​K​​ } if there exists 1≤L≤K such that a​i​​=b​i​​ for i<L and a​L​​>b​L​​.

If there is no solution, simple output Impossible.

### Sample Input 1:

169 5 2


### Sample Output 1:

169 = 6^2 + 6^2 + 6^2 + 6^2 + 5^2


### Sample Input 2:

169 167 3


### Sample Output 2:

Impossible

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;

int n,k,p;
int maxfacsum=-1;
vector<int> factor,ans,temp;

static void DFS(int index,int nowk,int sum,int facsum){
if(sum==n && nowk==k){ // 条件满足
if(facsum > maxfacsum){
ans = temp;
maxfacsum = facsum;
}
return;
}
if(sum>n || nowk>k){   // 不符合要求
return;
}

if(index-1>=0){
temp.push_back(index);
DFS(index,nowk+1,sum+factor[index],facsum+index);
temp.pop_back();
DFS(index-1,nowk,sum,facsum);
}
}

// 1103 Integer Factorization （30 point(s)）
int main(void){
cin>>n>>k>>p;

int temp=0,j=0;
while(temp<=n){ //存放 P（2~7） 即底数肯定小于 factor.size()
factor.push_back(temp);
temp = pow(++j,p);
}

DFS(factor.size()-1,0,0,0); // 深度优先遍历

if(maxfacsum == -1){  // 输出
cout<<"Impossible"<<endl;
}else{
cout<<n<<" = "<<ans<<"^"<<p;
for(int i=1;i<ans.size();++i){
cout<<" + "<<ans[i]<<"^"<<p;;
}
}

return 0;
} // jinzheng 2018.9.19 15:33


10-16 214

#### 1103 Integer Factorization

07-25 1471

#### 1103 Integer Factorization (30)（30 分） 05-02 264

#### 1103. Integer Factorization 解析

05-06 182

#### 1103. Integer Factorization

09-22 238

#### pat a 1103 integer factorization

01-03 243

#### PAT 甲级 1103 Integer Factorization (DFS)(c++版)(附代码注释)（附题意分析）

01-30 75

#### 1103 Integer Factorization （30 分）（C++） ©️2020 CSDN 皮肤主题: 黑客帝国 设计师: 上身试试 点击重新获取   扫码支付 1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。 余额充值