Skip to main content

Angry Professor HackerRank Solution in C

#include<stdio.h>
int main()
{
int t,n,i,j,a[1000],count=0,k;
scanf("%d",&t);
for(j=0;j<t;j++)
{
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]<=0)
{
count++;
}
}
if(count<k)
{
printf("YES\n");
count=0;
}
else
{
printf("NO\n");
count=0;
}
}
return 0;
}

Comments

Post a Comment

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 ; }
Post a Comment
Read more