国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 編程 > Java > 正文

HDU 2069 JAVA

2019-11-06 07:20:40
字體:
來源:轉載
供稿:網(wǎng)友

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

不會母函數(shù)的憂傷

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); } }}
發(fā)表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發(fā)表
主站蜘蛛池模板: 亳州市| 兴文县| 桐柏县| 建瓯市| 石棉县| 乾安县| 内江市| 马鞍山市| 青神县| 临夏县| 东乡族自治县| 黄梅县| 伊宁县| 澜沧| 镇平县| 二连浩特市| 闽侯县| 永城市| 凤山县| 苍南县| 沙湾县| 灵台县| 台中县| 永川市| 长岛县| 阿鲁科尔沁旗| 久治县| 河间市| 法库县| 普安县| 饶平县| 扎兰屯市| 龙门县| 晋中市| 河南省| 仪陇县| 五大连池市| 遵义市| 岐山县| 晋江市| 班戈县|