背包问题 POJ1742 Coins

 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\n",ans);
27     }
28     return 0;
29 }