# Help me in solving CS2023_STK problem question not understand

### My code

``````#include <iostream>
using namespace std;

int main() {
return 0;
}

``````

Problem Link: CS2023_STK Problem - CodeChef

@anishkumar555
you have to count which among the 2 candidates has created a bigger streak .

the basic approach is to calculate max consecutive numbers occurs in the array greater than zero . store it in a variable and as soon as u encounter zero. reset the counter variable and start counting again as u traverse along the array , if u find a bigger value update it .
do the same for the 2nd array as well and then compare it using if else statements.

// I have pasted my code over here
hope this helps !!

#include <bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t–)
{
int n;
cin>>n;
int a[n];
int b[n];
int count1 = 0;
int count2 = 0;
int maxc1 = INT_MIN;
int maxc2 = INT_MIN;
for(int i = 0; i<n; i++){
cin>>a[i];
if(a[i]){
count1++;
maxc1 = max(maxc1,count1);
}
else{
count1 = 0;
}
}
for(int i = 0; i<n; i++){
cin>>b[i];
if(b[i]){
count2++;
maxc2 = max(maxc2,count2);
}
else{
count2 = 0;
}
}
if(maxc1>maxc2){
cout<<“Om\n”;
}
else if(maxc1<maxc2){