AtCoder Beginner Contest 160
翻译中…
Problem Statement
翻译中…
Takahashi loves gold coins. He gains $1000$ happiness points for each $500$-yen coin he has and gains $5$ happiness points for each $5$-yen coin he has. (Yen is the currency of Japan.)
翻译中…
Takahashi has $X$ yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?
翻译中…
(We assume that there are six kinds of coins available: $500$-yen, $100$-yen, $50$-yen, $10$-yen, $5$-yen, and $1$-yen coins.)
翻译中…
Constraints
翻译中…
$0 \leq X \leq 10^9$$X$is an integer.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
X
翻译中…
Output
翻译中…
Print the maximum number of happiness points that can be earned.
翻译中…
样例
Input #1
1024
Output #1
2020
By exchanging his money so that he gets two $500$-yen coins and four $5$-yen coins, he gains $2020$ happiness points, which is the maximum number of happiness points that can be earned.
Input #2
0
Output #2
0
He is penniless - or yenless.
Input #3
1000000000
Output #3
2000000000
He is a billionaire - in yen.
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。