fork download
  1. #include <iostream>
  2.  
  3. bool isPrime(int num) {
  4. if (num < 2) return false; // Numbers less than 2 are not prime
  5. for (int i = 2; i * i <= num; i++) {
  6. if (num % i == 0) return false;
  7. }
  8. return true;
  9. }
  10.  
  11. int main() {
  12. std::cout << "Enter a number: ";
  13. int num;
  14. std::cin >> num;
  15.  
  16. if (num <= 1) {
  17. std::cout << num << " is neither prime nor composite." << std::endl;
  18. } else if (isPrime(num)) {
  19. std::cout << num << " is a prime number." << std::endl;
  20. } else {
  21. std::cout << num << " is a composite number." << std::endl;
  22. }
  23.  
  24. return 0;
  25. }
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Enter a number: 32765 is a composite number.