F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Road To The 3rd Building

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/262144 K (Java/Others)
Total Submission(s): 1472    Accepted Submission(s): 593


Problem Description
Because of the thriller adventure game The 3rd Building, there are fewer and fewer students who would like to go to the 3rd Building. So few students are working in the studio in the 3rd Building. Students are even more reluctant to go to the 3rd Building for experiments, which are also annoying.

Kanade takes responsibility to improve this status. She thinks it a good idea to decorate the ginkgo trees along the road to the 3rd Building, making them cute. There are $n$ ginkgo trees that are planted along the road, numbered with $1\ldots n$. Each tree has a cute value. The cute value of tree $i$ is $s_i$.

Kanade defines a plan as an ordered pair $(i,j)$, here $1\le i\le j\le n$. It means a student will appear at the position of the tree $i$ magically, walk along the road, and finally stop walking at the position of the tree $j$. The cute level of a plan is the average of the cute value of the trees visited. Formally, the cute level of plan $(i,j)$ is $\frac{1}{j-i+1}\sum_{k=i}^j s_k$.

Kanade wants to know the mathematical expectation of the cute level if a student will take a plan among all these plans in a uniformly random way. But she is busy with learning Computer Networking, would you help her?
 

Input
The first line of the input contains an integer $T$ the number of testcases. You should process these testcases independently.

The first line of each testcase contains an integer $n$ the number of ginkgo trees.

The second line of each testcase contains $n$ integers $s_i$ the cute value of each ginkgo tree, space-separated.

$1\le T\le 20,1\le n\le 2\times 10^5,1\le s_i\le 10^9$

It is guaranteed that $\sum n\le 10^6$.
 

Output
For each testcase, output the answer in the fraction form modulo $10^9+7$ in one line. That is, if the answer is $\frac{P}{Q}$, you should output $P\cdot Q^{-1}\bmod (10^9+7)$, where $Q^{-1}$ denotes the multiplicative inverse of $Q$ modulo $10^9+7$.
 

Sample Input
3 3 1 3 2 6 1 1 4 5 1 4 9 7325 516 56940 120670 16272 15007 337527 333184 742294
 

Sample Output
83333336 188888893 303405448
 

Hint
The answer to the first testcase is 25/12.
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2023 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2023-06-01 01:04:28, Gzip enabled