Equilibrium point

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 40 41 42 43 44 45 46

/// Raihan Ruhin (username: raihanruhin) /// Resume: https://raihanruhin.github.io #include<bits/stdc++.h> using namespace std; #define SET(a) memset(a,-1,sizeof(a)) #define CLR(a) memset(a,0,sizeof(a)) #define PI acos(-1.0) #define MOD 1000000007 #define MX 100010 int main() { ios_base::sync_with_stdio(0), cin.tie(0); int tc, kk=1, n, x, consecutive_sum[102]; bool found; consecutive_sum[0]=0; cin>>tc; while(tc--) { found =false; cin>>n; for(int i=1;i<=n;i++) { cin>>x; consecutive_sum[i] = consecutive_sum[i-1] + x; } for(int i=1;i<=n;i++) { if(consecutive_sum[n]-consecutive_sum[i] == consecutive_sum[i-1]) { found =true; cout<<i<<endl; break; } } if(!found) cout<<-1<<endl; //cout<<"Case "<<kk++<<": "<< <<"\n"; } return 0; }