Catalan数 HDU 2067 HDU 1023 HDU 1131

最新推荐文章于 2017-08-05 00:20:20 发布

Southan97

最新推荐文章于 2017-08-05 00:20:20 发布

阅读量572

点赞数

分类专栏： Mathematics Number Theory 文章标签： Catalan数

本文链接：https://blog.csdn.net/Mrx_Nh/article/details/74853326

版权

Mathematics 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

Number Theory

10 篇文章 0 订阅

订阅专栏

HDU 2067：

#include <bits/stdc++.h>

using namespace std;

long long catalan[42];

void Catalan(int n) {
  catalan[0] = catalan[1] = 1; 
  for(int i = 2; i <= n; ++i) {
    catalan[i] = 0;
    for(int j = 0; j < i; ++j) {
      catalan[i] += catalan[j] * catalan[i-j-1];
    }
  }
}

int main() {
  int n, cas = 1;
  Catalan(35);
  while(scanf("%d", &n) != EOF) {
    if(n == -1) break;
    printf("%d %d %lld\n", cas++, n, 2 * catalan[n]);
  }
  return 0;
}

HDU 1023：

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    static BigInteger[] catalan = new BigInteger[108];  // Objects must be initialized befor use
    public void Catalan() {
        catalan[0] = catalan[1] = BigInteger.ONE;
        for(int i = 2; i <= 100; ++i) {
            catalan[i] = BigInteger.ZERO;
            for(int j = 0; j < i; ++j) {
                catalan[i] = catalan[i].add(catalan[j].multiply(catalan[i-j-1]));
            }
        }
    }
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        Main obj = new Main();
        obj.Catalan();
        while(cin.hasNext()) {
            int n;
            n = cin.nextInt();
            System.out.println(catalan[n]);
        }
    }
}

HDU 1131：

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    static BigInteger[] catalan = new BigInteger[108];
    public void Catalan() {
        catalan[0] = catalan[1] = BigInteger.ONE;
        for(int i = 2; i <= 100; ++i) {
            catalan[i] = BigInteger.ZERO;
            for(int j = 0; j < i; ++j) {
                catalan[i] = catalan[i].add(catalan[j].multiply(catalan[i-j-1]));
            }
        }
    }
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        Main obj = new Main();
        obj.Catalan();
        while(cin.hasNext()) {
            int n;
            n = cin.nextInt();
            if(n == 0) {
                break;
            }
            BigInteger pro = BigInteger.ONE;
            for(long i = 2; i <= n; ++i) {
                pro = pro.multiply(BigInteger.valueOf(i));
            }
            System.out.println(pro.multiply(catalan[n]));
        }
    }
}