# Geeksforgeeks Solution For " Find the number of sub-arrays having even sum "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers

Problem :- Find the number of sub-arrays having even sum

Solution :-

#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int i,j,n,cnt=0;
cin>>n;
int ar[n];
for(i=0;i<n;i++)
cin>>ar[i];

for(i=0;i<n;i++)
{
int sum=0;
for(j=i;j<n;j++)
{
sum+=ar[j];
if(sum%2==0)
cnt++;
}
}
cout<<cnt<<endl;

}
return 0;
}

Output:-

Previous Post
Next Post

#### post written by: Ghanendra Yadav

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.