CF 509A(Maximum in Table-暴力)

A. Maximum in Table

time limit per test

memory limit per test

input

output

n × n table a

• ai, 1 =a1,ifor alli= 1, 2, ...,n.
• ai,j=ai- 1,j+ai,j- 1.

These conditions define all the values in the table.

n. You need to determine the maximum value in the n × n

Input

n (1 ≤ n ≤ 10) — the number of rows and columns of the table.

Output

m

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}.

暴力即可

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (10+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n;
int a[MAXN][MAXN];
int main()
{
//  freopen("Table.in","r",stdin);
//  freopen(".out","w",stdout);
  cin>>n;
  For(i,n) a[i][1]=a[1][i]=1;
  Fork(i,2,n)
    Fork(j,2,n) 
      a[i][j]=a[i-1][j]+a[i][j-1];
  cout<<a[n][n];
  
  
  return 0;
}