PAT甲级 1103 Integer Factorization（30分）

最新推荐文章于 2024-06-12 10:00:23 发布

DrinkM1lk

最新推荐文章于 2024-06-12 10:00:23 发布

阅读量85

点赞数 1

分类专栏： PAT DFS 文章标签：深度优先算法

本文链接：https://blog.csdn.net/qq_44682929/article/details/126278795

版权

PAT 同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

DFS

5 篇文章 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 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 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

思路：直接DFS就可以了，注意相同因子是可以重复选的

#include <bits/stdc++.h>
using namespace std;
const int maxv=410;
int n,k,p,maxsum=0;
vector<int> factor;
vector<int> temp,ans;
void DFS(int sum,int st,int cnt,vector<int> &factor,vector<int> &temp)
{
    if(sum==n&&cnt==k)
    {
        int tempsum=accumulate(temp.begin(),temp.end(),0);
        if(tempsum>maxsum)
        {
            ans=temp;
            maxsum=tempsum;
        }
        return;
    }
    else if(sum>n||cnt>k) return;
    for(int i=st;i<factor.size();i++) //对于每个因子，有选和不选两种状态
    {
        temp.push_back(factor[i]);//选
        sum+=pow(factor[i],p);
        DFS(sum,i,cnt+1,factor,temp);//可以重复选
        sum-=pow(factor[i],p);//不选
        temp.pop_back();

    }
}
int main()
{
    scanf("%d %d %d",&n,&k,&p);
    for(int i=1;i*i<=n;i++) factor.push_back(i);
    sort(factor.begin(),factor.end(),greater<int>());
    DFS(0,0,0,factor,temp);
    if(maxsum==0)
    {
        printf("Impossible");
        return 0;
    }
    printf("%d = ",n);
    for(int i=0;i<ans.size();i++)
    {
        printf("%d^%d",ans[i],p);
        if(i!=ans.size()-1) printf(" + ");
    }
    return 0;
}