fork download
  1. //Ryan Shahriyarpour CS1A Carl Argila CH6 HW Q:21
  2. //
  3. /*****************************************************************************
  4.  *
  5.  * Function
  6.  *
  7.  *********************
  8.  *
  9.  * This program asks the user for an integer and uses the function isPrime to
  10.  * determine whether it is prime. A prime number is only evenly divisible by
  11.  * 1 and itself.
  12.  *
  13.  * INPUT
  14.  * number - an integer entered by the user
  15.  *
  16.  * OUTPUT
  17.  * A message stating whether the number is prime
  18.  *
  19.  ****************************************************************************/
  20.  
  21. #include <iostream>
  22. using namespace std;
  23.  
  24. // Function prototype
  25. bool isPrime(int number);
  26.  
  27. int main()
  28. {
  29. int number; // Number entered by the user
  30.  
  31. cout << "Enter an integer: ";
  32. cin >> number;
  33.  
  34. if (isPrime(number))
  35. cout << number << " is a prime number.\n";
  36. else
  37. cout << number << " is not a prime number.\n";
  38.  
  39. return 0;
  40. }
  41.  
  42. // Returns true if number is prime, false otherwise.
  43. // Numbers less than 2 are not prime. If any divisor from 2 up to the square
  44. // root of the number divides it evenly (remainder 0), it is not prime.
  45. bool isPrime(int number)
  46. {
  47. if (number < 2)
  48. return false;
  49.  
  50. for (int divisor = 2; divisor * divisor <= number; divisor++)
  51. {
  52. if (number % divisor == 0)
  53. return false;
  54. }
  55.  
  56. return true;
  57. }
Success #stdin #stdout 0s 5316KB
stdin
Standard input is empty
stdout
Enter an integer: 32766 is not a prime number.