5495: E-Link with EQ
内存限制：256 MB
时间限制：8.000 S
评测方式：文本比较
命题人：
提交：2
解决：1
题目描述
We often say that details can reflect the level of one's EQ. For example, at BIT, when students study in classrooms (such as A105 in the General Teaching Building) or on long tables in the library, it is often embarrassing and uncomfortable (and occasionally smelly) if another student suddenly sits next to them, which we call low EQ behavior.
Now, there is a long table containing n seats, and the BIT students will choose their seats in the following way in order to avoid low EQ behavior as much as possible.
- If the whole table is empty, randomly choose a position to sit.
- Otherwise, choose a position whose shortest distance to other students is maximized. If there are more than one, randomly choose one of them with equal possibility.
When the farthest distance is 1 (i.e., he will sit next to a classmate anyway), students will sit at a different table to avoid low EQ behavior, and then we will call the table full.
Now, link wants to know the expected number of people seated in the table when the table is full.
Now, there is a long table containing n seats, and the BIT students will choose their seats in the following way in order to avoid low EQ behavior as much as possible.
- If the whole table is empty, randomly choose a position to sit.
- Otherwise, choose a position whose shortest distance to other students is maximized. If there are more than one, randomly choose one of them with equal possibility.
When the farthest distance is 1 (i.e., he will sit next to a classmate anyway), students will sit at a different table to avoid low EQ behavior, and then we will call the table full.
Now, li
输入
The input consists of multiple test cases.
The first line contains an integer T (1≤T≤105) -- the number of test cases.
For each testcase, there is only one integer n (1≤n≤106) in a single line, which is the length of the table.
The first line contains an integer T (1≤T≤105) -- the number of test cases.
For each testcase, there is only one integer n (1≤n≤106) in a single line, which is the length of the table.
输出
For each testcase, output the answer modulo 109+7.
You may find the way to modulo a rational number in Problem 1006.
You may find the way to modulo a rational number in Problem 1006.
样例输入 复制
5
1
2
3
4
2021样例输出 复制
1
1
666666673
2
420089906