Skip to main content

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

Comments

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