Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 2215 | Accepted: 575 |
Description
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
Output
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; }