UVA - 11137 Ingenuous Cubrency
2015-02-25 22:16
375 查看
一开始竟然没看出来是完全背包。。navie!!!!
dp[i]+=dp[i-v];
dp[i]+=dp[i-v];
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int MAX=10010; int s[23]; long long dp[MAX]; int main(){ for(int i=1;i<23;i++) s[i]=i*i*i; dp[0]=1; for(int i=0;i<MAX;i++) dp[i]=1; for(int i=2;i<=21;i++){ for(int j=s[i];j<MAX;j++){ dp[j]+=dp[j-s[i]]; } } int n; while(scanf("%d",&n)!=EOF){ printf("%lld\n",dp ); } return 0; }
相关文章推荐
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推
- UVa 11137 - Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency 背包
- UVA - 11137 Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- UVA_11137_Ingenuous Cubrency
- Ingenuous Cubrency UVA 11137
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推
- UVa 11137 - Ingenuous Cubrency (递推 DP 多重背包 )
- UVA 11137 Ingenuous Cubrency 类似硬币问题的简单dp
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推
- uva 11137 Ingenuous Cubrency
- Ingenuous Cubrency UVA - 11137 题解
- UVA 11137 Ingenuous Cubrency(完全背包)
- Matches UVA - 11375 递推+大数 Ingenuous Cubrency UVA - 11137 递推
- uva 11137 Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency(完全背包)
- UVA - 11137 Ingenuous Cubrency[背包DP]