POJ 1742 Coins

本文介绍了一种特殊的硬币支付问题,在限定条件下计算可以组成的支付金额数。通过使用动态规划的方法,解决Tony如何利用手中不同面额的硬币支付特定价格的问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Coins
Time Limit: 3000MSMemory Limit: 30000K
Total Submissions: 25127Accepted: 8498

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

Source


虽然和HD一样的题,但是不能用背包算了。。。。


#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

int N,V;
int a[111],c[111];
int dp[111111];
int sum[111111];//到当前位置硬币使用了几个

int main()
{
while(scanf("%d%d",&N,&V))
{
    int ans=0;
    if(N==0&&V==0) break;

    for(int i=0;i<N;i++)
        scanf("%d",&a );
    for(int i=0;i<N;i++)
        scanf("%d",&c );

    memset(dp,0,sizeof(dp));
    dp[0]=1;

    for(int i=0;i<N;i++)
    {
        memset(sum,0,sizeof(sum));
        for(int j=a ;j<=V;j++)
        {
            if(dp[j]==0&&dp[j-a ]==1&&sum[j-a]<c)
            {
                dp[j]=1;
                sum[j]=sum[j-a ]+1;
                ans++;
            }
        }
    }

    printf("%d\n",ans);

}

    return 0;
}
 

转载于:https://www.cnblogs.com/CKboss/archive/2013/06/10/3351028.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值