UVA 147 Dollars 完全背包 Commencel

数组开小了RE了几次

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
LL dp[8010];
int coin[]={1,2,4,10,20,40,100,200,400,1000,2000};
int main()
{
    //freopen("sample.txt","r",stdin);
    int cost;dp[0]=1;
    for (int i=0;i<11;i++)
        for (int j=0;j<6010;j++)
    {
        dp[j+coin[i]]+=dp[j];//这里最开始DP数组开成6000+，RE了
    }
    int a,b;
    while (scanf("%d.%d",&a,&b)!=EOF)
    {
        cost=a*20+b/5;
        if (cost==0) break;
        if (b>=10) printf("%3d.%d",a,b);
        else printf("%3d.0%d",a,b);
        printf("%17lld\n",dp[cost]);
    }
    return 0;
}