codeforces 996A Hit the Lottery

最新推荐文章于 2022-02-27 22:47:56 发布

elijahqi

最新推荐文章于 2022-02-27 22:47:56 发布

阅读量474

点赞数

CC 4.0 BY-SA版权

分类专栏：贪心

本文链接：https://blog.youkuaiyun.com/elijahqi/article/details/80806823

贪心专栏收录该内容

81 篇文章

订阅专栏

本文探讨了如何通过算法计算出从银行账户中取出特定金额所需的最少纸币数量。使用了从1美元到100美元不同面额的纸币，并提供了一个具体的实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://www.elijahqi.win/archives/3871
Allen has a LOT of money. He has
n
dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are
1
,
5
,
10
,
20
,
100
. What is the minimum number of bills Allen could receive after withdrawing his entire balance?

Input
The first and only line of input contains a single integer
n
(
1
≤
n
≤
10
9
).

Output
Output the minimum number of bills that Allen could receive.

Examples
inputCopy
125
outputCopy
3
inputCopy
43
outputCopy
5
inputCopy
1000000000
outputCopy
10000000
Note
In the first sample case, Allen can withdraw this with a
100
dollar bill, a
20
dollar bill, and a
5
dollar bill. There is no way for Allen to receive
125
dollars in one or two bills.

In the second sample case, Allen can withdraw two
20
dollar bills and three
1
dollar bills.

In the third sample case, Allen can withdraw
100000000
(ten million!)
100
dollar bills.

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
    freopen("a.in","r",stdin);
    scanf("%d",&n);int cnt=0;
    if (n>=100) cnt+=n/100,n=n-n/100*100;
    if (n>=20) cnt+=n/20,n=n-n/20*20;
    if (n>=10) cnt+=n/10,n=n-n/10*10;
    if (n>=5) cnt+=n/5,n=n-n/5*5;
    if (n>=1) cnt+=n/1;printf("%d\n",cnt);
    return 0;
}