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

建议使用的浏览器:

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

2643:Rank

题目描述
Recently in Teddy's hometown there is a competition named "Cow Year Blow Cow".N competitors had took part in this competition.The competition was so intense that the rank was changing and changing.
Now the question is:
How many different ways that n competitors can rank in a competition, allowing for the possibility of ties.
as the answer will be very large,you can just output the answer MOD 20090126.
Here are the ways when N = 2:
P1 < P2
P2 < P1
P1 = P2
输入解释
The first line will contain a T,then T cases followed.
each case only contain one integer N (N <= 100),indicating the number of people.
输出解释
One integer pey line represent the answer MOD 20090126.
输入样例
2
2
3
输出样例
3
13
来自杭电HDUOJ的附加信息
Author teddy
Recommend teddy

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

题目来源 百万秦关终属楚

源链接: HDU-2643

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

共提交 0

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