HDU 2069 JAVA
来源:互联网 发布:查潮汐软件下载 编辑:程序博客网 时间:2024/05/21 22:40
Problem Description
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, or two 5-cent coins and one 1-cent coin, or 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 100 coins.
Input
The input file contains any number of lines, each one consisting of a number ( ≤250 ) 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
不会母函数的忧伤
import java.util.Scanner;class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); final int a[] = {50,25,10,5,1}; while(sc.hasNext()){ int n = sc.nextInt(); int num=0; for(int i=0;i*a[0]<=n;i++){ int sum1 = a[0]*i; for(int j=0;j*a[1]+sum1<=n;j++){ int sum2= sum1+j*a[1]; for(int k=0;k*a[2]+sum2<=n;k++){ int sum3 = sum2+k*a[2]; for(int b=0;b*a[3]+sum3<=n;b++){ int sum4=sum3 + b*a[3]; for(int c=0;c*a[4]+sum4<=n;c++){ int sum5=sum4 + c*a[4]; if(sum5==n){ if(i+j+k+b+c<=100) num++; break; } } } } } } System.out.println(num); } }}
- HDU 2069 JAVA
- hdu acm hdu 2115 Java
- Exponentiation hdu 1063 java
- hdu 1313 (Java)
- 【Java】hdu 4043
- hdu 1242 Rescue<java>
- HDU 1002 JAVA
- hdu 2092(java)
- hdu 1063 java 高精度
- hdu 1106(java)
- hdu 1073(java)
- HDU-4762 Java高精度
- hdu 1002 java
- hdu 1089 java
- JAVA hdu 2192 MagicBuilding
- hdu 1001 java
- hdu 1002 java
- hdu 1003 java
- oracle在win10上安装教程
- error C2065: “dllexport”: 未声明的标识符
- css绝对定位和相对定位的区别
- sdutoj 3062 蝴蝶效应 (记忆化搜索/递推)
- sdutacm-人活着系列之寻找最完美的人生
- HDU 2069 JAVA
- leetcode_middle_63_116. Populating Next Right Pointers in Each Node
- sendRedirect()重定向和forward()转发的比较
- 浅谈Eclipse dropins插件安装的"坑"
- 【开源.NET】轻量级内容管理框架Grissom.CMS(第三篇解析配置文件和数据以转换成 sql)
- 动态规划之矩阵链乘法
- Ehcache整合spring配置
- BIT2013年上机第二题
- android五大基本存储方式