A_Maximum_in_Table.cpp

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int a[n][n];
    for (int i = 0; i < n; i++)
    {
        for (size_t j = 0; j < n; j++)
        {
            if (i == 0 || j == 0)
            {
                a[i][j] = 1;
            }
            else
            {
                a[i][j] = a[i - 1][j] + a[i][j - 1];
            }
        }
    }

    cout << a[n - 1][n - 1] << endl;
    return 0;
}