UVA 11137 - Ingenuous Cubrency
2011-12-03 00:15
417 查看
递推,状态转移方程:dp[j] = dp[j - a[i]]; 依题意a[i] = i^3.
#include<stdio.h> #include<string.h> #define MAXD 10005 long long dp[MAXD], a[25]; int N; int main() { for( int i = 1; i <= 21; i ++) a[i] = i * i * i; memset( dp, 0, sizeof dp); dp[0] = 1; for( int i = 1; i <= 21; i ++) for( int j = 0; j <= 10000; j ++) if( j >= a[i]) dp[j] += dp[ j - a[i]]; while( scanf( "%d", &N) == 1) { printf( "%lld\n", dp ); } return 0; }
相关文章推荐
- 【UVA】11137-Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency
- UVA 11137 Ingenuous Cubrency
- 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