Codeforces - 509A - Maximum in Table

A. Maximum in Table

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
An n × n table a is defined as follows:

The first row and the first column contain ones, that is: ai, 1 = a1, i = 1 for all i = 1, 2, …, n.
Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula ai, j = ai - 1, j + ai, j - 1.
These conditions define all the values in the table.

You are given a number n. You need to determine the maximum value in the n × n table defined by the rules above.

Input
The only line of input contains a positive integer n (1 ≤ n ≤ 10) — the number of rows and columns of the table.

Output
Print a single line containing a positive integer m — the maximum value in the table.

Examples
inputCopy
1
outputCopy
1
inputCopy
5
outputCopy
70
Note
In the second test the rows of the table look as follows:

{1, 1, 1, 1, 1}, 
{1, 2, 3, 4, 5}, 
{1, 3, 6, 10, 15}, 
{1, 4, 10, 20, 35}, 
{1, 5, 15, 35, 70}.

看到题目n的范围才10，直接上二维数组，初始化顶上一行和最左边一行为1
再跑个双for把表打出来，输出的时候给个g[n][n]就好了

原题链接：https://codeforces.com/problemset/problem/509/A

#include<iostream>
#include<cstring>
#include