A9668 | Maximum in Table
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
An $n×n$ table $a$ is defined as follows:
- The first row and the first column contain ones, that is: $a_{i,1}=a_{1,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 $a_{i,j}=a_{i-1,j}+a_{i,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.
- The first row and the first column contain ones, that is: $a_{i,1}=a_{1,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 $a_{i,j}=a_{i-1,j}+a_{i,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.
输入格式
The only line of input contains a positive integer $n$ ( $1<=n<=10$ ) — the number of rows and columns of the table.
输出格式
Print a single line containing a positive integer $m$ — the maximum value in the table.
输入输出样例
输入 #1
1
输出 #1
1
输入 #2
5
输出 #2
70
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}.$
${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}.$
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted