#include <stdio.h> int main() { int a[10],i,b,k,count=0; scanf("%d",&b); for(i=0;i<b;i++) { scanf("%d",&a[i]); } scanf("%d",&k); for(i=0;i<b;i++) { if(k==a[i]) { count++; } } if(count==1) { printf("Book Available"); } else{ printf("Book is not available"); } //navnit return 0; }
Type the Question
Saturday, February 16, 2019
Subscribe to:
Post Comments (Atom)
Question Name:TOWER OF HANOI
#include < bits / stdc ++. h > #define lli long long using namespace std ; lli dp [ 202 ]; int main () { int t , n ; ...
-
#include <stdio.h> int main () { int num , y = 0 , m , n , l ; scanf ( "%d" , & num ); while ( y < num )...
-
#include <iostream> #include < bits / stdc ++. h > using namespace std ; bool isPossible ( int arr [], int n , ...
-
#include <iostream> using namespace std ; void findClosest ( int A [], int B [], int C [], int p , int q , int ...
No comments:
Post a Comment