TimeLimit: 4000/2000 MS (Java/Others) MemoryLimit: 131072/131072 K (Java/Others)
64-bit integer IO format:%I64d
未提交 | 登录后收藏
Problem Description
OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there's no j(l<=j<=r,j<>i) satisfy a
i mod a
j=0,now OO want to know ∑i=[1...n] ∑j=[i...n] f(i,j) mod （109+7）.
Input
There are multiple test cases. Please process till EOF.
In each test case:
First line: an integer n(n<=10^5) indicating the size of array
Second line:contain n numbers a
i(0<a
i<=10000)
Output
For each tests: ouput a line contain a number ans.