1103 Integer Factorization (30分)

最新推荐文章于 2020-04-02 14:28:57 发布

李小白~

最新推荐文章于 2020-04-02 14:28:57 发布

阅读量148

点赞数

分类专栏： PAT（甲级）文章标签： dfs

本文链接：https://blog.csdn.net/qq_40941722/article/details/105046328

版权

PAT（甲级）专栏收录该内容

130 篇文章 10 订阅

订阅专栏

题目

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(\le400)$ , $K(\le N)$ and $P(1\lt P\le7)$ . 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^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\le L\le K$ such that $a_i=b_i$ for $i\lt L$ and $a_L\gt 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

题目大意

求 $k$ 个数的 $p$ 次幂之和等于 $N$ 。答案可能有多种，输出 $k$ 个数之和最大的那种，若和最大则输出字典序最大的。

思路

$n$ 最大为400，所以不必要从 $n$ 开始往下枚举，只需枚举a[i]从1开始递增，使得a[i]^p <= n，将i的P次幂存储到vector中，然后 DFS 搜索。

代码

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

int n, k, p;
vector<int> e;
vector<int> ans, tempaans;
int sum = 0, tempsum = 0, temptotal = 0;

int getExp(int t){
    int res = 1;
    for(int i=0; i<p; i++)
        res *= t;
    return res;
}

void dfs(int t){
    if(temptotal > n || tempaans.size() > k)
        return;
    if(temptotal == n && tempaans.size() == k && tempsum > sum){
        //printf("%d %d\n", tempsum, temptotal);
        sum = tempsum;
        ans = tempaans;
        return;
    }
    for(int i=t; i>0; i--){
        tempsum += i, temptotal += e[i], tempaans.push_back(i);
        dfs(i);
        tempsum -= i, temptotal -= e[i], tempaans.pop_back();
    }
}

int main(){
    scanf("%d%d%d", &n, &k, &p);
    for(int i=0; ; i++){
        e.push_back(getExp(i));
        if(getExp(i+1) > n){
            dfs(i);
            break;
        }
    }
    if(ans.empty())
        printf("Impossible\n");
    else{
        printf("%d = %d^%d", n, ans[0], p);
        for(int i=1; i<k; i++)
            printf(" + %d^%d", ans[i], p);
        printf("\n");
    }
    return 0;
}