POJ 3085:Quick Change
来源:互联网 发布:sqlalchemy sql语句 编辑:程序博客网 时间:2024/06/05 03:32
Description
J.P. Flathead’s Grocery Store hires cheap labor to man the checkout stations. The people he hires (usually high school kids) often make mistakes making change for the customers. Flathead, who’s a bit of a tightwad, figures he loses more money from these mistakes than he makes; that is, the employees tend to give more change to the customers than they should get.
Flathead wants you to write a program that calculates the number of quarters ($0.25), dimes ($0.10), nickels ($0.05) and pennies ($0.01) that the customer should get back. Flathead always wants to give the customer’s change in coins if the amount due back is $5.00 or under. He also wants to give the customers back the smallest total number of coins. For example, if the change due back is $1.24, the customer should receive 4 quarters, 2 dimes, 0 nickels, and 4 pennies.
Input
The first line of input contains an integer N which is the number of datasets that follow. Each dataset consists of a single line containing a single integer which is the change due in cents, C, (1 ≤ C ≤ 500).
Output
For each dataset, print out the dataset number, a space, and the string:
Q QUARTER(S),
D DIME(S),
n NICKEL(S),
P PENNY(S)
Where Q is he number of quarters, D is the number of dimes, n is the number of nickels and P is the number of pennies.
Sample Input
312425194
Sample Output
1 4 QUARTER(S), 2 DIME(S), 0 NICKEL(S), 4 PENNY(S)2 1 QUARTER(S), 0 DIME(S), 0 NICKEL(S), 0 PENNY(S)3 7 QUARTER(S), 1 DIME(S), 1 NICKEL(S), 4 PENNY(S)
Source
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include <stdio.h>int main(){ int n,c,q,d,x; int i; scanf("%d", &n); for (i = 1; i <= n; i++) { q = 0, d = 0, x = 0; scanf("%d", &c); q = c / 25; c = c % 25; d = c / 10; c = c % 10; x = c / 5; c = c % 5; printf("%d %d QUARTER(S), %d DIME(S), %d NICKEL(S), %d PENNY(S)\n", i, q, d, x, c); } return 0;}
- poj 3085 Quick Change
- POJ 3085:Quick Change
- POJ 3085 Quick Change (贪心)
- POJ 3085 Quick Change G++
- zoj 2772 Quick Change
- HOJ 2411 Quick Change
- HDU Quick Change
- Quick Change hdu
- zju2772快速找零Quick Change
- hdu ——Quick Change
- zoj 2772 Quick Change(水~)
- ZOJ Problem Set - 2772 Quick Change
- Charlie's Change POJ
- POJ 1787 Charlie's Change
- POJ 1787 Charlie's Change
- poj 1787 Charlie's Change
- poj 1787 Charlie's Change
- POJ 1787 Charlie's Change
- 《笨办法学Python》 第28课手记
- 制作U盘多系统(老毛桃WinPE,Ubuntu,MaxDOS,CDlinux,Parted Magic Linux)引导工具
- opencv(1)
- C++Primer学习之二#define,const,constexpr
- x265-1.8版本-common/picyuv.h注释
- POJ 3085:Quick Change
- 决策树与随机森林的R语言实现
- x265-1.8版本-common/pixel.cpp注释
- MySql避免重复插入记录的几种方法
- 通过画五角星,回顾啦三角函数
- Spark RDD 转化
- Android应该掌握的高级技巧
- POJ 3100:Root of the Problem
- x265-1.8版本-common/predict.h注释