学步园

1

1

5

70

解题思路：

最为基础的打表了，而且数据很小，直接查就可以了~

代码：

# include<cstdio>
# include<iostream>

using namespace std;

# define MAX 15
int n;
int a[MAX][MAX];

void work()
{
    for ( int i = 1;i <= n;i++ )
    {
        a[i][1] = 1;
        a[1][i] = 1;
    }
    for ( int i = 2;i <= n;i++ )
    {
        for ( int j = 2;j <= n;j++ )
        {
            a[i][j] = a[i-1][j]+a[i][j-1];
        }
    }
}


int main(void)
{
    //int n;
    while ( cin>>n )
    {
          work();
        if ( n==1 )
            cout<<"1"<<endl;
        else
            cout<<a[n][n]<<endl;
    }


    return 0;
}