3348：coins

题目描述

"Yakexi, this is the best age!" Dong MW works hard and get high pay, he has many 1 Jiao and 5 Jiao banknotes(纸币), some day he went to a bank and changes part of his money into 1 Yuan, 5 Yuan, 10 Yuan.(1 Yuan = 10 Jiao)
"Thanks to the best age, I can buy many things!" Now Dong MW has a book to buy, it costs P Jiao. He wonders how many banknotes at least,and how many banknotes at most he can use to buy this nice book. Dong MW is a bit strange, he doesn't like to get the change, that is, he will give the bookseller exactly P Jiao.

输入解释

T(T<=100) in the first line, indicating the case number.
T lines with 6 integers each:
P a1 a5 a10 a50 a100
ai means number of i-Jiao banknotes.
All integers are smaller than 1000000.

输出解释

Two integers A,B for each case, A is the fewest number of banknotes to buy the book exactly, and B is the largest number to buy exactly.If Dong MW can't buy the book with no change, output "-1 -1".

输入样例

3
33 6 6 6 6 6
10 10 10 10 10 10
11 0 1 20 20 20

输出样例

6 9
1 10
-1 -1

来自杭电HDUOJ的附加信息

Author	madfrog
Recommend	lcy

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 HDU2010省赛集训队选拔赛（校内赛）

源链接： HDU-3348

最后修改于 2020-10-25T23:02:35+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)