January 2022 enrollments are closed and the course commences on 8th of January, 2022. For future cohorts

ARRAY-SPLITTING Solution

/*
*  Author: Arpit Bhayani
*  https://arpitbhayani.me
*/
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int i = 0;
char ch;
while((ch = getchar()) != '\n') {
str[i++] = ch;
}
str[i] = '\0';
return i;
}

int arr;

int _process(int start, int end, ll int half_sum) {
int mid = -1;
ll int temp_sum = 0;
for(int i = start; i <= end; i++) {
temp_sum += arr[i];
if(temp_sum == half_sum && i != end) {
mid = i;
break;
}
}

if(mid == -1) {
return 0;
}

if(half_sum % 2 == 0) {
int ca = _process(start, mid, half_sum/2);
int cb = _process(mid+1, end, half_sum/2);
int m = MAX(ca, cb);
return 1 + m;
}
else {
return 1;
}
}

int process(int n, ll int sum) {
int count = 0;
count = _process(0, n-1, sum/2);
return count;
}

int main(int argc, char *argv[]) {
int t;
scanf("%d", &t);

while(t--) {
int n;
ll int sum = 0;
scanf("%d", &n);
for(int i = 0 ; i < n; i++) {
scanf("%d", &arr[i]);
sum += arr[i];
}

int ans;
if(sum & 1) {
ans = 0;
}
else {
ans = process(n, sum);
}
printf("%d\n", ans);
}

return 0;
}