UVa 11137 Ingenuous Cubrency (DP)
来源:互联网 发布:windows体验指数5.9 编辑:程序博客网 时间:2024/06/06 02:57
11137 - Ingenuous Cubrency
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2078
People in Cubeland use cubic coins. Not only the unit of currency is called acube but also the coins are shaped like cubes and their values are cubes. Coins with values of all cubic numbers up to 9261 (= 213), i.e., coins with the denominations of 1, 8, 27, ..., up to 9261 cubes, are available in Cubeland.
Your task is to count the number of ways to pay a given amount using cubic coins of Cubeland. For example, there are 3 ways to pay 21 cubes: twenty one 1cube coins, or one 8 cube coin and thirteen 1 cube coins, or two 8 cube coin and five 1 cube coins.
Input consists of lines each containing an integer amount to be paid. You may assume that all the amounts are positive and less than 10000.
For each of the given amounts to be paid output one line containing a single integer representing the number of ways to pay the given amount using the coins available in Cubeland.
Sample input
10 21779999
Output for sample input
2322440022018293
可以化成一维来做:dp[i] += dp[i - a[j]];//不断往更大的数上叠加。
完整代码:
/*0.015s*/#include <cstdio>const int maxn = 10000;long long dp[maxn];int a[22];int main(){int i, j, n;for (i = 1; i <= 21; ++i)a[i] = i * i * i;for (i = 0; i <= maxn; ++i)dp[i] = 1;for (j = 2; j <= 21; ++j)for (i = a[j]; i <= maxn; ++i)dp[i] += dp[i - a[j]];while (~scanf("%d", &n))printf("%lld\n", dp[n]);return 0;}
- UVa 11137 Ingenuous Cubrency (DP)
- Ingenuous Cubrency - UVa 11137 dp
- Uva 11137 Ingenuous Cubrency(DP)
- uva--11137Ingenuous Cubrency ---dp
- UVA 11137 Ingenuous Cubrency(dp + 完全背包)
- UVA - 11137-Ingenuous Cubrency-DP+数学
- uva 11137 Ingenuous Cubrency
- uva - 11137 - Ingenuous Cubrency
- UVA 11137 Ingenuous Cubrency
- 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
- UVa:11137 Ingenuous Cubrency
- UVA - 11137 Ingenuous Cubrency
- 利用phpmyadmin修改mysql的root密码
- 343
- 2013年锦绣中华民俗村迷情聊斋夜
- 浅谈 non-blocking I/O Multiplexing + poll/epoll 的正确使用
- KVC的基础
- UVa 11137 Ingenuous Cubrency (DP)
- ios利用Reachability确认网络环境3G/WIFI
- <The Paradigms of Programming> by Robert W.Floyd, the lecture on Turing award in1979
- 常见的Python 运行错误信息
- 检测字符串的中英文
- org.hibernate.HibernateException: No Hibernate Session bound to thread
- android中检测网络连接状态简单总结
- 让div布局轻松居中的方法
- iOS中使用 Reachability 检测网络