Problem:
https://www.hackerrank.com/challenges/migratory-birds/problem
#include <stdio.h>
int main()
{
int n,i,max,ans;
scanf("%d", &n);
int a[n],h[6]={0};
for(i = 0; i < n; i++)
{
scanf("%d",&a[i]);
h[a[i]]++;
}
max=h[1];
for(i = 2; i < 6; i++)
{
if(max<h[i])
{
max=h[i];
ans=i;
}
}
printf("%d",ans);
return 0;
}
why is 6 in h[6] please explain.
ReplyDeleteRead the question properly..there are only 5 types of birds and they are 1,2,3,4,5
Deletemax=h[1]??
ReplyDeleteassuming max= count of type 1 birds (h[1])
Deletebecause in the question in the input format, it is written as there can be only birds of type1,type2,type3, type4 and type5 only. There is no type 0 bird
Could you please explain, what do you mean by "h[a[i]]++;", and why you wrote there?
ReplyDeleteno sorry
Deletewhere is the condition specified in the case there are 2 two types of birds with same number of most migrations and the lower ID bird is displayed
ReplyDeleteThis comment has been removed by the author.
ReplyDeletecvSV
ReplyDelete