Submission #3015679

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <bitset>
#include <functional>
using namespace std;
const constexpr int INF = 1e9;
//typedef std::pair<std::string,double> P;

double N;
string s; 
bool dp[11000];
int points[101];
void solve(){
    for(int i=0; i<N; ++i) cin >> points[i];
    dp[0] = true;
    for(int i=0; i<N; ++i){
        for(int j=10000; j>=0; --j){
            dp[j+points[i]]|=dp[j];
        }
    }
    int cnt=0;
    for(int i=0; i<=10000; ++i){
        if(dp[i]) cnt++;
    }
    cout << cnt << endl;
}
int main() {
    cin >> N;
    solve();
	return 0;
}

Submission Info

Judge Result