UVA - 147 完全背包

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#include<vector>
#include<cstdio>
#define MAXN 33000
#define INF 0x3f3f3f3f
#define lmid l,m,rt<<1
#define rmid m+1,r,rt<<1|1
#define ls rt<<1
#define rs rt<<1|1
#define Mod 1000000007
#define i64 __int64
using namespace std;
int a[15]={10000,5000,2000,1000,500,200,100,50,20,10,5};
long long dp[30005];
int main()
{
     double n;
     while(scanf("%lf",&n)==1)
     {
          if(n==0)
               break;
          int m=(n*100+0.5);//由于精度问题需要加0.5
          //cout<<m<<endl;
          memset(dp,0,sizeof(dp));
          dp[0]=1;
          for(int i=0;i<11;i++)
               for(int j=a[i];j<=m;j++)
                    if(dp[j-a[i]])
                         dp[j]+=dp[j-a[i]];
          printf("%6.2f%17lld\n",n,dp[m]);
     }
}