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
#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>

using namespace std;

const int N = 507;

int uc[N];
vector<int> buc;
unordered_map<int, int> mapa;

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> uc[i];
    }
    for (int i = 0; i < n; i++) {
        int suma = 0;
        for (int j = i; j < n; j++) {
            suma += uc[j];
            buc.push_back(suma);
        }
    }

    long long wyn = 0;

    mapa[buc[0]]++;
    for (int i = 1; i < buc.size(); i++) {
        for (int j = i + 1; j < buc.size(); j++) {
            wyn += mapa[-(buc[i] + buc[j])];
        }
        mapa[buc[i]]++;
    }
    cout << wyn;
    return 0;
}