当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1291: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
来自杭电HDUOJ的附加信息
Author lcy
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1291

最后修改于 2020-10-25T22:43:38+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)