UVa 147 - Dollars Solution

#include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>

using namespace std;

#define INF (1<<29)
#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define FILL(a,v) memset(a,v,sizeof(a))
#define PB push_back
#define FOR(i,n) for(int i = 0;i<n;i++)
#define PI acos(-1.0)
#define EPS 1e-9
#define MP(a,b) make_pair(a,b)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long
#define MX 100000
#define MOD 1000000007


LL ways [7500];
void count ()
{
    int coin [] = { 2000, 1000, 400, 200, 100 , 40, 20, 10, 4, 2 ,1 };
    ways [0] = 1;
    for ( int i = 0; i < 11; i++ )
        for ( int j = coin [i]; j < 7500; j++ )
            ways [j] += ways [j - coin [i]];
}

main ()
{
    count ();
    LL n;
    double d;
    while ( cin>>d )
    {
        n=d*20;
        if(n==0)
        break;
        //cout<<setprecision(6)<<d<<endl;
        printf("%6.2lf%17lld\n",d,ways[n]);
    }
}