【JOJ】1424【母函数】【Coin Change】

转载 2013年12月03日 11:13:11
原文地址:JOJ 1424: Coin Change作者:又岸

1424:Coin Change


Result TIME Limit MEMORY Limit Run Times AC Times JUDGE
[转载]JOJ <wbr>1424: <wbr>Coin <wbr>Change 3s 8192K 563 181 Standard

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent,5-cent, and 1-cent. We want to make changes with these coins for agiven amount of money.

 


For example, if we have 11 cents, then we can make changes with one10-cent coin and one 1-cent coin, two 5-cent coins and one 1-centcoin, one 5-cent coin and six 1-cent coins, or eleven 1-cent coins.So there are four ways of making changes for 11 cents with theabove coins. Note that we count that there is one way of makingchange for zero cent.

 


Write a program to find the total number of different ways ofmaking changes for any amount of money in cents. Your programshould be able to handle up to 7489 cents.

Input

The input file contains any number of lines, each one consisting ofa number for the amount of money in cents.

Output

For each input line, output a line containing the number ofdifferent ways of making changes with the above 5 types of coins.

Sample Input

11

26

Sample Output

4
13

#include<stdio.h>
#include<string.h>


int c[5]={50,25,10,5,1};
int v;
unsigned long f[8000];


int main()
{
    memset(f,0,sizeof(f));
    f[0]=1;
    for(int i=0;i<5;i++)
    for(int j=c[i];j<=7500;j++)
    {
        f[j]+=f[j-c[i]];//重要
    }
    while(scanf("%d",&v)==1)
    {
        printf("%dn",f[v]);
    }
    return 0;
}


相关文章推荐

hdu2069Coin Change-母函数

hdu2069 错解 //忽略了所有硬币总数小于100的限制,导致方案数偏大 #include using namespace std; int main() { int ...

UVA674Coin Change母函数模板题目

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make c...

hdu 2069 Coin Change 背包。本来打算用母函数再写一遍的,发现代码极其相似,就没写

Problem Description Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cen...

hdoj 2069 Coin Change(母函数)

【题目大意】:有1,5,10,25,50五种硬币,和一个价值n,问由总数不超过100的五种硬币有多少种方式可以组成价值n 【解题思路】:母函数,总数有了限制,就加多了一维,每一次转的时候,判...

uva 674 && hdu 2069 coin change(动态规划、母函数)

题目地址:点击打开链接 dp[i][j]表示前i种硬币组成j元的方案数。 状态转移方程:dp[i][j] = ∑(dp[i-1][j-k*v[i]]). 递推递归都可以写。 也可以用母函数写,注意...

(简单母函数进阶版,暴力)hdu 2069 Coin Change

Coin Change Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

【母函数】HDU-2069 Coin Change

Coin Change Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

【母函数】hdu2069(Coin Change)母函数加深

hdu2069 思路:组合问题,可以考虑用母函数,但是这里考虑组合的个数和组合的最大数。硬币的个数不超过100;而且硬币的 总值不大于250。要同时兼顾这些问题,同一总值,可以由不同个数的硬币组成,即...

joj 1424 硬币兑换问题

  • 2009-08-30 23:08
  • 593B
  • 下载

coin_change_problem

  • 2008-09-07 23:29
  • 82KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)