zoukankan      html  css  js  c++  java
  • HDU_1085_Holding Bin-Laden Captive!_母函数

    Holding Bin-Laden Captive!

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 19908    Accepted Submission(s): 8865


    Problem 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
     
    三种硬币,输入三种硬币的个数,问所有这些硬币所不能支付的钱数的最小值。
    用母函数解决,虽说做得有点久,思想基本掌握。
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    
    int c1[10000];
    int c2[10000];
    int c3[4000];
    
    int main()
    {
        int a,b,c;
        while(scanf("%d%d%d",&a,&b,&c)!=EOF&&(a||b||c))
        {
            memset(c1,0,sizeof(c1));
            memset(c2,0,sizeof(c2));
            memset(c3,0,sizeof(c3));
            for(int i=0; i<=a; i++)
                c1[i]=1;
            for(int i=0; i<=a; i++)
                for(int j=0; j<=2*b; j+=2)
                    c2[i+j]+=c1[i];
    
            for(int i=0;i<=a+b*2;i++)
            {
                c1[i]=c2[i];
                c2[i]=0;
            }
            for(int i=0; i<=(a*1)+(b*2); i++)
                for(int j=0; j<=5*c; j+=5)
                    c2[i+j]+=c1[i];
            for(int i=0;i<=a+b*2+c*5;i++)
                c1[i]=c2[i];
            /*for(int i=0;i<=a+2*b+5*c;i++)
                cout<<c1[i]<<endl;
                cout<<endl;*/
            for(int i=1;i<=a+2*b+5*c+1;i++)
                if(c1[i]==0)
            {
                printf("%d
    ",i);
                break;
            }
        }
        return 0;
    }
    View Code
  • 相关阅读:
    一起学编程(3--组织与表达)
    摩托罗拉SE955 One Discrete Length,Two Discrete Lengths,Length Within Range 相关解释
    完好用户体验: 活用window.location与window.open解决页面跳转问题
    一张图帮你看懂 iPhone 6 Plus 的屏幕分辨率
    李振杰:火狐Mozilla被黑事件的启发
    POJ 1611 The Suspects 并查集 Union Find
    hdu1879 继续畅通project(最小生成树)
    【Android实战】Socket消息通信
    HDOJ 5098 Smart Software Installer 拓扑排序
    各大电商的缓存策略
  • 原文地址:https://www.cnblogs.com/jasonlixuetao/p/5537903.html
Copyright © 2011-2022 走看看