poj 1742 coins

最新推荐文章于 2019-09-22 20:25:37 发布

原创最新推荐文章于 2019-09-22 20:25:37 发布 · 455 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

背包专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种算法解决硬币支付问题，即计算在给定硬币面额和数量的情况下，能够恰好支付的不同价格数目。该问题通过动态规划求解，输入包含硬币的面额、数量及最大可能的价格。

Coins
Time Limit: 3000MS Memory Limit: 30000K
Total Submissions: 34226 Accepted: 11616

Description
People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.

Input
The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.

Output
For each test case output the answer on a single line.

Sample Input

3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0

Sample Output

8
4

【分析】
并不懂，代码是拷的。

【代码】

// poj 1742 coins
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std;
int v[101],w[101],dp[100001],sum[100001];
int main()
{
    int i,j,k,x,y,n,m;
    while(1)
    {
        int ans=0;
        memset(dp,0,sizeof dp);
        scanf("%d%d",&n,&m);
        if(n==0 && m==0) break;
        dp[0]=1;
        fo(i,1,n) scanf("%d",&v[i]);
        fo(i,1,n) scanf("%d",&w[i]);
        fo(i,1,n)
        {
            memset(sum,0,sizeof sum);
            fo(j,v[i],m)
              if(!dp[j] && dp[j-v[i]] && sum[j-v[i]]<w[i])  
              {  
                dp[j]=1;  
                sum[j]=sum[j-v[i]]+1;  
                ans++;  
              }  
        }
        printf("%d\n",ans);
    }
    return 0;
}