zoukankan      html  css  js  c++  java
  • POJ 1787 Charlie's Change (完全背包,记录路径)

    Charlie's Change
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 2215   Accepted: 575

    Description

    Charlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically the setup of your next task.

    Your program will be given numbers and types of coins Charlie has and the coffee price. The coffee vending machines accept coins of values 1, 5, 10, and 25 cents. The program should output which coins Charlie has to use paying the coffee so that he uses as many coins as possible. Because Charlie really does not want any change back he wants to pay the price exactly.

    Input

    Each line of the input contains five integer numbers separated by a single space describing one situation to solve. The first integer on the line P, 1 <= P <= 10 000, is the coffee price in cents. Next four integers, C1, C2, C3, C4, 0 <= Ci <= 10 000, are the numbers of cents, nickels (5 cents), dimes (10 cents), and quarters (25 cents) in Charlie's valet. The last line of the input contains five zeros and no output should be generated for it.

    Output

    For each situation, your program should output one line containing the string "Throw in T1 cents, T2 nickels, T3 dimes, and T4 quarters.", where T1, T2, T3, T4 are the numbers of coins of appropriate values Charlie should use to pay the coffee while using as many coins as possible. In the case Charlie does not possess enough change to pay the price of the coffee exactly, your program should output "Charlie cannot buy coffee.".

    Sample Input

    12 5 3 1 2
    16 0 0 0 1
    0 0 0 0 0
    

    Sample Output

    Throw in 2 cents, 2 nickels, 0 dimes, and 0 quarters.
    Charlie cannot buy coffee.
    

    Source

     

    题目大意:给定一个数p,要求用四种币值为1,5,10,25的硬币拼成p,并且硬币数要最多,如果无解输出"Charlie cannot buy coffee.",1<=p<=1万,1<=硬币数量<=1万

    #include<stdio.h>
    #include<iostream>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    const int INF=0x3f3f3f3f;
    int v[4]={1,5,10,25};
    int dp[10010];
    int path[10010],used[10010];
    int num[4];
    int ans[100];//这个要大于25
    int main()
    {
       // freopen("in.txt","r",stdin);
       // freopen("out.txt","w",stdout);
        int P;
        while(scanf("%d",&P))
        {
            for(int i=0;i<4;i++)scanf("%d",&num[i]);
            if(P==0&&num[0]==0&&num[1]==0&&num[2]==0&&num[3]==0)break;
            for(int i=0;i<=P;i++)dp[i]=-INF;
            memset(path,0,sizeof(path));
            path[0]=-1;
            dp[0]=0;
            for(int i=0;i<4;i++)
            {
                memset(used,0,sizeof(used));
                for(int j=v[i];j<=P;j++)
                  if(dp[j-v[i]]+1>dp[j]&&dp[j-v[i]]>=0&&used[j-v[i]]<num[i])
                  {
                      dp[j]=dp[j-v[i]]+1;
                      used[j]=used[j-v[i]]+1;
                      path[j]=j-v[i];
                  }
            }
            memset(ans,0,sizeof(ans));
            if(dp[P]<0)
            {
                printf("Charlie cannot buy coffee.\n");
                continue;
            }
            else
            {
                int i=P;
                while(1)
                {
                    if(path[i]==-1)break;
                    ans[i-path[i]]++;
                    i=path[i];
                }
                printf("Throw in %d cents, %d nickels, %d dimes, and %d quarters.\n",ans[v[0]],ans[v[1]],ans[v[2]],ans[v[3]]);
            }
        }
        return 0;
    }
  • 相关阅读:
    Linux下文件的三种时间标记:访问时间、修改时间、状态改动时间 (转载)
    linux下创建文件的文件权限问题
    linux下文件特殊权限设置位S和沾附位T(转载)
    c 不同类型的指针
    linux exit 和 _exit的区别
    (转)linux下错误的捕获:errno和strerror的使用,以及perror和strerror的区别
    (总结)Linux下su与su -命令的本质(转)
    linux切换shell
    mysql安装两个版本
    远程连接数据库 出现 Client does not support authentication protocol requested by server的解决方法
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2695803.html
Copyright © 2011-2022 走看看