Codeforces-SolutionsA/Codes/1985 C - Good Prefixes/1985C.cpp

33 lines
619 B
C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
ll n;
cin>>n;
ll mx=0, ct=0, sum=0;
for(ll i=0; i<n; ++i)
{
ll x;
cin>>x;
sum+=x;
mx=max(x,mx);
if(sum-mx==mx) ct++;
}
cout<<ct<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}