Why wrong answer ...question is divisble subset

#include<bits/stdc++.h>
using namespace std;
int ar[100005],br[100005];
int main()
{
int t;
cin>>t;
while(t–)
{
int n,index,element,count1=0,res=0;
cin>>n;
int sum=0;
// memset(pre,0,sizeof(pre));
// pre[0]=1;
br[0]=0;
for(int i=0;i<n;i++)
{
cin>>ar[i];
sum=sum+ar[i];
sum=sum%n;
br[i+1]=sum;
//pre[sum]++;
}

	//cout<<ans<<endl;

/for(int i=0;i<=n;i++)
cout<<br[i]<<" ";
cout<<endl;
/
for(int i=0;i<n;i++)
{
if(ar[i]%n==0)
{
cout<<“1”<<endl;
cout<<i+1<<endl;
count1++;
break;
}
}
for(int i=0;i<=n;i++)
{
if(count(br,br+n,br[i])>=2)
{
element=br[i];
index=i;
res=1;
break;
}
}
for(int i=index+1;i<=n;i++)
{
if(br[i]==element && count1==0 && res==1)
{
cout<<i-index<<endl;
cout<<index+1<<" “<<i<<endl;
count1++;
break;
}
}
if(count1==0)
cout<<”-1"<<endl;
}
return 0;
}