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

建议使用的浏览器:

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

5673:Robot

题目描述
There is a robot on the origin point of an axis.Every second, the robot can move right one unit length or do nothing.If the robot is
on the right of origin point,it can also move left one unit length.A route is a series of movement. How many different routes there are
that after $n$ seconds the robot is still located on the origin point?
The answer may be large. Please output the answer modulo $1,000,000,007$
输入解释
There are multiple test cases. The first line of input contains an integer $T (1\leq T\leq 100)$ indicating the number of test cases. For each test case:

The only line contains one integer $n(1\leq n \leq 1,000,000)$.
输出解释
For each test case, output one integer.
输入样例
3
1
2
4
输出样例
1
2
9
来自杭电HDUOJ的附加信息
Recommend wange2014

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

源链接: HDU-5673

最后修改于 2020-10-25T23:24:42+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
12000/6000MS(Java/Others) 65536/65536K(Java/Others)