http://acm.hdu.edu.cn/showproblem.php?pid=1398
题意:有价值为1^2,2^2....7^2的硬币共17种,每种硬币都有无限个。问用这些硬币能够组成价值为n的钱数共有几种方案数。
母函数:
#include
#include
#include
#include
#include
#include
#include
#i...
分类:
其他好文 时间:
2014-07-28 00:03:19
阅读次数:
219
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7995 Accepted Submission(s): 5416
Problem Description
People in Sil...
分类:
其他好文 时间:
2014-07-26 02:18:26
阅读次数:
183
Square Coins Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u ...
分类:
其他好文 时间:
2014-07-26 01:11:36
阅读次数:
273
The Fewest CoinsDescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a ...
分类:
其他好文 时间:
2014-07-24 17:11:36
阅读次数:
326
多重背包转换成完全背包和01背包
详情看
HDU 2844 Coins (动规)...
分类:
其他好文 时间:
2014-07-21 23:29:23
阅读次数:
251
HDU 2844 Coins (动规)
多重背包+二分优化。...
分类:
其他好文 时间:
2014-07-21 23:29:02
阅读次数:
205
Problem Description
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in...
分类:
其他好文 时间:
2014-07-20 23:01:28
阅读次数:
271
题意:有n种面值的硬币a[i],每种硬币有c[i]个,问能组成不大于m面值(1~m)的个数。
多重背包模板:by背包九讲。
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#d...
分类:
其他好文 时间:
2014-07-17 20:16:48
阅读次数:
233
H - Gold Coins(2.4.1)
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
The king pays his loyal knight in gold coins. On the first ...
分类:
其他好文 时间:
2014-07-15 13:14:28
阅读次数:
275
Gold Coins
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 20913
Accepted: 13098
Description
The king pays his loyal knight in gold coins. On the first day o...
分类:
其他好文 时间:
2014-07-13 20:45:45
阅读次数:
205