Factorial using recursion in c++

#include<iostream>
#include<conio.h>
using namespace std;
int fact_recurse(int n)
{
        if(n==1)
        return n;
        else
        return n*fact_recurse(n-1);
}
int main()
{
        int num;
        cout<<"Enter an integer to find factorial : ";
        cin>>num;
        if(num<0)
        cout<<"Factorial of negative numbers does not exist.";
        else if(num==0)         cout<<"factorial of 0 is 1.";
        else
        cout<<"Factorial of "<<num<<" is "<<fact_recurse(num);
        getch();
        return 0;
}

Output

Factorial using Recursion in python

def fact_recurse(n):
        if n==1:
                return n
        else:
                return n*fact_recurse(n-1)
num=int(input("Enter an integer to find factorial : "))
if num<0:
        print("Factorial of negative numbers does not exist.")
elif num==0:
        print("Factorial of 0 is 1.")
else:
        print("Factorial of ",num," is ",fact_recurse(num))

Output