zoukankan      html  css  js  c++  java
  • 杭电 1398 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
    2 10 30 0
     
    Sample Output
    1 4 27
     
    Source
     
    Recommend
    Ignatius.L
        母函数问题:给定一个数,用1,4,9,16,25.........平方数来表示,每个平方数的数目不限,问有多少种表示方法?
      
     1 #include <stdio.h>
     2 #include <math.h>
     3 #include <string.h>
     4 int main()
     5 {
     6     int paidnum, n, i, j, k, len;
     7     int c1[5500], c2[5500];
     8     while( (scanf( "%d", &paidnum )!= EOF) && paidnum )
     9     {
    10             memset(c1,0,sizeof(c1));
    11             memset(c2,0,sizeof(c2));
    12             n = (int)sqrt(1.0*paidnum);
    13             //printf( "%d %d\n",paidnum, n );
    14             len = paidnum;
    15             for( i = 0; i <= len; i++ )
    16                  c1[i] = 1;
    17             for( i = 2; i <= n; i++  )
    18             {
    19                 for( j = 0; j <=len; j++ )
    20                     for( k = 0; k <= paidnum; k += i*i )
    21                          c2[k+j] += c1[j];
    22                 len = i * paidnum;
    23                 for( j = 0; j <= len; j++)
    24                 {
    25                     c1[j] = c2[j];
    26                     c2[j] = 0;
    27                 }
    28             }
    29             printf( "%d\n",c1[paidnum] );
    30     }
    31     return 0;
    32 }
    View Code
  • 相关阅读:
    RobotFramework+Selenium2+Appium环境搭建
    spring mvc 依赖包
    linux
    清理linux 某个文件夹下面所有的log文件
    selenium grid2 使用远程机器的浏览器
    IntelliJ Idea 快捷键
    aop注解 自定义切面的注解写法
    springmvc多视图配置
    @Autowired(required = false)
    pom.xml配置详解
  • 原文地址:https://www.cnblogs.com/yizhanhaha/p/3087981.html
Copyright © 2011-2022 走看看