1. Erste Version: C,  Evgeni Pavlidis


/**
* ACM programming Contest WS 08/09
* UVa Status: accepted
* Run Time: 0.020
* @author Evgeni Pavlidis evgenipavlidis@yahoo.de
*/
#include <stdio.h>
#include <math.h>

#define MAX 6000
#define COINS 11

int coins[] = {2000, 1000, 400, 200, 100, 40, 20, 10, 4, 2, 1};

long long nway[MAX+1];

int n = MAX,i,j,c;
float d;

int main()
{
nway[0] = 1;

for(i=0; i < COINS; i++)
{
c = coins[i];
for(j=c; j <= n; j++)
nway[j] += nway[j-c];
}
nway[0] = 0;

while(1)
{
scanf("%f\n", &d);
if(d < 0.0001)
return 0;
n = (int)(((d * 100) + 0.5)/5);

printf("%6.2f%17lld\n", d, nway[n]);

}
}