UVA 674 Coin Change
来源:互联网 发布:怎样做一个淘宝店 编辑:程序博客网 时间:2024/05/21 17:01
有5种货币,1,5,10,25,50.给出钱的总数,问有多少种组成方案。
解法:DP,dp[i]表示能换到i元的方法总数。
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int dp[7500];int a[5] = {1,5,10,25,50};int main(){ int n; while(~scanf("%d",&n)) { memset(dp,0,sizeof(dp)); dp[0] = 1; for(int i = 0 ; i < 5 ;i++) { for(int v = a[i] ; v <= n ; v++) { dp[v] += dp[v-a[i]]; } } printf("%d\n",dp[n]); } return 0;}
0 0
- UVA 674 - Coin Change
- UVa 674 - Coin Change
- uva 674 Coin Change
- uva:674 - Coin Change
- Uva 674 Coin Change
- uva 674 Coin Change
- uva 674 - Coin Change
- UVa 674 - Coin Change
- Uva - 674 - Coin Change
- UVa 674 - Coin Change
- uva 674 Coin Change
- UVa 674 - Coin Change
- UVa 674 - Coin Change
- UVA-674-Coin Change
- UVA 674 coin change
- UVa 674: Coin Change
- UVA - 674 Coin Change
- uva 674 Coin Change
- MarkDown表格插入法
- ireport各个版本的下载地址分享
- UVA 10405 Longest Common Subsequence
- Linux IPC实践(5) --System V消息队列(2)
- JSP+css标签页
- UVA 674 Coin Change
- EL表达式中获取list长度
- nike 2015 vOmf Gse GZRwO
- 近期学习小结--objective c
- UVA 147 Dollars
- WiFi连不上的一个原因
- oc中常见的数据类型
- map
- LeetCode Remove Element