博客详细解析了 Chiaki 序列的前缀和问题，通过打表找到数列的规律，发现每行构成等差数列，利用等差数列求和公式求解。文章提到关键在于理解每一行的首项与次数与二进制位运算的关系，并给出了计算每一行和的代码实现方式。虽然解释可能不够清晰，但提供了其他优质博客资源作为补充。
Chiaki is interested in an infinite sequence a1,a2,a3,...a1,a2,a3,..., which is defined as follows:
an={1an−an−1+an−1−an−2n=1,2n≥3an={1n=1,2an−an−1+an−1−an−2n≥3
Chiaki would like to know the sum of the first nn terms of the sequence, i.e. ∑i=1nai∑i=1nai. As this number may be very large, Chiaki is only interested in its remainder modulo (109+7109+7).
Input
There are multiple test cases. The first line of input contains an integer TT (1≤T≤1051≤T≤105), indicating the number of test cases. For each test case:
The first line contains an integer nn (1≤n≤10181≤n≤1018).
Output
For each test case, output an integer denoting the answer.
Sample Input
10
1
2
3
4
5
6
7
8
9
10Sample Output
1
2
4
6
9
13
17
21
26
32—————
卡了很久的题，想了很久，思考的时间久到当时打比赛
最低0.47元/天 解锁文章
1384
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
