Prime Numbers and Factorial function

 #include <iostream>

using namespace std;

int Prime(int num)

{

    if (num<2)

    {

        return 0;

    }

    if (num==2)

    {

        return 1;

    }

    for (int i=2;i*i<=num;i++)

    {

        if (num%i==0)

        {

            return 0;

        }

    }

    return 1;

}

int Factorial(int num)

{

    int fact=1;

    for (int i=1;i<=num;i++)

    {

       fact*=i; 

    }

    return fact;

}

int main()

{

    int a,b;

    cout<<"Input two numbers:-\n";

    cin>>a>>b;

    cout<<a<<" is "<<(Prime(a)? "a prime":"not a prime ")<<" number."<<endl;

    cout<<b<<" is "<<(Prime(b)? "a prime":"not a prime ")<<" number."<<endl;

    cout<<"The factorials of "<<a<<" and "<<b<<" are "<<Factorial(a)<<" and "<<Factorial(b)<<" respectively.";

}

// The lines 13, 37 and 38 are meant to optimize the code's prime function. The explanation can be found in this chat here.