PAT(Advanced)甲级---1103 Integer Factorization (30分)【DFS】

最新推荐文章于 2024-05-05 19:11:51 发布

逆风阿煜Go

最新推荐文章于 2024-05-05 19:11:51 发布

阅读量246

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/weixin_38854519/article/details/99730068

版权

PAT甲级专栏收录该内容

12 篇文章 0 订阅

订阅专栏

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[1]^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²+4²+2²+2²+1², or 11²+6²+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₁ ,a₂ ,⋯,a_K } is said to be larger than { b₁,b₂,⋯,b_K } if there exists 1≤L≤K such that a_i =b_ifor 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

题目大意

给三个正整数N、K、P，将N表示成K个正整数（可以相同，递减排列）的P次方和，如果有多种方案，选择底数n1+…+nk最大的方案，如果还有多种方案，选择底数序列的字典序最大的方案。

#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;

int N, K, P;
vector<int> ansfac,tempfac; //存储所有因子
int maxsum = -1;//最大因子总和

void dfs(int nowf,int nowK, int sum, int Psum){ //当前的因子，当前因子个数，片段和，P总和
	if (nowK == K){
		if (Psum == N&&sum > maxsum){
			maxsum = sum;
			ansfac = tempfac;
		}
		return;
	}
	if (Psum >= N || nowf < 1)return;
	tempfac.push_back(nowf);
	dfs(nowf, nowK + 1, sum + nowf, Psum + pow(nowf, P)); //要当前因子
	tempfac.pop_back();
	dfs(nowf - 1, nowK, sum, Psum); //不要当前因子
}

int main(){
	scanf("%d%d%d", &N, &K, &P);
	int maxf = sqrt(N*1.0);
	dfs(maxf,0, 0, 0);
	if (ansfac.empty())printf("Impossible\n");
	else { 
		printf("%d = ", N);
		for (auto it = ansfac.begin(); it != ansfac.end(); it++){
			if (it != ansfac.begin())printf(" + ");
			printf("%d^%d", *it, P);
		}
		printf("\n");
	}
}