递推水题 Codeforces Round #289 (Div. 2, ACM ICPC Rules) A. Maximum in Table

题目传送门

/*
    模拟递推水题
*/
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
using namespace std;

const int MAXN = 10 + 10;
const int INF = 0x3f3f3f3f;
int a[MAXN][MAXN];

int main(void)
{
    #ifndef ONLINE_JUDGE
    freopen ("A.in", "r", stdin);
    #endif

    int n;
    while (~scanf ("%d", &n))
    {
        for (int i=1; i<=n; ++i)
        {
            a[1][i] = 1;
            a[i][1] = 1;
        }

        for (int i=2; i<=n; ++i)
        {
            for (int j=2; j<=n; ++j)
            {
                a[i][j] = a[i-1][j] + a[i][j-1];
            }
        }

        printf ("%d
", a[n][n]);
    }

    return 0;
}