Skip to main content

Posts

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;...

Birthday Chocolate HackerRank Solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],dt,m,temp,count= 0 ,sum= 0 ,j; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } scanf( "%d%d" ,&dt,&m); for (i= 0 ;i<n;i++) { sum= 0 ; temp= 0 ; for (j=i;j<n;j++) { if (temp<m) { sum=sum+a[j]; temp++; } } if (sum==dt) { count++; } } printf( "%d" ,count); return 0 ; }

Bon Appétit Hackerrank solution in C

#include< stdio.h > int main() { int n,i,k,b,s1= 0 ,s2; long int a[ 100000 ]; scanf( "%d%d" ,&n,&k); for (i= 0 ;i<n;i++) { scanf( "%ld" ,&a[i]); } scanf( "%d" ,&b); for (i= 0 ;i<n;i++) { s1=s1+a[i]; } s2=s1-a[k]; if (s2/ 2 ==b) { printf( "Bon Appetit\n" ); } else if (b>s2/ 2 ) { printf( "%d" ,b-s2/ 2 ); } return 0 ; }

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 ; }

Apple and Orange Hackerrank problem solution in C

#include< stdio.h > int main() { int s,t,m,n,x,y,i,a[ 1000 ]; long int o[ 100000 ],j,A[ 100000 ],O[ 100000 ],apple= 0 ,orange= 0 ; scanf( "%d%d" ,&s,&t); scanf( "%d%d" ,&x,&y); scanf( "%d%d" ,&m,&n); for (i= 0 ;i<m;i++) { scanf( "%ld" ,&a[i]); A[i]=x+a[i]; } for (j= 0 ;j<n;j++) { scanf( "%ld" ,&o[j]); O[j]=y+o[j]; } for (i= 0 ;i<m;i++) { if (A[i]<=t&&A[i]>=s) { apple++; } } for (j= 0 ;j<n;j++) { if (O[j]<=t&&O[j]>=s) { orange++; } } printf( "%d\n" ,apple); printf( "%d\n" ,orange); return 0 ; }

Grading Students Problem Solution in C

#include< stdio.h > int main() { int n,m,i,j,m1; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&m); m1=m; while (m1% 5 != 0 ) { m1++; } if (m1< 38 ) { printf( "%d\n" ,m); } else { if (m1-m< 3 ) { printf( "%d\n" ,m1); } else { printf( "%d\n" ,m); } } } return 0 ; }