1103. Integer Factorization (30)

最新推荐文章于 2018-11-02 22:55:36 发布

qq_37680278

最新推荐文章于 2018-11-02 22:55:36 发布

阅读量132

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_37680278/article/details/80030045

版权

PAT 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

1103. Integer Factorization (30)

时间限制

1200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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² + 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_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

目前只拿了18/30。第一次写这样比较绞的题目，看了半天dfs，等等，最终还有错误，过几日再调整。

vector 两个vector可以整体赋值，a=b。其次每次寻找，都要存入，找失败再取出。

注意条件，否则不限循环。

目前超时一个，应该要调整，剪枝方法/

#include<math.h>
#include<stdio.h>
#include<vector>
using namespace std;
int n,k,p;
int maxn=0,num;
vector<int> fac,ans;
void dfs(int index,int num,int sum,int sum1){
    if(sum>n||num>k)return;
    if(num==k&&sum==n){
        if(sum1>maxn){
            maxn=sum1;
            ans=fac;
        }
        return;
    }
    int a=index;
    for(int i=1;i<p;i++){
        a=a*index;
    }
    fac.push_back(index);
    dfs(index,num+1,sum+a,sum1+index);
    fac.pop_back();
    if(index<sqrt(n)+1){
           // fac.push_back(index);
            dfs(index+1,num,sum,sum1);
          // fac.pop_back();
          }
    fac.push_back(index);
    dfs(index+1,num+1,sum+a,sum1+index);
    fac.pop_back();
}
int main(){
    scanf("%d %d %d",&n,&k,&p);
    dfs(2,0,0,0);
    if(maxn!=0){
        printf("%d = %d^%d",n,ans[ans.size()-1],p);
        for(int i=ans.size()-2;i>=0;i--){
            printf(" + %d^%d",ans[i],p);
        }
    }else{
    printf("Impossible");}

    return 0;
}