Square Coins

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.

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

Sample Output

代码：

#include<stdio.h>

#define max 310int main(){    int coin[17] = {1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289}; //列出所有coin的面值    int n,i,j,k, an[max], bn[max]; //an[]记录结果，bn[]记录中间值    while(scanf("%d", &n) && n)    {        for(i = 0; i <= n; i ++) //赋初值        {            an[i] = 1;            bn[i] = 0;        }        for(j = 1; j < 17; j ++) //从1到289        {            for(i = 0; i <= n; i ++)            {                for(k = 0; k + i <= n; k += coin[j])                    bn[k + i] += an[i];            }            for(i = 0; i <= n; i ++)            {                an[i] = bn[i];                bn[i] = 0;            }        }        printf("%d\n", an[n]);    }    return 0;}

转载于:https://www.cnblogs.com/Mr_Lai/archive/2010/11/24/1886462.html

HDU 1398 Square Coins相关推荐

hdu 1398 Square Coins/hdu 1028 Ignatius and the Princess III
两道母函数的模板题: http://acm.hdu.edu.cn/showproblem.php?pid=1398 View Code #include<iostream>#include ...
HDU 1398 Square Coins
题目大意:有面值分别为.1,4,9,.......17^2的硬币无数多个.问你组成面值为n的钱的方法数. 最简单的母函数模板题: #include <cstdio> #include &l ...
HDOJ 1398 Square Coins
母函数"第一季",无压力AC~ View Code 1 //#include <fstream> 2 #include <iostream> 3 using ...
北邮OJ 2016 网预-Square Coins
时间限制 1000 ms 内存限制 65536 KB 题目描述 Artoria, also known as Saber-chan, was born into a time of chaos and ...
HDU 5985 Lucky Coins 数学
Lucky Coins 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5985 Description Bob has collected a lot ...
hdu 5079 Square
http://acm.hdu.edu.cn/showproblem.php?pid=5079 题意: n*n网格,每个格子可以涂黑色或白色,有的格子必须涂黑色问最大白色正方形边长分别为0,1,2,- ...
hdu 5903 Square Distance
这题题解dp不懂因为不知道它怎么记录dp的答案的字符串那么长我是贪心过得,当时还被四个人hack,都没成功,hhhhh 大意就是优先从头取字典序小的字母,担也要让后面不管怎么取都合法 #incl ...
HDU 1518 Square
dfs+剪枝. AC代码例如以下: ///dfs+剪枝 62MS 300K#include<iostream> #include<cstring> #include<al ...
杭电OJ分类题目（1）
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(1) HDU Introduction HDU ...

HDU 1398 Square Coins

Square Coins

HDU 1398 Square Coins相关推荐

最新文章

热门文章