洛谷传送门
BZOJ传送门
题目描述
输入输出格式
输入格式:
一个正整数 N N N( 1 ≤ N ≤ 500 1\le N\le 500 1≤N≤500),表示阶梯的高度。
输出格式:
一个正整数,表示搭建方法的个数。(注:搭建方法的个数可能很大)
输入输出样例
输入样例#1:
3
输出样例#1:
5
说明
40%的数据: 1 ≤ N ≤ 20 1\le N\le 20 1≤N≤20
80%的数据: 1 ≤ N ≤ 300 1\le N\le 300 1≤N≤300
100%的数据: 1 ≤ N ≤ 500 1\le N\le 500 1≤N≤500
解题分析
可以发现, 如果我们新加入一列台阶, 那么可以有如下放置方法:
如果没有抵住右边界显然是无解的。然后问题就转化为了两个更小的子问题。 得到递推式 f ( i ) = ∑ j = 0 i − 1 f ( j ) f ( i − 1 − j ) f(i)=\sum_{j=0}^{i-1}f(j)f(i-1-j) f(i)=∑j=0i−1f(j)f(i−1−j)。
实际上这就是卡特兰数, 直接 f ( i ) = 4 i − 2 i + 1 f ( i − 1 ) f(i)=\frac{4i-2}{i+1}f(i-1) f(i)=i+14i−2f(i−1)递推即可。
代码如下:
#include <cstdio>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#define R register
#define IN inline
#define W while
using namespace std;
namespace BigInteger
{
#define maxn 1005
struct Big_integer{
int d[maxn], len;
void clean() { while(len > 1 && !d[len-1]) len--; }
IN Big_integer() { memset(d, 0, sizeof(d)); len = 1; }
IN Big_integer(int num) { *this = num; }
IN Big_integer(char* num) { *this = num; }
IN Big_integer operator = (const char* num){
memset(d, 0, sizeof(d)); len = strlen(num);
for(R int i = 0; i < len; i++) d[i] = num[len-1-i] - '0';
clean();
return *this;
}
IN Big_integer operator = (int num){
char s[10005]; sprintf(s, "%d", num);
*this = s;
return *this;
}
IN Big_integer operator + (const Big_integer& b){
Big_integer c = *this; R int i;
for (i = 0; i < b.len; i++){
c.d[i] += b.d[i];
if (c.d[i] > 9) c.d[i]%=10, c.d[i+1]++;
}
while (c.d[i] > 9) c.d[i++]%=10, c.d[i]++;
c.len = max(len, b.len);
if (c.d[i] && c.len <= i) c.len = i+1;
return c;
}
IN Big_integer operator - (const Big_integer& b){
Big_integer c = *this; R int i;
for (i = 0; i < b.len; i++){
c.d[i] -= b.d[i];
if (c.d[i] < 0) c.d[i]+=10, c.d[i+1]--;
}
while (c.d[i] < 0) c.d[i++]+=10, c.d[i]--;
c.clean();
return c;
}
IN Big_integer operator * (const Big_integer& b)const{
R int i, j; Big_integer c; c.len = len + b.len;
for(j = 0; j < b.len; j++) for(i = 0; i < len; i++)
c.d[i+j] += d[i] * b.d[j];
for(i = 0; i < c.len-1; i++)
c.d[i+1] += c.d[i]/10, c.d[i] %= 10;
c.clean();
return c;
}
IN Big_integer operator / (const Big_integer& b){
R int i, j;
Big_integer c = *this, a = 0;
for (i = len - 1; i >= 0; i--)
{
a = a*10 + d[i];
for (j = 0; j < 10; j++) if (a < b*(j+1)) break;
c.d[i] = j;
a = a - b*j;
}
c.clean();
return c;
}
IN Big_integer operator % (const Big_integer& b){
R int i, j;
Big_integer a = 0;
for (i = len - 1; i >= 0; i--)
{
a = a*10 + d[i];
for (j = 0; j < 10; j++) if (a < b*(j+1)) break;
a = a - b*j;
}
return a;
}
IN Big_integer operator += (const Big_integer& b){
*this = *this + b;
return *this;
}
IN bool operator <(const Big_integer& b) const{
if(len != b.len) return len < b.len;
for(R int i = len-1; i >= 0; i--)
if(d[i] != b.d[i]) return d[i] < b.d[i];
return false;
}
IN bool operator >(const Big_integer& b) const{return b < *this;}
IN bool operator<=(const Big_integer& b) const{return !(b < *this);}
IN bool operator>=(const Big_integer& b) const{return !(*this < b);}
IN bool operator!=(const Big_integer& b) const{return b < *this || *this < b;}
IN bool operator==(const Big_integer& b) const{return !(b < *this) && !(b > *this);}
string str() const{
char s[maxn]={};
for(int i = 0; i < len; i++) s[len-1-i] = d[i]+'0';
return s;
}
};
istream& operator >> (istream& in, Big_integer& x)
{
string s;
in >> s;
x = s.c_str();
return in;
}
ostream& operator << (ostream& out, const Big_integer& x)
{
out << x.str();
return out;
}
}
using namespace BigInteger;
Big_integer ans = 1;
int main(void)
{
int n;
scanf("%d", &n);
for (R int i = 2; i <= n; ++i) ans = ans * (4 * i - 2) / (i + 1);
cout << ans;
}