View Code of Problem 610

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>

const int inf = (1<<31)-1;
const int MAXN = 1e1+10;

using namespace std;
int dp[MAXN][MAXN];


int main()
{
    for(int i=1;i<=10;i++){
        dp[i][0] = 1;
        for(int j=1;j<=i;j++){
            dp[i][j] = dp[i-1][j]+dp[i][j-1];
        }
    }
    int n;
    while(scanf("%d",&n)!=EOF){
        cout<<dp[n][n]<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}