POJ 1742 Coins 动态规划

#include <iostream>
using namespace std;
int dp[2][100007], n, m, a[107], c[107];
void input()
{
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
    }
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &c[i]);
    }
}
void doDp()
{
    for (int i = 1; i <= n; i++)
    {
        dp[i % 2][0] = c[i];
        for (int j = 1; j <= m; j++)
        {
            if (dp[(i - 1) % 2][j] >= 0)
            {
                dp[i % 2][j] = c[i];
            }
            else if (j >= a[i] && dp[i % 2][j - a[i]] > 0)
            {
                dp[i % 2][j] = dp[i % 2][j - a[i]] - 1;
            }
        }
    }
}
int findAns()
{
    int ans = 0;
    for (int i = 1; i <= m; i++)
    {
        if (dp[n % 2][i] >= 0)
        {
            ans++;
        }
    }
    return ans;
}
void flush()
{
    for (int i = 0; i <= m; i++)
    {
        dp[0][i] = -1;
        dp[1][i] = -1;
    }
}
int main()
{
    while (true)
    {
        scanf("%d%d", &n, &m);
        if (n == 0 && m == 0)
        {
            break;
        }
        flush();
        input();
        doDp();
        printf("%d\n", findAns());
    }
    return 0;
}