1.26 A

A - 1

Time limit 2000 ms
Memory limit 262144 kB

Problem Description

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.

Sample Input

1

1

Sample Output

5

70

问题链接：A - 1

问题简述：

输入n，代表n*n的正方形，第一行和每行第一个数都是1，其余大小等于上面的数加上左边的数，输出最右下角的那个数

问题分析：

一开始在考虑怎么构建正方形然后怎么循环，然后发现1<=n<=10,于是就偷懒了，直接手算所有结果，直接输出就好

程序说明：

咳咳就那么几行

AC通过的C语言程序如下：

#include <iostream>
using namespace std;

int main()
{
	int n;
	cin >> n;
	int a[10] = { 1,2,6,20,70,252,924,3432,12870,48620 };
	cout << a[n - 1];
}