Submission #97405

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <set>
#include <map>
#include <list>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits.h>
#include <string>
#include <queue>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <string.h>
using namespace std;

#define		For( i, a )		for(int i= 0; i< (int)(a); ++i)
typedef		long long int	LLint;
typedef		complex<double>	Point;

typedef		unsigned char	Uchar;

const int num= 5050 +8;
int TB[num];

int main(){
	int N;
	cin>> N;

	TB[0]= 1;

	int P;
	For( n, N ){
		cin>> P;

		for(int i= num -1; i>= 0; i--){
			if( TB[i] ){
				TB[i+P]= 1;
			}
		}
	}

	int cnt= 0;
	For( n, num ){
		if( TB[n] ) cnt++;
	}
	cout<< cnt<< endl;

	return 0;
}

Submission Info

Judge Result