Decent_Array.cpp

// Siddarth is working with a list of integers, 0-indexed list.
// The list is said to be decent list, if the sum of the inteers at odd indices 
// equal to the sum of integers at even indices in the list.

// Now, siddarth can choose any index position, and delete the element from the list.
// and check whether the resultant list is a decent list or not.
// Due to the deletion of an element, the index postions may vary. 

// For example, if the list is [2,1,3,4,1] :
// 	- delete the element at index 1 => list is [2,3,4,1]
// 	- delete the element at index 2 => list is [2,1,4,1]
// 	- delete the element at index 3 => list is [2,1,3,1]
// 	- delete the element at index 4 => list is [2,1,3,4]

// Siddarth has to find out how many indices you can remove one at a time and,
// check that the resultant list becomes a decent list.

// Your task is to help siddarth to find the count of all such indices.

// Input Format:
// -------------
// Line-1: An integer N, number of elements in the list.
// Line-2: N space separated integers, the list.

// Output Format:
// --------------
// Print an integer, number of indices you can find.


// Sample Input-1:
// ---------------
// 5
// 1 2 2 1 2

// Sample Output-1:
// ----------------
// 1


// Sample Input-2:
// ---------------
// 5
// 2 2 2 2 2

// Sample Output-2:
// ----------------
// 5


// Sample Input-3:
// ---------------
// 4
// 3 2 7 5

// Sample Output-3:
// ----------------
// 1




#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    vector<int> nums(n,0);
    for(int i=0;i<n;i++){
        cin>>nums[i];
    }
    int c=0;
    for(int i=0;i<n;i++){
        int a=0,b=0,k=0;
        for(int j=0;j<n;j++){
            if(i!=j){
              if(k%2==0){
                  a=a+nums[j];
              }  
              else{
                  b=b+nums[j];
              }
              k++;
            }
        }
        if(a==b){
            c++;
        }
    }
    cout<<c;
}