hdu 1023 catalan

来源：互联网发布：街霸5 网络编辑：程序博客网时间：2024/04/30 00:06
打印一个Catalan数列表。模板题。
#include <cstdio>#include <stack>#include <set>#include <iostream>#include <string>#include <vector>#include <queue>#include <functional>#include <cstring>#include <algorithm>#include <cctype>#include <string>#include <map>#include <iomanip>#include <cmath>#define LL long long#define ULL unsigned long long#define SZ(x) (int)x.size()#define Lowbit(x) ((x) & (-x))#define MP(a, b) make_pair(a, b)#define MS(arr, num) memset(arr, num, sizeof(arr))#define PB push_back#define F first#define S second#define ROP freopen("input.txt", "r", stdin);#define MID(a, b) (a + ((b - a) >> 1))#define LC rt << 1, l, mid#define RC rt << 1|1, mid + 1, r#define LRT rt << 1#define RRT rt << 1|1#define BitCount(x) __builtin_popcount(x)#define BitCountll(x) __builtin_popcountll(x)#define LeftPos(x) 32 - __builtin_clz(x) - 1#define LeftPosll(x) 64 - __builtin_clzll(x) - 1const double PI = acos(-1.0);const int INF = 0x3f3f3f3f;using namespace std;const double eps = 1e-8;const int MAXN = 300 + 10;const int MOD = 1000007;const int M=1e5;const int N=110;typedef pair<int, int> pii;typedef pair<int, string> pis;int n;int a[N][1000];  // a[i][0] 表示h(i)的长度。数是倒着存的。void ktl(){    int i,j;    a[1][0]=1;    a[1][1]=1;    a[2][0]=1;    a[2][1]=2;    int len=1;    for (i=3;i<N;i++) {        int yu=0;        for (j=1;j<=len;j++) {  // 大数乘法            int t=a[i-1][j]*(4*i-2)+yu;            yu=t/10;            a[i][j]=t%10;        }        while(yu){            a[i][++len]=yu%10;            yu/=10;        }        for (j=len;j>0;j--) {   // 大数除法            int t=a[i][j]+yu*10;            a[i][j]=t/(i+1);            yu=t%(i+1);        }        while(!a[i][len]){            len--;        }        a[i][0]=len;    }}int main(){    int i,j;    ktl();    while(~scanf("%d",&n))    {        for (i=a[n][0];i>0;i--){            printf("%d",a[n][i]);        }        puts("");    }}
0 0