Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int factorial(int n); //prototype
- bool isprime(int n);
- int main()
- {
- int number;
- cin>>number;
- // cout<<"factorial "<<number<<"="<<factorial(number)<<endl; //call statement
- if(isprime(number))//call statement
- cout<<number<<" is prime"<<endl;
- else
- cout<<number<<" is not prime"<<endl;
- } //endmain
- int factorial(int n)//decleration
- {
- int fact=1;
- for(int i=1;i<=n;i++)
- fact=fact*i;
- return fact; //return fact,fact+5,10; -->always return last variable/value--> 10
- }//factorial
- bool isprime(int n)
- {
- for(int i=2;i<=n/2;i++)
- if(n%i==0)
- return false;
- return true;
- }//isprime
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement