Submission #1307137

---

Source Code Expand

#include <iostream>
using namespace std;
static const int MAX_N = 100;
 
int main(){
  int n, p, maxp;
  bool point[MAX_N*MAX_N+1] = {0};
  point[0] = true;
  maxp = 0;
  cin >> n;
  for(int i = 0; i < n; i++){
    cin >> p;
    for(int j = 0; j <= maxp; j++)
      if(point[j]) point[j+p] = true;
    maxp += p;
  }
  int count = 0;
  for(int i = 0; i <= maxp; i++)
    if(point[i]) count++;
  cout << count << endl;
 
  return 0;
} 

Submission Info

Judge Result