1068 Find More Coins (30)(30 分)

1068 Find More Coins (30)(30 分)
Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 10^4^ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

可以用dfs也可以用背包做
dfs有时候是神器啊
最后一个点卡我时间 我用特判了 应该是所有硬币和都不够m的情况

#include <bits/stdc++.h>
int a[102000];
int n,m;
using namespace std;
std::vector<int> v;
void show(){
    int flag=0;
    for(int i=0;i<v.size();i++){
        if(!flag){
            flag=1;
            printf("%d",v[i]);
        }
        else{
            printf(" %d",v[i]);
        }
    }
    printf("\n");
}
int ok=0;
void dfs(int index,int sum,int cnt){
    if(ok) return;
    if(sum==m){
        ok=1;
        show();
        return;
    }
    if(sum>m){
        return;
    }
    for(int i=index;i<=n;i++){
        v.push_back(a[i]);
        dfs(i+1,sum+a[i],cnt+1);
        v.erase(v.end()-1);//删掉最后那个元素
    }
}
int main(){
    cin>>n>>m;
    int sum=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        sum+=a[i];
    }
    if(sum<m){//所有coin都不夠
        printf("No Solution\n");
        return 0;
    }
    sort(a+1,a+1+n);//从小到大排序
    dfs(1,0,0);//从第一个开始找
    if(!ok){
        printf("No Solution\n");
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值