Problem 31 Coin sums(完全背包dp)
来源:互联网 发布:mac系统idea下载git 编辑:程序博客网 时间:2024/05/18 20:52
Coin sums
Problem 31
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made using any number of coins?
题解:完全背包。DP。
代码:
#include<bits/stdc++.h>using namespace std;int coins[8] = {1,2,5,10,20,50,100,200};int dp[210];int main(){memset(dp,0,sizeof(dp));dp[0]=1;for(int i=0;i<8;i++){for(int j=coins[i];j<=200;j++){if(j>=coins[i])dp[j]+=dp[j-coins[i]];}}cout<<dp[200]<<endl;return 0;}
0 0
- Problem 31 Coin sums(完全背包dp)
- Coin sums Problem 31
- projecteuler---->problem=31----Coin sums 无限背包计算可能存在的次数
- Project Euler:Problem 31 Coin sums
- UVA 674 Coin Change(dp + 完全背包)
- UVA.674 Coin Change (DP 完全背包)
- uva 674 Coin Change(完全背包)
- uva674 - Coin Change(完全背包)
- UVA 674 - Coin Change(完全背包)
- UVA 674 Coin Change(完全背包)
- UVA 674 Coin Change(完全背包)
- UVA 674 Coin Change(完全背包)
- hackerrank The Coin Change Problem(dp)
- Project Euler 31- Coin sums
- uva 674 Coin Change(类似完全背包)
- LightOj 1231 Coin Change (II)(完全背包)
- uva 674 && hdu 2069 coin change(水完全背包)
- Coin sums
- Java的Arrays源码
- 第九周—切面条
- Decode String
- HTML5 关于 <audio>的操作
- daimajia的图片轮播开源项目配置
- Problem 31 Coin sums(完全背包dp)
- 三天上手PHP之8:逻辑判断(if Else Switch)
- Hdu 1520 Anniversary party(树形DP)
- ubuntu无法上网以及无法远程登录、cuteftp无法登陆linux的解决办法
- jfinal整合Hibernate-validator校验框架
- keil编译后code,RO-data,RW-data,ZI-data含义及mcu的flash实际存储数据
- CSS控制元素定位
- Android呼吸灯效果两种实现
- linux c下的字符串正则替换