URAL 1114 Boxes (dp)
2015-03-25 12:56
288 查看
暴力dp,dp[i][j][k],表示到底i个盒子为止,用了j个红球,k个蓝球的方案数。坑点:会爆longlong,用unsigned longlong即可。
#include<iostream> #include<math.h> #include<stdio.h> #include<algorithm> #include<string.h> #include<string> #include<vector> #include<queue> #include<map> #include<set> using namespace std; #define B(x) (1<<(x)) void cmax(int& a,int b){ if(b>a)a=b; } void cmin(int& a,int b){ if(b<a)a=b; } typedef unsigned long long ll; const int oo=0x3f3f3f3f; const ll OO=1LL<<61; const int MOD=1000007; const int maxn=55; ll dp[22][17][17]; int main(){ //freopen("E:\\read.txt","r",stdin); int n,A,B; while(scanf("%d %d %d",&n,&A,&B)!=EOF){ memset(dp,0,sizeof dp); dp[0][0][0]=1; for(int i=1;i<=n;i++){ for(int j=0;j<=A;j++){ for(int k=0;k<=B;k++){ for(int jj=0;jj<=j;jj++){ for(int kk=0;kk<=k;kk++){ dp[i][j][k]+=dp[i-1][jj][kk]; } } } } } ll ans=0; for(int i=0;i<=A;i++){ for(int j=0;j<=B;j++) ans+=dp [i][j]; } cout<<ans<<endl; } return 0; }
相关文章推荐
- URAL 1114 Boxes(简单dp)
- URAL 1114 Boxes 【dp】
- Ural1114 Boxes【DP】
- ural 1114. Boxes(dp)
- Ural 1114. Boxes 解题报告(组合数计算)
- Ural 1114 Boxes
- ural 1114,计数dp
- HDU 1114 1248(DP,完全背包)
- URAL 1018. Binary Apple Tree(树形DP)
- HDU 1114 Piggy-Bank(dp完全背包)
- Ural 1018 Binary Apple Tree (树形dp)
- ural Binary Lexicographic Sequence (dp + dfs)
- URAL 1577. E-mail(简单二维dp)
- [URAL1057]Amount of Degrees(数位dp)
- ural 1057(数位dp)
- ural 1039 没有上司的晚会 树形dp
- ural 1057. Amount of Degrees(数位DP,4级)
- ural 1012. K-based Numbers. Version 2(大数dp)
- Ural 1353 Milliard Vasya's Function(DP)
- 【URAL 1223】Chernobyl’ Eagle on a Roof(传说中的DP神优化之鹰蛋)