Online C Compiler - Programiz

Wed Jan 01 2025 09:27:33 GMT+0000 (Coordinated Universal Time)

Saved by @Narendra

#include <stdio.h> #include <math.h> // Function to check if a number is prime using bit manipulation int isPrimeUsingBits(unsigned int n) { if (n <= 1) return 0; // Numbers <= 1 are not prime if (n == 2) return 1; // 2 is prime if ((n & 1) == 0) return 0; // Even numbers (except 2) are not prime // Check divisors up to sqrt(n) for (unsigned int i = 3; i * i <= n; i += 2) { if ((n % i) == 0) return 0; } return 1; } int main() { unsigned int binaryNumber = 0b1101; // Input binary number printf("Binary input: 0b1101\n"); if (isPrimeUsingBits(binaryNumber)) { printf("The number is prime.\n"); } else { printf("The number is not prime.\n"); } return 0; }