zoukankan      html  css  js  c++  java
  • UVA 674 Coin Change

    Coin Change

    Time Limit: 3000ms
    Memory Limit: 131072KB
    This problem will be judged on UVA. Original ID: 674
    64-bit integer IO format: %lld      Java class name: Main

    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 a given amount of money.


    For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, two 5-cent coins and one 1-cent coin, 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 the above coins. Note that we count that there is one way of making change for zero cent.


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

    Input 

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

    Output 

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

    Sample Input 

    11
    26
    

    Sample Output 

    4
    13
    

     解题:背包计数

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 8000;
     4 int n,dp[maxn],cent[] = {1,5,10,25,50};
     5 int main(){
     6     while(~scanf("%d",&n)){
     7         memset(dp,0,sizeof dp);
     8         dp[0] = 1;
     9         for(int i = 0; i < 5; ++i)
    10             for(int j = cent[i]; j <= n; ++j)
    11                 dp[j] += dp[j-cent[i]];
    12         printf("%d
    ",dp[n]);
    13     }
    14     return 0;
    15 }
    View Code
  • 相关阅读:
    JSP语法学习笔记
    jsp 自定义标签
    java排序算法
    Linux系统rootpassword改动
    人生中第一次面试——北漂18年(1)
    msgsnd的一个小问题
    推荐系统中的矩阵分解演变方式
    FZU 2124 FOJ 2124 吃豆人【BFS】
    啦啦啦啦、新人学习中。。
    【Linux】线程并发拷贝程序
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4420932.html
Copyright © 2011-2022 走看看