Codeforces Round #289 (Div. 2, ACM ICPC Rules) A. Maximum in Table【递推】
2024-09-06 06:20:13
A. Maximum in Table
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
input
1
output
1
input
5
output
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}.
【分析】:第一行全为1,递推求最后一个数。
【代码】:
#include <bits/stdc++.h>
using namespace std; const int INF=0x3f3f3f3f;
#define LL long long int a[][],n,ma;
int main()
{
cin>>n;
for(int i=;i<=n;i++)
a[i][]=a[][i]=; for(int i=;i<=n;i++)
{
for(int j=;j<=n;j++)
{
a[i][j]=a[i-][j]+a[i][j-];
}
}
cout<<a[n][n]<<endl;
return ;
}
傻逼递推求最大
最新文章
- Linux工具快速教程
- 让div固定在顶部不随滚动条滚动
- 无法识别的属性“targetFramework”的解决方法
- nginx 报错 upstream timed out (110: Connection timed out)解决方案
- Web前端业界氛围极好的群——鬼懿IT
- SQL SELECT基本语句结构
- SICP 习题 (2.7) 解题总结 : 定义区间数据结构
- 利用PS滤镜及图层叠加制作水墨荷花
- ClientID 获取服务端控件,客户端id的方法
- EXCEL 两人的建立Y轴
- 安装和配置Symfony
- Python的property装饰器的基本用法
- git命令提交项目
- Vue深度学习(1)
- python学习笔记(7)--循环语句
- RN用蓝牙接入热敏打印机和智能电子秤(转载)
- bootgrid 刷新保持当前排序
- PYTHON-操作系统基础-2-练习
- usb之python(pyusb)
- redis知识积累