| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 88 | 63 | 50 | 79.365% |
You are going to purchase a bus card. It's a refillable card that cash can be deposited into, and then used to ride the bus until you are out of money. You know that you're planning to travel for $K$ Swedish crowns (SEK). Charging the card takes some time since you can only charge it with 100ドル,ドル 200ドル$ or 500ドル$ SEK at a time.
At the moment you are in a hurry, so you want to make as few transactions as possible, but never insert more money than necessary. If you are to travel for 800ドル$ SEK, this means you should load it with 500ドル,ドル then 200ドル,ドル and then 100ドル$ SEK. On the other hand, if you are traveling for 850ドル$ SEK you should load it first with 500ドル,ドル and then 200ドル$ SEK twice. 50ドル$ SEK will be wasted, but it's still the best alternative.
Compute the minimum number of transactions necessary.
The input consists of the integer $K$ (1ドル \le K \le 10,000円$), the amount you will travel for.
Output a single integer -- the number of transactions necessary.
850
3
1800
5
Olympiad > Swedish Olympiad in Informatics > 2010 > Qualification A번