UVa 11137 Ingenuous Cubrency
来源:互联网 发布:淘宝查号 编辑:程序博客网 时间:2024/06/08 02:37
Problem I: Ingenuous Cubrency
People in Cubeland use cubic coins. Not only the unit of currency iscalled acube but also the coins are shaped like cubes andtheir values are cubes. Coins with values of all cubic numbers up to9261 (= 213), i.e., coins with the denominations of 1, 8,27, ..., up to 9261cubes, are available inCubeland.Your task is to count the number of ways to pay a given amountusing cubic coins of Cubeland.For example, there are 3 ways to pay 21cubes:twenty one 1 cube coins, orone 8 cube coin and thirteen 1cube coins, ortwo 8 cube coin and five 1 cube coins.
Input consists of lines each containing an integer amount tobe 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 asingle integer representing the number of ways to pay the given amountusing the coins available in Cubeland.
Sample input
10 21779999
Output for sample input
2322440022018293
题意:
求将 n 写成若干个正整数的立方之和有多少种 种方法。
分析:
完全背包,这里假设将 n 写成若干个正整数的立方之和有d[ n ] 种方法。
状态转移方程:d[ j ] = d[ j ] + d[ j - c[ i ] ] (c[ i ] 为 i 的立方),
要想求得d[ j ],需要从若干个正整数的立方之和为 j + c[ i ] 再加上一个立方和为 c[ i ]
的数转移而来。
代码:
#include <iostream>#include <cstdio>using namespace std;const int MAXI = 21; //22^3 > nconst int MAXN = 10000 + 5;int c[22];long long d[MAXN];int main(){ for(int i = 1; i <= MAXI; i++) c[i] = i * i * i; d[0] = 1; for(int i = 1; i <= MAXI; i++) for(int j = c[i]; j <= MAXN; j++) d[j] += d[j - c[i]]; int n; while(~scanf("%d", &n)) cout << d[n] << endl; return 0;}
- 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
- UVA 11137 - Ingenuous Cubrency
- uva 11137 Ingenuous Cubrency
- UVa 11137 - Ingenuous Cubrency
- 【UVA】11137-Ingenuous Cubrency
- UVA - 11137 Ingenuous Cubrency
- UVA - 11137 Ingenuous Cubrency
- hiho一下 第五十二周(割边 割点)
- Calendar 中getActualMaximumd 功能
- 设计模式读书笔记:Decorator(装饰)
- leetcode 日经贴,Cpp code -Palindrome Linked List
- json格式封装,以及格式转换
- UVa 11137 Ingenuous Cubrency
- 黑马程序员——Java基础---集合
- 新建和配置Phalcon工程
- No unique bean of type is defined: expected single bean but found 0
- 文章标题
- opencv源码之一:cvboost.cpp
- IE 等兼容下的video radio
- Linux下定时任务配置-crontab
- tomcat配置数据源