首页 > 代码库 > *HDU 1398 母函数
*HDU 1398 母函数
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11529 Accepted Submission(s): 7897
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
2
10
30
0
Sample Output
1
4
27
Source
Asia 1999, Kyoto (Japan)
题意:
有17种硬币面值为1,4,9,16.......17^2,给出一个值问有多少种组成方法。
有17种硬币面值为1,4,9,16.......17^2,给出一个值问有多少种组成方法。
代码:
1 //模板 2 #include<bits\stdc++.h> 3 using namespace std; 4 int c1[302],c2[302]; 5 void init() 6 { 7 for(int i=0;i<=300;i++) 8 { 9 c1[i]=1; 10 c2[i]=0; 11 } 12 for(int i=2;i*i<=289;i++) 13 { 14 for(int j=0;j<=300;j++) 15 for(int k=0;j+k<=300;k+=i*i) 16 c2[j+k]+=c1[j]; 17 for(int j=0;j<=300;j++) 18 { 19 c1[j]=c2[j]; 20 c2[j]=0; 21 } 22 } 23 } 24 int main() 25 { 26 int n; 27 init(); 28 while(scanf("%d",&n)&&n) 29 { 30 printf("%d\n",c1[n]); 31 } 32 return 0; 33 }
*HDU 1398 母函数
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。