bzoj 2287: 【POJ Challenge】消失之物 动态规划

Code:

#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<vector>
#include<string>
using namespace std;
void setIO(string a){ freopen((a+".in").c_str(),"r",stdin),freopen((a+".out").c_str(),"w",stdout); }
void shutIO(){ fclose(stdin),fclose(stdout); }
#define maxn 2005
#define mod 10
int v[maxn],ans[maxn], c[maxn][maxn];
int n,m;
int main(){
    //setIO("input");
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)scanf("%d",&v[i]);
    ans[0]=1;
    for(int i=1;i<=n;++i){
        for(int j=m;j>=v[i];--j) ans[j]+=ans[j-v[i]],ans[j]%=mod;
    }
    for(int i=1;i<=n;++i){
        c[i][0]=1;
        for(int j=1;j<=m;++j){                                    
            if(j>=v[i]) c[i][j]=(ans[j]-c[i][j-v[i]]+mod)%mod;
            else c[i][j]=ans[j];
            printf("%d",c[i][j]);
        }
        printf("\n");
    }
    shutIO();
    return 0;
}