Submission #2850629

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int main (){
    int n;
    cin >> n;
    int a[n];
    int ans=0;
    long long b[n];
    long long tmp, t;
    for(int i=0;i<n;i++){
        cin >> a[i];
        if(i==0){
            b[i]=a[i];
        }else{
            b[i]=b[i-1]+a[i];
        }
    }
    sort(b, b+n);
    t=0;
    for(int i=0;i<n;i++){
        if(b[i]==0){
            ans++;
        }
        if(i==0){
            continue;
        }
        if(b[i]==b[i-1]){
            t+=1;
            ans+=t;
        }else{
            t=0;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result