| Submit | All submissions | Best solutions | Back to list |
EIMONE - Money change |
After buying gifts, Beo suddenly realized that he had received too many small denomination notes. Beo wants to exchange the amount of money he has for as few notes as possible. In the store, there are denominations of 20 dong, 10 dong, 5 dong and 1 dong. Please help Beo exchange b dong in the store. Because it is a large store, the number of banknotes is temporarily unlimited.
Input
A single line contains the number b(0 ≤ b ≤ 10^6)
Output
Consists of several lines, each with the following format:
X Y
Where X is the denomination and Y is the number of bannotes of the denomination X.
Note: Output in order of decreasing denomination. If the number of banknotes of any denomination is zero, don't output that denomination.
Note: Output in order of decreasing denomination. If the number of banknotes of any denomination is zero, don't output that denomination.
Example
Input:
72
Output:
20 3
10 1
1 2
| Added by: | Ha Minh Ngoc |
| Date: | 2015-01-14 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG FSHARP GO JAVA JS-MONKEY NODEJS PHP PYTHON PYPY PYTHON3 RUBY SQLITE SWIFT VB.NET |
RSS