Competitive Programming

// 1 1 2 5 14 42 132 429 1430
#include<iostream>
using namespace std;
unsigned long int catalanDP(unsigned int n){
    unsigned long int catalan[n+1];
     catalan[0] = catalan[1] = 1;
    for (int i=2; i<=n; i++){
        catalan[i] = 0;
        for (int j=0; j<i; j++)
            catalan[i] += catalan[j] * catalan[i-j-1];
    }
    return catalan[n];
}
int main() {
    for (int i = 0; i < 10; i++)
     cout << catalanDP(i) << " ";
    return 0;
}