Holding Bin-Laden Captive! 母函数模板题again

C - Holding Bin-Laden Captive!
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Description

We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China! 
“Oh, God! How terrible! ” 



Don’t be so afraid, guys. Although he hides in a cave of Hang Zhou, he dares not to go out. Laden is so bored recent years that he fling himself into some math problems, and he said that if anyone can solve his problem, he will give himself up! 
Ha-ha! Obviously, Laden is too proud of his intelligence! But, what is his problem? 
“Given some Chinese Coins (硬币) (three kinds-- 1, 2, 5), and their number is num_1, num_2 and num_5 respectively, please output the minimum value that you cannot pay with given coins.” 
You, super ACMer, should solve the problem easily, and don’t forget to take $25000000 from Bush! 

Input

Input contains multiple test cases. Each test case contains 3 positive integers num_1, num_2 and num_5 (0<=num_i<=1000). A test case containing 0 0 0 terminates the input and this test case is not to be processed. 

Output

Output the minimum positive value that one cannot pay with given coins, one line for one case. 

Sample Input

1 1 3
0 0 0

Sample Output

4

题意:有x1个1元 硬币 x2个2元硬币 x3个5元硬币,问第一个不能用这些硬币组成的金额y是多少

有坑,题目要分为两种情况

1.得出的y小于等于所有硬币的价值之和时,直接输出就可以了

2.得出的y大于所有硬币的价值之和,直接输出y+1即可

ac代码:

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int c1[10000], c2[10000],d[4]={0,1,2,5};
int val[10];
int main()
{
    while(scanf("%d%d%d",&val[1],&val[2],&val[3]))
    {
        if(val[1]==0&&val[2]==0&&val[3]==0)
        break;
        int sum=val[1]*1+val[2]*2+val[3]*5;
        memset(c1, 0, sizeof(c1));
        memset(c2, 0, sizeof(c2));
        for(int i=0;i<=val[1];i++)
        c1[i]=1;
        for(int i = 2; i <=3; i++)
        {
            for(int j = 0; j <=sum; j++)
            {
                for(int k = 0; j+ k*d[i]<=sum&&k<=val[i]; k++)
                {
                    c2[j+k*d[i]]+=c1[j];
                }
            }
            for(int j = 0; j <=sum; ++j)
            {
                c1[j] = c2[j];
                c2[j] = 0;
            }
        }
        int flag=0;
        for(int i=1;i<=sum;i++)
        {
            if(c1[i]==0)
            {
               printf("%d\n",i);
               flag=1;
               break;
            }
        }
        if(flag==0)
        printf("%d\n",sum+1);
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值