UVa 147 Dollars（完全背包）

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = 30000 + 5;
int coin[] = { 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000 };
long long d[maxn];

int main()
{
//freopen("D:\\txt.txt", "r", stdin);
int i, j;
memset(d, 0, sizeof(d));
d[0] = 1;
for (int i = 0; i < 11;i++)
for (int j = coin[i]; j <= maxn; j++)
d[j] += d[j - coin[i]];
double s;
while (cin >> s && s)
{
int n = (int)(100 * s + 0.5);
printf("%6.2lf%17lld\n", s,d
);
}
return 0;
}