Codeforces Round #784 (Div. 4) 1669F. Eating Candies Solution

 

Problem Link: https://codeforces.com/contest/1669/problem/F

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int  n,i,j,t,c1,c2,s1,s2,ans;

    cin>>t;

    while(t--)

    {

        c1=c2=s1=s2=ans=0;

        cin>>n;

        j=n;

        int a[n+9];

        for(i=1; i<=n; i++)

            cin>>a[i];

            i=1;

        while(i<=j)

        {

            if(s1<=s2)

            {

                s1+=a[i];

                c1++;

                i++;

            }

            else

            {

                s2+=a[j];

                c2++;

                j--;

            }

            if(s1==s2)ans=c1+c2;

        }

        cout<<ans<<endl;

    }

}