Skip to main content

Migratory Birds HackerRank Solution in C

#include<stdio.h>
int main()
{
long int n,i,b[10000],j,count=0,t,k;
long int a[100000],c[100000],p[100000];
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]==1)
{
b[1]++;
}
if(a[i]==2)
{
b[2]++;
}
if(a[i]==3)
{
b[3]++;
}
if(a[i]==4)
{
b[4]++;
}
if(a[i]==5)
{
b[5]++;
}
}
int max=b[1];
for(j=1;j<=5;j++)
{
if(max<b[j])
{
max=b[j];
}
}
long int z=1;
for(j=1;j<=5;j++)
{
if(max==b[j])
{
c[j]=j;
count++;
t=j;
p[z]=j;
z++;
}
}
if(count==1)
{
printf("%ld",t);
}
else
{ long int min=p[1];
for(k=p[1];k<z;k++)
{
if(min>c[k])
{
min=c[k];
}
}
printf("%ld",min);
}
return 0;
}

Comments

  1. #include
    #include

    int main()
    {
    long long int n,i,j,k,sum1=0,sum2=0,maxval,pos,b[5];


    scanf("%lld",&n);

    long long int a[n];

    for(i=0;imaxval){
    maxval=b[i];
    pos=i;
    }
    }




    printf("%lld",pos);



    return 0;
    }

    ReplyDelete

Post a Comment

Popular posts from this blog

Breaking the Records Hackerrank solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],x= 0 ,mn= 0 ; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } int min=a[ 0 ],max=a[ 0 ]; for (i= 0 ;i<n;i++) { if (min>a[i]) { min=a[i]; mn++; } } for (i= 0 ;i<n;i++) { if (max<a[i]) { max=a[i]; x++; } } printf( "%d %d" ,x,mn); return 0 ; }