UVA 11137 Ingenuous Cubrency
2013-03-28 11:23
323 查看
给你面值为1的3次方,2的三次方。。。。21 的三次方的硬币,求出达到目的的钱的所有组合方法。由于9999对应方法数超出了int 范围,故需要考虑他。
/* Name:UVA 11137 Ingenuous Cubrency-AC Copyright:angieeve Author: zj Date: 28/03/13 11:20 Description: coin change */ #include <iostream> #include <cstdlib> #include <cstdio> using namespace std; int casen; long long dp[10010]; int coin[25]; int main() { dp[0]=1; for(int i=0;i<21;i++){ coin[i]=(i+1)*(i+1)*(i+1);} for(int i=0;i<21;i++){ for(int j=1;j<10000;j++){ if(j>=coin[i]) dp[j]+=dp[j-coin[i]]; }} int casen; while(cin>>casen){ cout<<dp[casen]<<endl; } return 0; }
相关文章推荐
- Ingenuous Cubrency - UVa 11137 dp
- 【Java】【滚动数组】【动态规划】UVA - 11137 - Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency (递推 DP 多重背包 )
- uva 11137 - Ingenuous Cubrency
- UVa:11137 Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency(完全背包)
- UVA 11137 Ingenuous Cubrency(完全背包)
- UVa 11137 - Ingenuous Cubrency 背包
- UVa-11137 Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency 背包
- UVA - 11137 Ingenuous Cubrency
- UVA 11137 Ingenuous Cubrency 类似硬币问题的简单dp
- 动态规划,递推,多段图(Ingenuous Cubrency,uva 11137)
- UVa 11137 - Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推