[POJ] 2084 -> Game of Connections
来源:互联网 发布:淘宝如何做爆款 编辑:程序博客网 时间:2024/05/22 11:32
Game of Connections
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7709 Accepted: 3891
Description
This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, . . . , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some straight line segments to connect them into number pairs. Every number must be connected to exactly one another.
And, no two segments are allowed to intersect.
It's still a simple game, isn't it? But after you've written down the 2n numbers, can you tell me in how many different ways can you connect the numbers into pairs? Life is harder, right?
And, no two segments are allowed to intersect.
It's still a simple game, isn't it? But after you've written down the 2n numbers, can you tell me in how many different ways can you connect the numbers into pairs? Life is harder, right?
Input
Each line of the input file will be a single positive number n, except the last line, which is a number -1.
You may assume that 1 <= n <= 100.
You may assume that 1 <= n <= 100.
Output
For each n, print in a single line the number of ways to connect the 2n numbers into pairs.
Sample Input
23-1
Sample Output
25
解题思路:卡特兰数的应用 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452, ...有递归式 h(n)=((4*n-2)/(n+1))*h(n-1);
Code:
import java.math.BigInteger;import java.util.Scanner;public class Main {static BigInteger fun(int n){if(n==0 || n==1) return new BigInteger("1");return fun(n-1).multiply(new BigInteger(String.format("%d", 4*n-2))).divide(new BigInteger(String.format("%d", n + 1)));}public static void main(String[] args){Scanner cin=new Scanner(System.in);while(cin.hasNext()){int n = cin.nextInt();if(n == -1) break;System.out.println(fun(n));}}}
0 0
- POJ 2084 Game of Connections
- poj 2084 Game of Connections
- POJ 2084 Game of Connections
- POJ-2084-Game of Connections
- poj 2084 Game of Connections
- poj 2084 Game of Connections
- [POJ] 2084 -> Game of Connections
- POJ 2084 Game of Connections
- poj 2084 Game of Connections
- POJ 2084 Game of Connections 笔记
- POJ-2084(Catalan数专题)(Game of Connections )
- POJ 2084 Game of Connections 卡特兰数
- POJ 2084 Game of Connections(卡特兰数,JAVA)
- POJ 2084 Game of Connections(JAVA练习)
- 卡特兰数:poj 2084 Game of Connections+hdu 1023
- Poj 2084 Game of Connections(高精度卡特兰数)
- POJ 2084:Game of Connections 大数+卡特兰数
- poj 2084 Game of Connections (卡特兰数,大数乘除)
- 进阶_计时器(postDelayed实现)_150503
- HDU ACM 1698 Just a Hook->线段树+区间修改
- PhpMyAdmin mbstring missing
- 黑马程序员_Java语言_面向对象__
- [Apio2011]方格染色
- [POJ] 2084 -> Game of Connections
- DownloadManager功能介绍
- [Unity插件]Behavior Designer:节点
- c++之超越c的语法03-变量初始化
- 字符串匹配:蛮力、KMP
- HDU 5223 - GCD (思维)
- Struts2源码分析(一) 一一一 ModelDrivenInterceptor
- 网页图片轮播
- Android——Handler类