本文介绍了Chiaki Sequence的定义，并详细解析了如何找出序列中前n项的和模(10^9 + 7)的规律。通过观察样例输出，可以发现数字的出现频率与其2进制表示中最后一位1的位置有关。利用这个规律，结合等差数列求和公式，可以解决这个问题。代码实现中使用了二分查找确定第n个数，并计算其贡献的和。
Chiaki Sequence Revisited
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1624 Accepted Submission(s): 437
Problem Description
Chiaki is interested in an infinite sequence a1,a2,a3,..., which is defined as follows:
an={1an−an−1+an−1−an−2n=1,2n≥3
Chiaki would like to know the sum of the first n terms of the sequence, i.e. ∑i=1nai. As this number may be very large, Chiaki is only interested in its remainder modulo (109+7).
Input
最低0.47元/天 解锁文章
228
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
