fork download
  1. //Xinnuo Wang CS1A Chapter6 Page.375 #21
  2. /*******************************************************************************
  3.  *
  4.  * Determine an interger is prime
  5.  * _____________________________________________________________________________
  6.  * The program accept an integer and determine it's prime or not.
  7.  *
  8.  * _____________________________________________________________________________
  9.  * Input
  10.  * num : The accepted integer
  11.  * Output
  12.  * t : True, reperesent the interger is prime
  13.  * f : Fslse,reperesent the interger isn't prime
  14.  * ****************************************************************************/
  15. #include <iostream>
  16. using namespace std;
  17. bool isPrime(int num);
  18. int main()
  19. {
  20. int num;
  21. cout << " Enter an integer" << endl;
  22. cin>> num;
  23. cout << isPrime(num);
  24. return 0;
  25. }
  26. bool isPrime(int num)
  27. {
  28. for (int i = 2; i< num; i++)
  29. {
  30. if (num % i == 0)
  31. return false;
  32. }
  33. return true;
  34.  
  35. }
Success #stdin #stdout 0.01s 5292KB
stdin
57
stdout
 Enter an integer
0