Submission #2012284

---

Source Code Expand

#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <numeric>
#include <assert.h>
#include <bitset>
#include <list>

using namespace std;

std::bitset<10001> po;

int main()
{

	int N, p[100];
	cin >> N;
	for (int i = 0; i<N; i++)cin >> p[i];

	po[0] = true;
	for (int i = 0; i<N; i++)
	{
		po |= (po << p[i]);
	}

	cout << po.count() << endl;

	return 0;
}

#endif

Submission Info

Judge Result