Coin sums Problem 31
来源:互联网 发布:折线图数据单位不一样 编辑:程序博客网 时间:2024/05/18 18:46
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?
Answer:
73682
dp[m][n]表示对于m钱用前n种硬币可以有多少表示方法,那么考虑对于第n个币种拿1,2,3,,,,一直到m/money[n]个,将所有情况累加。
#include<bits/stdc++.h>using namespace std;#define maxn 205long long money[9]={1,2,5,10,20,50,100,200};long long dp[maxn][maxn];int main(){ memset(dp,0,sizeof(dp)); for(int i=0;i<=200;i++) dp[0][i]=1; for(int i=0;i<=200;i++) dp[i][0]=1; for(long long i=1;i<=200;i++) { for(long long j=1;j<=6;j++) { dp[i][j]=dp[i][j-1]; for(long long z=1;;z++) { if(i-z*money[j]<0) break; dp[i][j]+=dp[i-z*money[j]][j-1]; } } } cout<<dp[200][6]<<endl;}
阅读全文
0 0
- Coin sums Problem 31
- Project Euler:Problem 31 Coin sums
- Problem 31 Coin sums(完全背包dp)
- Project Euler 31- Coin sums
- Coin sums
- projecteuler---->problem=31----Coin sums 无限背包计算可能存在的次数
- 欧拉工程第31题:Coin sums
- Coin Change Problem
- The Coin Change Problem
- Dive into Coin Changing Problem
- [Hackerrank] The Coin Change Problem
- projecteuler---->problem=23----Non-abundant sums
- Project Euler:Problem 23 Non-abundant sums
- ZOJ Problem Set - 2773 Triangular Sums【公式】
- coin change problem 的一个变体
- swust oj 1139--Coin-row problem
- Project Euler:Problem 78 Coin partitions
- hackerrank The Coin Change Problem(dp)
- Oracle 创建普通用户,并赋予权限
- 浅谈我的前端之路
- [译]The Python Tutorial#5. Data Structures
- 边沿检测
- HTML编码规范整理
- Coin sums Problem 31
- mac 挂载远程文件
- java内存管理深入浅出
- Head First设计模式笔记(观察者模式)
- 7190
- Windows下编写shell脚本出现\r错误解决方法
- ES6
- LeetCode: 412. Fizz Buzz
- K-diff Pairs in an Array