Submission #5789500

---

Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define _USE_MATH_DEFINES
#define mp       make_pair
#define pb       push_back
#define fst      first
#define snd      second
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};


int main()
{
    int N; cin >> N;
    bool points[10001] = {false};
    points[0] = true;
    int M = 0;
    int p;
    while(N--) {
        cin >> p;
        for(int i = M; i >= 0; i--) {
            if(points[i]) {
                points[i+p] = true;
                M = max(i+p, M);
            }
        }
    }

    int ans = 0;
    for(int i = 0; i <= M; i++) {
        if(points[i])
            ans++;
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result