TIOJ 1043 F.名偵探蚵男

#include <cstdio>
#include <cstdlib>
#include <string.h>
#define INT64 long long
using namespace std;

INT64 dp[100005];

int main(){
    int n, p, t;
    scanf("%d %d", &n, &p);

    while(n > 0 && p > 0){
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;
        
        for (int i = 0; i < n; ++i){
            scanf("%d", &t);
            for (int j = 1; j <= p; ++j)
                if(j - t >= 0)
                    dp[j] += dp[j - t];
        }
        printf("%lld\n", dp[p]);
        scanf("%d %d", &n, &p);
    }
}