Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

#include <iostream>
#include <algorithm>
using namespace std;
const int base = 1000000007;

int n,S,f[10100],a[1010];

int main()
{
    cin >> n >> S;
    for (int i=1;i<=n;i++) cin >> a[i];

    f[0]=1;
    for (int i=1;i<=n;i++)
        for (int j=S;j>=a[i];j--)
        {
            f[j]+=f[j-a[i]];
            if (f[j]>=base) f[j]-=base;
        }

    f[0]=1;
    for (int i=1;i<=n;i++)
    {
        int ans=0;
        for (int j=1;S-a[i]*j>=0;j++)
        {
            ans+=f[S-a[i]*j]*(j&1?1:-1);
            if (ans<0) ans+=base;
            if (ans>=base) ans-=base;
        }
        cout << ans << ' ';
    }
}

Code mẫu của ladpro98

program LGAME;
uses    math;
const   fi='';
        maxn=1009;
        maxS=10009;
        base=trunc(1e9)+7;
var     f,left,right:array[0..maxS,0..maxn] of longint;
        res:array[0..maxn] of int64;
        a:array[0..maxn] of longint;
        n,s,i,j:longint;
        inp:text;
begin
        assign(inp,fi);reset(inp);
        readln(inp,n,s);
        for i:=1 to n do read(inp,a[i]);
        for i:=0 to n+1 do f[0,i]:=1;
        for i:=1 to s do
        for j:=1 to n do begin
                if i>=a[j] then begin
                        f[i,j]:=f[i-a[j],j-1];
                        left[i,j]:=f[i,j];
                end;
                f[i,j]:=(f[i,j]+f[i,j-1]) mod base;
        end;
        for i:=1 to s do
        for j:=n downto 1 do begin
                f[i,j]:=0;
                if i>=a[j] then begin
                        f[i,j]:=f[i-a[j],j+1];
                        right[i,j]:=f[i,j];
                end;
                f[i,j]:=(f[i,j]+f[i,j+1]) mod base;
        end;
        for i:=1 to s do
        for j:=1 to n do
        if (s>=i-a[j]) and (i>=a[j]) then
        res[j]:=(res[j]+int64(left[i,j])*right[s-i+a[j],j]) mod base;
        for i:=1 to n do write(res[i],' ');
end.

Code mẫu của RR

#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#define DEBUG(x) cout << #x << " = "; cout << x << endl;
#define PR(a,n) cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl;
#define PR0(a,n) cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl;
using namespace std;

//Buffer reading
int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (REACHEOF) return 0;\
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        if (inpzzz != BUFSIZE) REACHEOF = true;\
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

const long double PI = acos((long double) -1.0);
const long long MOD = 1000000007;

int f[1011][10111], g[1011][10111];
int n, S, a[1011];

int main() {
    bool first = true;
    while (scanf("%d%d", &n, &S) == 2) {
        FOR(i,1,n) scanf("%d", &a[i]);

        if (!first) {
            memset(f, 0, sizeof f);
            memset(g, 0, sizeof g);
        } else first = false;

        f[0][0] = 1;
        FOR(i,0,n-1)
        FOR(s,0,S)
        if (f[i][s]) {
            f[i+1][s] = (f[i+1][s] + f[i][s]) % MOD;
            if (s+a[i+1] <= S)
                f[i+1][s+a[i+1]] = (f[i+1][s+a[i+1]] + f[i][s]) % MOD;
        }

        g[n+1][0] = 1;
        FORD(i,n+1,2)
        FOR(s,0,S)
        if (g[i][s]) {
            g[i-1][s] = (g[i-1][s] + g[i][s]) % MOD;
            if (s+a[i-1] <= S)
                g[i-1][s+a[i-1]] = (g[i-1][s+a[i-1]] + g[i][s]) % MOD;
        }

        FOR(i,1,n) {
            long long res = 0;
            int need = S - a[i];

            FOR(s,0,need)
                res = (res + f[i-1][s] * (long long) g[i+1][need-s]) % MOD;

            printf("%lld ", res);
        }
        puts("");
    }
    return 0;
}

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) {
    stringstream ss;
    if (p >= 0)
        ss << fixed << setprecision(p);
    ss << a;
    T r;
    ss >> r;
    return r;
}
template<class T> T gcd(T a, T b) {
    T r;
    while (b != 0) {
        r = a % b;
        a = b;
        b = r;
    }
    return a;
}
template<class T> T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}
template<class T> T sqr(T x) {
    return x * x;
}
template<class T> T cube(T x) {
    return x * x * x;
}
template<class T> int getbit(T s, int i) {
    return (s >> i) & 1;
}
template<class T> T onbit(T s, int i) {
    return s | (T(1) << i);
}
template<class T> T offbit(T s, int i) {
    return s & (~(T(1) << i));
}
template<class T> int cntbit(T s) {
    return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
    if (rsz <= 0) {
        ptr = 0;
        rsz = (int) fread(bf, 1, bfsz, stdin);
        if (rsz <= 0)
            return EOF;
    }
    --rsz;
    return bf[ptr++];
}
void ga(char &c) {
    c = EOF;
    while (!isalpha(c))
        c = gc();
}
int gs(char s[]) {
    int l = 0;
    char c = gc();
    while (isspace(c))
        c = gc();
    while (c != EOF && !isspace(c)) {
        s[l++] = c;
        c = gc();
    }
    s[l] = '\0';
    return l;
}
template<class T> bool gi(T &v) {
    v = 0;
    char c = gc();
    while (c != EOF && c != '-' && !isdigit(c))
        c = gc();
    if (c == EOF)
        return false;
    bool neg = c == '-';
    if (neg)
        c = gc();
    while (isdigit(c)) {
        v = v * 10 + c - '0';
        c = gc();
    }
    if (neg)
        v = -v;
    return true;
}

typedef pair<int, int> II;
const ld PI = acos(-1.0);
const ld eps = 1e-9;
const int dr[] = { -1, 0, +1, 0};
const int dc[] = { 0, +1, 0, -1};
const int inf = (int) 1e9 + 5;
const ll linf = (ll) 1e16 + 5;
const int mod = (ll) (1e9 + 7 + eps);
#define ok puts("ok")

#define maxn 1105

int n, m, f[maxn * 10], a[maxn];

int main(){
//  freopen("in.txt", "r", stdin);
    scanf("%d %d", &n, &m);
    ms(f, 0); f[0] = 1;
    For(i, 1, n){
        scanf("%d", &a[i]);
        Ford(j, m, 0){
            f[j + a[i]] += f[j];
            if(f[j + a[i]] >= mod) f[j + a[i]] -= mod;
        }
    }


    For(i, 1, n){
        int res = 0, run = 0, T = m - a[i];
        while(T >= 0){
            res = (res + (run == 0 ? f[T] : -f[T])) % mod;
            if(res < 0) res += mod;
            T -= a[i];
            run ^= 1;
        }
        printf("%d ", res);
    }

    return 0;
}

Code mẫu của skyvn97

#include<bits/stdc++.h>
#define MAXN   1010
#define MAXS   10101
#define FOR(i,a,b) for (int i=(a),_b=(b);i<=_b;i=i+1)
#define FORD(i,b,a) for (int i=(b),_a=(a);i>=_a;i=i-1)
#define REP(i,n) for (int i=0,_n=(n);i<_n;i=i+1)
const int mod=(int)1e9+7;
int cntLeft[MAXN][MAXS],cntRight[MAXN][MAXS];
int a[MAXN];
int n,s;
void add(int &x,const int &y) {
    x+=y;
    if (x>=mod) x-=mod;
}
void init(void) {
    scanf("%d%d",&n,&s);
    FOR(i,1,n) scanf("%d",&a[i]);
}
void optimize(void) {
    cntLeft[0][0]=1;
    REP(i,n) REP(j,s+1) if (cntLeft[i][j]>0) {
        add(cntLeft[i+1][j],cntLeft[i][j]);
        if (j+a[i+1]<=s) add(cntLeft[i+1][j+a[i+1]],cntLeft[i][j]);
    }
    cntRight[n+1][0]=1;
    FORD(i,n+1,2) REP(j,s+1) if (cntRight[i][j]>0) {
        add(cntRight[i-1][j],cntRight[i][j]);
        if (j+a[i-1]<=s) add(cntRight[i-1][j+a[i-1]],cntRight[i][j]);
    }
    FOR(i,1,n) {
        int res=0;
        REP(j,s+1-a[i]) add(res,1LL*cntLeft[i-1][j]*cntRight[i+1][s-j-a[i]]%mod);
        if (i>1) printf(" ");
        printf("%d",res);
    }
}
int main(void) {
    init();
    optimize();
    return 0;
}