[백준 조합] 제출 C++

https://www.acmicpc.net/problem/11050

11050번: 이항 계수 1

#include <iostream>
#include <cmath>

using namespace std;

int factorial(int N)
{
    if(N == 1 || N == 0)
        return 1;
    
    return N * factorial(N - 1);
}
int main()
{
    int N = 0;
    int M = 0;
    cin >> N >> M;
    cout << factorial(N) / (factorial(M) * factorial(N - M))<< endl;
   
    return 0;
}