HDOJ 1398 Square Coins(母函数—整数拆分模板题)
来源:互联网 发布:遥感数据 分类 建模 编辑:程序博客网 时间:2024/06/04 01:15
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10268 Accepted Submission(s): 7020
Problem Description
People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland.
There are four combinations of coins to pay ten credits:
ten 1-credit coins,
one 4-credit coin and six 1-credit coins,
two 4-credit coins and two 1-credit coins, and
one 9-credit coin and one 1-credit coin.
Your mission is to count the number of ways to pay a given amount using coins of Silverland.
There are four combinations of coins to pay ten credits:
ten 1-credit coins,
one 4-credit coin and six 1-credit coins,
two 4-credit coins and two 1-credit coins, and
one 9-credit coin and one 1-credit coin.
Your mission is to count the number of ways to pay a given amount using coins of Silverland.
Input
The input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300.
Output
For each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output.
Sample Input
210300
Sample Output
1427
题意:在一个国度,他们的钱币面值都是平方数,钱币为1, 4, 9,.......289(17^2),给出任意价格,求出该价格在该国度的拆分数。
题解:很明显可以得到乘法式:(1*x*x^2*x^3*.....) * (1*x^4*x^8*x^12*...) * (1*x^9*x^18*x^27*....) * .......
将此乘法式合并得到多项式,指数为n的项的系数就是n的拆分数。
代码如下:
#include<cstdio>#include<cstring>int c1[320],c2[320];int main(){int n,i,j,k;while(scanf("%d",&n)&&n){for(i=0;i<=n;++i){c1[i]=1; c2[i]=0;}for(i=2;i<=17;++i){for(j=0;j<=n;++j){for(k=0;k+j<=n;k+=i*i)//修改模板的k+=i为K+=i*i即可 c2[k+j]+=c1[j];}for(j=0;j<=n;++j){c1[j]=c2[j];c2[j]=0;}}printf("%d\n",c1[n]);}return 0;}
0 0
- HDOJ 1398 Square Coins(母函数—整数拆分模板题)
- HDU 1398 Square Coins (母函数-整数拆分变形)
- HDU/HDOJ 1398 Square Coins 母函数
- hdoj 1398 Square Coins(母函数)
- 母函数之Square Coins hdoj 1398
- HDOJ Square Coins 1398【母函数】
- hdoj--1398--Square Coins(母函数)
- hdoj 1398 Square Coins【母函数】
- HDOJ-1398 Square Coins(母函数)
- HDOJ--1398Square Coins!!母函数
- Square Coins---母函数模板题
- HDU 1398 Square Coins(母函数模板题)
- HDOJ 1028 Ignatius and the Princess III(母函数—整数拆分模板题)
- HDOJ 题目1398Square Coins(母函数)
- hdoj 1398 Square Coins <递归+状态记录优化----母函数????>
- hdoj 1398 Square Coins
- hdoj 1398 Square Coins
- HDOJ 1398 Square Coins
- 数据结构基础(16) --树与二叉树
- 手把手教你用CAB发布OCX的简单办法
- java project 使用ant工具打包
- 为什么Facebook要将视频从Flash全面迁移到HTML5?
- 移动web ios
- HDOJ 1398 Square Coins(母函数—整数拆分模板题)
- java并发编程:线程池的使用
- LODOP横向打印预览正向显示
- 隐藏手机中预置的所有APP及显示需要的APP
- Matlab的一些零碎方法
- Android ble 蓝牙4.0 总结
- Android ActionBar完全解析,使用官方推荐的最佳导航栏(上)
- React Native布局实践:开发京东客户端首页(四)——首页功能按钮及控件封装
- 数据结构基础(17) --二叉查找树的设计与实现