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

建议使用的浏览器：

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

6481：A Math Problem

题目描述
Have become a sophomore, WNJXYK found that his recent combinatorial mathematics homework is too hard. Homework always matters a lot. To get high grades, he has no choice but to ask you for help.
Here is the problem: Can you calculate the numbers of ways to put 2$n$ different balls into exact same boxes and each box contains exactly 2 balls.
输入解释
The input starts with one line contains exactly one positive integer $T$ which is the number of test cases.
Each test case contains one line with exactly one positive integer $n$ which has been explained above.
输出解释
For each test case, output one line containing “y” where y is the number of different ways modulo 2^64.
输入样例 
3
1
2
100
输出样例 
1
3
7119879074588212521
提示
1<=T<=10,1<=N<=10^18
For test case 1, it is obviously that there is only one way to do so.
For test case 2, we could assume that 4 different are indexed from 1 to 4. Three different splitting ways are {{1,2}, {3,4}}, {{1,3}, {2,4}} and {{1,4}, {2,3}}.
来自杭电HDUOJ的附加信息
Recommend liuyiding
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2018 黑龙江省大学生程序设计竞赛
源链接： HDU-6481
最后修改于 2020-10-25T23:31:44+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)