Coins(P1742)数量背包

最新推荐文章于 2026-06-17 16:36:03 发布

原创最新推荐文章于 2026-06-17 16:36:03 发布 · 456 阅读

1 ·

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

标签

#output #ini #input #each #go

背包专栏收录该内容

11 篇文章

订阅专栏

本文探讨了在给定银币价值和数量的情况下，如何使用算法找到恰好支付不超过指定金额的方法数量。通过实例分析，展示了算法的实现过程，并优化了性能以避免超时。

自己理解的算法不行，会超时，看了一下，然后写了一个，注意观看重要部分并体会呀，

#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<stack>
#include<math.h>
#include<stdlib.h>
#include<list>
#include<vector>

using namespace std;


int n,m;
int v[100001];
int go[10000];
int num[200];
int val[200];
int visit[100001];

int main()
{
    int i,j,k;
    while (scanf("%d%d",&n,&m))
    {
        if (n==0&&m==0)
            break;
        for (i=0;i<n;i++)
            scanf("%d",val+i);
        for (i=0;i<n;i++)
            scanf("%d",num+i);
        /*    
        int hi[30];
        k=0;
        hi[1]=1;
        for (i=2;i<30;i++)
            hi[i]=2*hi[i-1];
        hi[0]=0;
        for (i=0;i<n;i++)
        {
            j=1;
            while (num[i]>hi[j])
            {
                num[i]-=hi[j];
                go[k++]=val[i]*hi[j++];
            }
            if (num[i])
                go[k++]=val[i]*num[i];
        }
        //cout<<"yes"<<endl;
        */
        for (i=0;i<=m;i++)
            v[i]=0;

        for (i=0;i<n;i++)
        {
            for (j=0;j<=m;j++)
                visit[j]=0;
            for (j=val[i];j<=m;j++)
            {
                k=v[j-val[i]]+val[i];
                if (visit[j-val[i]]<num[i]&&k>v[j])
                {
                    v[j]=k;
                    visit[j]=visit[j-val[i]]+1;
                }
            }
        }
        k=0;
        for (i=1;i<=m;i++)
        {
        //    cout<<v[i]<<' ';
            if (v[i]==i)
                k++;
        }
        printf("%d\n",k);
    }
}

Coins

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 22003		Accepted: 7484

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