POJ 1742 dp
来源:互联网 发布:mac的word文档 编辑:程序博客网 时间:2024/06/03 17:26
Coins
Time Limit: 3000MS Memory Limit: 30000K
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.
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 101 2 4 2 1 12 51 4 2 10 0
Sample Output
84
楼教主的男人八题中的一题,貌似是最简单的。
题意:给你n种硬币,一个m,接下来n个数是每种硬币的面值,最后n个数是每种硬币的数量,问你用这些硬币可以组成多少种不超过m元的组合。
多重背包,好好学习一下。
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[100005],sum[100005];int v[105],c[105];int main(){int n,m,i,j;while(scanf("%d%d",&n,&m)!=EOF){if(n==0&&m==0)break;memset(dp,0,sizeof(dp));for(i=1;i<=n;i++)scanf("%d",&v[i]);for(i=1;i<=n;i++)scanf("%d",&c[i]);dp[0]=1;int ans=0;for(i=1;i<=n;i++){memset(sum,0,sizeof(sum));for(j=v[i];j<=m;j++){if(!dp[j]&&dp[j-v[i]]&&sum[j-v[i]]<c[i]){dp[j]=1;sum[j]=sum[j-v[i]]+1;ans++;}}}cout<<ans<<endl;}return 0;}
0 0
- POJ 1742 Coins (DP)
- poj 1742 Coins(dp)
- POJ 1742 dp
- poj 1742 coins dp
- poj 1742 Coins (DP)
- POJ 1742 Coins(dp)
- POJ 1742 Coins (dp)
- poj dp
- 【dp】POJ
- 【dp】POJ
- [DP] POJ
- [DP] POJ
- [DP] POJ
- 【dp】POJ
- 【DP|多重背包可行性】POJ-1742 Coins
- POJ 1742 - Coins (dp 多重背包)
- Coins (poj 1742 && hdu 2844 DP)
- poj 1742 Coins dp 多重背包 优化
- 计算机作品三等奖——飞翔吧,七彩的梦
- hdu2138
- Liferay DXP数字体验平台,荣耀绽放:端对端的客户体验
- The Definitive Antlr 4 第7章学习笔记
- 11_奇偶数分离
- POJ 1742 dp
- 动态管理内存之new和delete
- Android Binder驱动中的基础数据结构整理
- hdu2098
- struct hypot typedef
- Mac OS X 利用 Automator/Xcode 控制隐藏文件
- const与class
- igrimace V3 VX 3.0 ig 闪退解决方式
- /usr/local/Trolltech/QtEmbedded-4.8.5-arm/include/QtCore/qatomic_armv5.h:131: 错误:no such instruction