#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int count=0;
int num=arr[0];
for(int i=1;i<n;i++)
{
if(num!=arr[i])
count++;
}
printf("%d",count);
}
C Language
TCS 1st Qsn
Vijays code
Telegram - https://t.me/nqt_0
int main()
{
int n;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int count=0;
int num=arr[0];
for(int i=1;i<n;i++)
{
if(num!=arr[i])
count++;
}
printf("%d",count);
}
C Language
TCS 1st Qsn
Vijays code
Telegram - https://t.me/nqt_0
arr=[-1,18,13,18,-2,-16,7,-1,-213,11]
n=len(arr)
maxi=[0]
maxlen=[0]
def fuct(index,s,p):
if index>=n:
if len(p)>maxlen[0]:
maxlen[0]=len(p)
maxi[0]=max(maxi[0],s)
return
else:
if p==[]:
fuct(index+1,s+arr[index],p+[arr[index]])
fuct(index+1,s,p)
else:
if p[-1]>0:
if arr[index]<0:
fuct(index+1,s+arr[index],p+[arr[index]])
else:
fuct(index+1,s,p)
else:
if arr[index]>0:
fuct(index+1,s+arr[index],p+[arr[index]])
else:
fuct(index+1,s,p)
return
fuct(0,0,[])
print(maxi)
n=len(arr)
maxi=[0]
maxlen=[0]
def fuct(index,s,p):
if index>=n:
if len(p)>maxlen[0]:
maxlen[0]=len(p)
maxi[0]=max(maxi[0],s)
return
else:
if p==[]:
fuct(index+1,s+arr[index],p+[arr[index]])
fuct(index+1,s,p)
else:
if p[-1]>0:
if arr[index]<0:
fuct(index+1,s+arr[index],p+[arr[index]])
else:
fuct(index+1,s,p)
else:
if arr[index]>0:
fuct(index+1,s+arr[index],p+[arr[index]])
else:
fuct(index+1,s,p)
return
fuct(0,0,[])
print(maxi)