A. Hit the Lottery
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Allen has a LOT of money. He has nn 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 11, 55, 1010, 2020, 100100. 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 nn (1≤n≤1091≤n≤109).
Output
Output the minimum number of bills that Allen could receive.
Examples
input
Copy
125
output
Copy
3
input
Copy
43
output
Copy
5
input
Copy
1000000000
output
Copy
10000000
Note
In the first sample case, Allen can withdraw this with a 100100 dollar bill, a 2020 dollar bill, and a 55 dollar bill. There is no way for Allen to receive 125125 dollars in one or two bills.
In the second sample case, Allen can withdraw two 2020 dollar bills and three 11 dollar bills.
In the third sample case, Allen can withdraw 100000000100000000 (ten million!) 100100 dollar bills.
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int money;
int number=0;
cin>>money;
if(money>=100)
{
int n=money/100;
number+=n;
money-=n*100;
/*for(int i=0; i<n; i++)
{
cout<<"100"<<endl;
}*/
}
if(money>=20)
{
int n=money/20;
number+=n;
money-=n*20;
/*for(int i=0; i<n; i++)
{
cout<<"20"<<endl;
}*/
}
if(money>=10)
{
int n=money/10;
number+=n;
money-=n*10;
/*for(int i=0; i<n; i++)
{
cout<<"10"<<endl;
}*/
}
if(money>=5)
{
int n=money/5;
number+=n;
money-=n*5;
/*for(int i=0; i<n; i++)
{
cout<<"5"<<endl;
}*/
}
/*for(int i=0; i<money; i++)
{
cout<<"1"<<endl;
}*/
number+=money;
cout<<number;
return 0;
}