Extra Long Factorials Hackerrank solution in Python

Staircase Hackerrank Solution in C

#include< stdio.h > int main() { int n,i,j,k; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { for (k=n- 1 ;k>i;k--) { printf( " " ); } for (j= 0 ;j<i+ 1 ;j++) { printf( "#" ); } printf( "\n" ); } 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 ; }

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;

HackerRank Solutions In C

Search This Blog