USACO 2.3.4 Money Systems dp
2011-10-29 23:19
253 查看
dp[i]+=dp[i-a];
dp[i]表示组成数 i 的方式的个数
View Code
dp[i]表示组成数 i 的方式的个数
View Code
#include <stdio.h> int main() { int n,m,i,j,a; long long dp[10005]={0}; scanf("%d%d",&n,&m); dp[0]=1; for (i=0;i<n;i++) { scanf("%d",&a); for (j=a;j<=m;j++) { dp[j]+=dp[j-a]; } } printf("%lld\n",dp[m]); return 0; }
相关文章推荐
- USACO Money Systems Dp 01背包
- USACO / Money Systems货币系统(DP)
- usaco Money Systems
- usaco Money Systems
- [bzoj1708][Usaco2007 Oct]Money奶牛的硬币_动态规划_背包dp
- USACO--2.3Money Systems+dp
- usaco Money Systems
- Money Systems chapter 2.3 dp
- BZOJ 1708: [Usaco2007 Oct]Money奶牛的硬币( dp )
- Money Systems_usaco2.3.4_dp
- bzoj1708[Usaco2007 Oct]Money奶牛的硬币(背包方案数dp)
- usaco: Money Systems
- [USACO 2.3.4]货币系统【DP完全背包的简单应用】CSUST 1081
- USACO2.3.4 Money Systems (money)
- [USACO 2.3.4]货币系统【DP完全背包的简单应用】CSUST 1081
- 【bzoj1708】[USACO2007 Oct]Money奶牛的硬币 背包dp
- USACO2.3.4 Money Systems (money)
- USACO money packageDP
- [Usaco2008 Oct]建造栅栏 DP
- BSOJ4217 【USACO 2013 Feburary Gold】旅行线路 DP(双路递推)