C++ 解法, 执行用时: 3ms, 内存消耗: 504KB, 提交时间: 2020-07-28

#include <bits/stdc++.h>
using namespace std;
int p[205];
bitset<100001> dp(0);
int main()
{
    int n, m;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", p + i);
    scanf("%d", &m);
    dp[0] = 1;
    for (int i = 0; i < n; i++)
        dp |= dp << p[i];
    cout << dp[m] << endl;
    return 0;
}

C++ 解法, 执行用时: 4ms, 内存消耗: 480KB, 提交时间: 2020-08-18

#include <bits/stdc++.h>
using namespace std;
    
int p[205];
bitset<100001> dp(0);
    
int main()
{
    int n, m;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", p + i);
    scanf("%d", &m);
    dp[0] = 1;
    for (int i = 0; i < n; i++)
        dp |= dp << p[i];
    cout << dp[m] << endl;
    return 0;
}