Wednesday 6 January 2016

Its a lazy Holiday morning

Particularly I dont know what these Polish people are celebrating, anyway, here is the code for factorisation and checking for a prime number. for the primorial... i got lazy, and stuck probably... but I know y'all geniouses and you can finish it..hehe

dont forget to type exit to quit.

 
#include <iostream>
int fact(int);
bool is_prime(int);
int primorial(int);

using namespace std;

int main()
{
    string choice;
    int a;
    while(choice!="exit"){
    cout << "Choose a code to test" << endl;
    cout << "CODE\t|\tDescription" << endl;
    cout << "fact\t|\tCalculates Factorial" << endl;
    cout << "prime\t|\tChecks if your number is prime or not" << endl;
    cout << "primo\t|\tDescription" << endl;
    cout << "exit\t|\tQuits the program" << endl;
    cin  >>  choice;

        if(choice=="fact"){
        cout << "Enter a number to factorize\n";
        cin  >> a;
        cout << "\nThe factorial is " << fact(a) << endl;}

        if(choice=="prime"){
        cout << "Enter a number\n";
        cin  >> a;
        if(is_prime(a))
            cout <<a<< " is a prime number.\n\n";
        else
            cout <<a<< " is not a prime number.\n\n";}

        if(choice=="primo"){
        cout << "Enter a number to primorialize\n";
        cin  >> a;
        cout << "The primorial is " << primorial(a)<<endl<<endl;}

    }

    return 0;
}


int fact(int x)
{
    if(x==1)
        return x;
    else
        return x*fact(x-1);
}


bool is_prime(int x)
{
    if(x==1)
    return true;
    if(x==2)
    return true;
    for(int y=2; y<x ; y++){
        if(x%y==0)
        return false;
        else
        return true;}
}

int primorial(int x)
{
 ////////smart people.. i need help!!!
}

No comments:

Post a Comment