Birthday Cake Candles HackerRank Solution in C programming.

Birthday Cake Candles HackerRank Solution in C programming.

To see full question, please visit Hackerrank.

#include<stdio.h>

int main()

{

int n,c=0;

long int a[100000],i;

scanf("%d",&n);

for(i=0;i<n;i++)

{

scanf("%ld",&a[i]);

}

int max=a[0];

for(i=0;i<n;i++)

{

if(max<a[i])

{

max=a[i];

}

}

for(i=0;i<n;i++)

{

if(a[i]==max)

{

c++;

}

}

printf("%d",c);

return 0;

}