首页 > ACM题库 > HDU-杭电 > Hdu 1291 Closing Ceremony of Sunny Cup 待解决 [解题报告] C++
2013
12-04

Hdu 1291 Closing Ceremony of Sunny Cup 待解决 [解题报告] C++

Closing Ceremony of Sunny Cup

问题描述 :

The 3rd Zhejiang Provincial Collegiate Programming Contest will be held at Zhejiang University in 05/13/2006. The contest attracts many excellent programmer, of course, including 18 acmers of HDU,They are Lu xiaojun, Wang rongtao,Zhou feng;Gao bo, Li weigang, Xu haidong;Lin le,Lin jie,Li huansen;Mou changqing, Zhou lin, Wang dongdong;Ying qili,Lai li,Weng jianfei;Wang jun,Wang jianxing and Liu qi.

I don’t know which team will be champion,but I know that closure will be held at Linshui Hall,which is a very beautiful classroom near the river.

Now I am thinking a question, supposing attendance is a square number (N^2) and the number of the seat is a square number too( N lines ,and N seats each line), If orgazizer is so bored that they arrange sits according to player’s height (Supposing all players’ heights are dirrerent). The arranging rules can be described as following:
1. A cannot sit at back of B when A is short than B.
2. A cannot sit at right of B when A is short than B.

The question left to you is that: " How many dirrerent arranging styles you can get according to the rules?"

输入:

Input file contains multiple test cases, and each test case is described with an integer N(1<=N<=20),you can get its meaning throught problem description.

输出:

For each test case ,you should output a result,and one result per line.

样例输入:

2
3

样例输出:

2
42


  1. 学算法中的数据结构学到一定程度会乐此不疲的,比如其中的2-3树,类似的红黑树,我甚至可以自己写个逻辑文件系统结构来。