language: C++ 4.7.2 (gcc-4.7.2)
date: 348 days 8 hours ago
link:
visibility: private 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

/* @
 * Siddharth Maloo
*/
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <string.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <time.h>
#include <fstream>
#include <functional>
#include <numeric>
/////////////////
#define ULL unsigned long long int
#define GI ({int t;scanf("%d",&t);t;})
#define GL ({unsigned long long int t;scanf("%llu",&t);t;})
#define PInt(a) printf("%d\n",(a))
#define PLng(a) printf("%llu\n",(a))
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
/////////////////
using namespace std;
int p[101][101*101+1], a[101];
int main () {
        int i, j, k, c=0, t, n;
    n = GI;
    FOR(i,0,n){
        a[i] = GI;
    }
 
    p[1][a[0]] = k = 1;
    FOR(i,2,n+1){
        FOR(j,0,n*n+1){
                if( p[i][j] >= 2) {k=0;break;}
 
                p[i][j] += j - a[i]> 0?(p[i-1][j]+p[i-1][j-a[i]]):0;
                p[i][j] += j == a[i] ? 1:0;
                p[i][j] += j<a[i] ? p[i-1][j]:0;
 
            }
            if(k==0) break;
    }
        if ( k== 0) cout <<"got it :)";
        return 0;
}