简单Catalan数-hdu-1130-How Many Trees?
来源:互联网 发布:c专家编程 pdf 下载 编辑:程序博客网 时间:2024/05/21 22:50
题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=1130
题目意思:
catalan数模型。求出第n个catalan数。(n<=100)
解题思路:
直接利用catalan数递推h[n]=(4*n-2)/(n+1)*h[n-1] (n>1)
java水过。
代码:
import java.util.*;import java.math.*;public class Main {/** * @param args */static BigInteger []h = new BigInteger[120];static public void init(){h[1]=BigInteger.valueOf(1);h[0]=h[1];for(int i=2;i<=100;i++)h[i]=h[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));}public static void main(String[] args){// TODO Auto-generated method stubinit();Scanner cin=new Scanner(System.in);int n;while(cin.hasNextInt()){n=cin.nextInt();System.out.println(h[n]);}}}
- 简单Catalan数-hdu-1130-How Many Trees?
- hdu 1130 How Many Trees?(Catalan数)
- hdu 1130 How Many Trees?(二叉树节点的Catalan数)
- HDU 1130 How Many Trees?(Catalan + 大数)
- UVA10303 - How Many Trees?(java大数+catalan数)
- hdu 1130 How Many Trees?
- HDU 1130 How Many Trees?
- hdu 1130 How Many Trees?
- hdu 1130(How Many Trees?)
- hdu 1130 How Many Trees?
- hdu 1130 How Many Trees?
- hdu 1130 How Many Trees
- hdu 1130 How Many Trees?
- HDU 1130 How Many Trees?
- HDU 1130 How Many Trees?
- HDU 1130 How Many Trees?
- HDU 1130 How Many Trees?
- HDU - 1130 How Many Trees?
- 验证数字的正则表达式集 (百度来的)
- 阶乘、阶乘之和的函数式风格实现
- JAVA 环境变量的基本配置及检测方式
- SQLServer 时间分组
- 如何解决Java.lang.NoClassDefFoundError--第一部分
- 简单Catalan数-hdu-1130-How Many Trees?
- iOS学习笔记03——以编码的方式实现Auto Layout自动布局(二)
- VS2010 C++工程运行提示找不到MSVCP100D.dll
- [Google] 平面上有很多点( x,y均为整数) ,求一个点 ,使该点到 所有点的 曼哈顿距离和 最小
- Android4.2蓝牙介绍
- OCP-1Z0-052-V8.02-3题
- 第二篇 创建第一个Android工程HelloWorld
- 网络子系统51_ip协议报文分片
- [Google] 将新的节点插入到 完全二叉树中,要求 O(logn)