Advertisement
Guest User

Untitled

a guest
Mar 22nd, 2018
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3. int factorial(int n); //prototype
  4. bool isprime(int n);
  5. int main()
  6. {
  7. int number;
  8. cin>>number;
  9. // cout<<"factorial "<<number<<"="<<factorial(number)<<endl; //call statement
  10. if(isprime(number))//call statement
  11. cout<<number<<" is prime"<<endl;
  12. else
  13. cout<<number<<" is not prime"<<endl;
  14. } //endmain
  15.  
  16. int factorial(int n)//decleration
  17. {
  18. int fact=1;
  19. for(int i=1;i<=n;i++)
  20. fact=fact*i;
  21. return fact; //return fact,fact+5,10; -->always return last variable/value--> 10
  22. }//factorial
  23. bool isprime(int n)
  24. {
  25. for(int i=2;i<=n/2;i++)
  26. if(n%i==0)
  27. return false;
  28.  
  29.  
  30. return true;
  31.  
  32. }//isprime
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement