zoukankan      html  css  js  c++  java
  • 背包问题 POJ1742 Coins

    Coins
    Time Limit: 3000MS   Memory Limit: 30000K
    Total Submissions: 37762   Accepted: 12830

    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

    LouTiancheng@POJ
     
     
    据说男人八题之一……orz
    水题涨自信……
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 using namespace std;
     6 int n,m,ans;
     7 int a[110],c[110],used[100010];
     8 bool f[100010];
     9 int main(){
    10     while(scanf("%d%d",&n,&m)&&n&&m){
    11         memset(f,0,sizeof(f));
    12         ans=0;  
    13         for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    14         for(int i=1;i<=n;i++) scanf("%d",&c[i]);  
    15         f[0]=1;
    16         for(int i=1;i<=n;i++){  
    17             memset(used,0,sizeof(used));  
    18             for(int j=a[i];j<=m;j++){  
    19                 if(!f[j]&&f[j-a[i]]&&used[j-a[i]]<c[i]){  
    20                     f[j]=1;  
    21                     used[j]=used[j-a[i]]+1;  
    22                     ans++; 
    23                 }  
    24             }  
    25         }  
    26         printf("%d
    ",ans);
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    装饰设计模式
    Enum的基本使用
    java根据文件流判断文件类型(后缀名)
    Java正则表达式的用法
    java遍历Map
    java操作json
    struts2+ajax+jquery
    Hibernate注解
    oracle经典建表语句--scott建表
    Struts2 ui标签
  • 原文地址:https://www.cnblogs.com/zwube/p/7153122.html
Copyright © 2011-2022 走看看