bzoj2287：[POJ Challenge]消失之物

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define maxn 2005
 
int n,m;
int f[maxn],w[maxn],ans[maxn];
 
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++) scanf("%d",&w[i]);f[0]=1;
    for (int i=1;i<=n;i++)
        for (int j=m;j>=w[i];j--)
            f[j]+=f[j-w[i]],f[j]%=10;
    for (int i=1;i<=n;i++){
        memset(ans,0,sizeof(ans)),ans[0]=1;
        for (int j=1;j<=m;j++){
            if (j>=w[i]) ans[j]=((f[j]-ans[j-w[i]])%10+10)%10;
            else ans[j]=f[j];
            printf("%d",ans[j]);
        }
        puts("");
    }
    return 0;
}