#include <stdio.h>
int isKthBitSet(int n, int k) {
// Write your code here
return (n & (1<<k))!=0;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
printf("%d", isKthBitSet(n, k));
return 0;
}
Solving Approach
n=8 and k=3 (00001000 & (1<<k))!=0
00001000 (n) 00001000 (1<<k) ---------------------- 00001000 (8)!=0 it is true so bit 3 is set