dobri

#include <bits/stdc++.h>
 
#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int
 
#define pii pair<int, int>
#define pll pair<long long, long long>
 
#define ld long double
#define defmod 1000000007
 
#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;
 
 
int main(){
  cin.sync_with_stdio(0);
  cin.tie(0);
 
  int n; cin >> n;
  int a[5050];
  for(int i = 0; i < n; ++i)
    cin >> a[i];
  set<int> lel[4];
  lel[1].insert(a[0]);
  lel[2].insert(a[0]*2);
  lel[3].insert(a[0]*3);
  int ans = 0;
  for(int i = 1; i < n; ++i){
    if(lel[3].count(a[i]))
      ans++;
    for(auto f: lel[2]){
      if(f+a[i] >= -100000 && f+a[i] <= 100000)
	lel[3].insert(f+a[i]);
    }
    for(auto f: lel[1]){
      if(f+a[i] >= -200000 && f+a[i] <= 200000)
	lel[2].insert(f+a[i]);
      if(f+2*a[i] >= -100000 && f+2*a[i] <= 100000)
	lel[3].insert(f+a[i]);
    }
    lel[1].insert(a[i]);
    lel[2].insert(a[i]*2);
    lel[3].insert(a[i]*3);
  }
  cout << ans << endl;
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED