Daisy Chains

#include<bits/stdc++.h>
using namespace std;

int arr[101];

void solve(){
    int n;
    cin>>n;

    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }

    int ans=n;
    for(int i=1;i<n;i++){
        for(int j=i+1;j<=n;j++){
            double sum=0;
            for(int k=i;k<=j;k++){
                sum+=arr[k];
            }
            int x = ceil(sum/(j-i+1));
            int y = floor(sum/(j-i+1));

            if(x!=y) continue;

            for(int k=i;k<=j;k++){
                if(arr[k]==x){
                    ans++;
                    break;
                }
            }
        }
    }

    cout<<ans<<endl;
}


int main()
{
    int tc=1;
    //scanf("%d",&tc);

    while(tc--){
        solve();
    }
}