input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from itertools import combinations
N = int(eval(input()))
A = [int(n) for n in input().split()]
print((sum([i*j for i,j in combinations(A, 2)])%(10**9+7))) | N = int(eval(input()))
A = [int(n) for n in input().split()]
ans = 0
for i in range(0, N-1):
ans += A[i]*sum(A[i+1:])
print((ans%(10**9+7)))
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
k = 0
for i in range(n - 1):
for l in range(i + 1, n):
k += a[i] * a[l]
x = k % (10 ** 9 + 7)
print(x)
| n = int(eval(input()))
a = list(map(int, input().split()))
k = 0
num = sum(a)
t = 10 ** 9 + 7
for i in a:
num -= i
k += num * i
ans = k % t
print(ans)
| p02572 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
m = 10 ** 9 + 7
for i in range(n - 1):
tmp_sum = sum(a[:i+1])
ans += tmp_sum * a[i+1]
if ans > m:
ans = ans % m
print(ans)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
m = 10 ** 9 + 7
tmp_sum = 0
for i in range(n - 1):
tmp_sum += a[i]
tmp_sum %= m
ans += tmp_sum * a[i+1]
ans %= m
print(ans)
if __name__ == '__main__':
main()
| p02572 |
N = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 +7
ans = 0
for i in range(len(a)-1):
ans +=a[i]*(sum(a[i+1:len(a)]))
print((ans%mod)) | N = int(eval(input()))
a = list(map(int, input().split()))
a.reverse()
mod = 10**9 +7
ans = 0
S=[0]
for i in range(0,N):
S.append(S[i]+a[i])
ans = 0
for j in range(len(a)):
ans +=(a[j]*S[j])
print((ans%mod)) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(0, N-1):
for j in range(i+1, N):
ans += A[i]*A[j]
print((ans % 1000000007)) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
tmp = 0
for i in range(N-2, -1, -1):
tmp += A[i+1]
ans += A[i] * tmp
print((ans % 1000000007)) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
sigma = 0
for i in range(len(a)-1):
start = a[i]
after = sum(a[i+1:])
if after >= (10**9 + 7):
after = after % (10**9+7)
sigma = sigma + start * after
if sigma >= (10**9 + 7):
sigma = sigma % (10**9+7)
print(sigma)
| n = int(eval(input()))
a = list(map(int, input().split()))
sigma = 0
after = sum(a[0:])
for i in range(len(a)-1):
start = a[i]
after = after - a[i]
sigma = sigma + start * after
if sigma >= (10**9 + 7):
sigma = sigma % (10**9+7)
print(sigma)
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
sigma = 0
after = sum(a[0:])
for i in range(len(a)-1):
start = a[i]
after = after - a[i]
sigma = sigma + start * after
if sigma >= (10**9 + 7):
sigma = sigma % (10**9+7)
print(sigma)
| n = int(eval(input()))
a = list(map(int, input().split()))
sigma = sum(a)
count = 0
for i in range(len(a)-1):
start = a[i]
sigma = sigma-a[i]
count = count + start * sigma
if count >= 10**9+7:
count = count % (10**9+7)
print(count) | p02572 |
import itertools
MOD = 1000000007
N=int(eval(input()))
A = list(map(int, input().split()))
answer = 0
comb_list = list(itertools.combinations(A, 2))
for c in comb_list :
answer += int(c[0]) * int(c[1])
print((answer % MOD)) | MOD = 1000000007
N=int(eval(input()))
A = list(map(int, input().split()))
answer = 0
s = sum(A)
for a in A:
s -=a
answer += (a * s)
print((answer%MOD)) | p02572 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = 0
for i in range(1,n):
for j in range(i):
pro = a[i] * a[j]
s = s + pro
mod = s % (10**9 + 7)
print(mod)
| n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a) ** 2
b = []
for i in range (n):
b.append(a[i]**2)
s = (s - sum(b)) // 2
mod = s % (10**9 + 7)
print(mod)
| p02572 |
N=int(eval(input()))
A=list(map(int,input().split()))
MOD=1000000007
c=0
import itertools
a=list(itertools.combinations(A,2))
for i in range(len(a)):
c+=(a[i][0]*a[i][1])
c%=MOD
print(c) | N=int(eval(input()))
A=list(map(int,input().split()))
MOD=10**9+7
c=0
for i in range(len(A)):
c+=A[i]*(sum(A)-A[i])
print((c//2%MOD))
| p02572 |
N=int(eval(input()))
A=list(map(int,input().split()))
MOD=10**9+7
c=0
for i in range(len(A)):
c+=A[i]*(sum(A)-A[i]%MOD)
print((c//2%MOD))
| N = int(eval(input()))
A = list(map(int, input().split()))
c=0
d=sum(A)
for i in range(0,N-1):
d-=A[i]
c+=A[i]*d
if(c>10**9+7):
c%=(10**9+7)
print(c)
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
c=0
d=sum(A)
for i in range(0,N-1):
d-=A[i]
c+=A[i]*d
if(c>10**9+7):
c%=(10**9+7)
print(c)
| N=int(eval(input()))
A=list(map(int,input().split()))
A2=0
for i in range(len(A)):
A2+=A[i]**2
c=(sum(A))**2-A2
print((c//2%(10**9+7)))
| p02572 |
from itertools import combinations
n=int(eval(input()))
num = list(map(int,input().split()))
ans = 0
for i in combinations(num,2):
s = (i[0]*i[1])%(10**9+7)
ans += s
new = ans%(10**9+7)
print(new) | n=int(eval(input()))
A = list(map(int,input().split()))
s=sum(A)
all=0
for i in A:
s -= i
all += (i*s)
ans=all%(10**9+7)
print(ans) | p02572 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = 0
for i in range(n-1):
for j in range(n-1-i):
if a[i] >= 1000000007:
while a[i] >= 1000000007:
a[i] = a[i] - 1000000007
hoge = a[i] * a[i+1+j]
elif a[i+1+j] >= 1000000007:
while a[i+1+j] >= 1000000007:
a[i+1+j] = a[i+1+j] - 1000000007
hoge = a[i]*a[i+1+j]
else:
hoge = a[i] * a[i+1+j] % 1000000007
while hoge >= 1000000007:
hoge = hoge - 1000000007
ans = ans + hoge
ans = ans % 1000000007
print(ans) | n = int(eval(input()))
a = [int(x) for x in input().split()]
s = sum(a)
ans = 0
mod = 10 ** 9 + 7
for i in range(n-1):
s -= a[i]
ans += a[i] * s % mod
ans = ans % mod
print(ans) | p02572 |
N = int(eval(input()))
ARR = list(map(int, input().split()))
def calculate(n, arr):
mod = 1000000000 + 7
result = 0
for i in range(n):
for j in range(i + 1, n):
result += (arr[i] * arr[j]) % mod
print((result % mod))
calculate(N, ARR)
| N = int(eval(input()))
ARR = list(map(int, input().split()))
def calculate(n, arr):
mod = 1000000000 + 7
result = 0
rightTotal = sum(arr)
for i in range(n-1):
rightTotal -= arr[i]
result += (arr[i] * rightTotal) % mod
print((result % mod))
calculate(N, ARR) | p02572 |
MOD = 1e9 + 7
N = int(eval(input()))
A = list(map(int, input().split()))
c = 0
for i in range(N):
for j in range(i + 1, N):
if i == j:
continue
c += (A[i] % MOD) * (A[j] % MOD)
c %= MOD
print((int(c))) | MOD = 1000000007
N = int(eval(input()))
A = list(map(int, input().split()))
c = 0
S = 0
for a in A:
S += a % MOD
S %= MOD
for i in range(N):
c += (A[i] % MOD) * ((S - A[i] % MOD) % MOD)
c %= MOD
mod = pow(2, -1, 1000000007)
c = c * mod
c %= MOD
print((int(c))) | p02572 |
from itertools import accumulate
n = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9+7
Acum = list(accumulate(A))
ans = 0
for i, a in enumerate(reversed(A[1:])):
ans += Acum[n-i-2]*a
ans %= MOD
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
S = sum(A)
T = sum([x**2 for x in A])
print(((S**2-T)//2 % (10**9+7)))
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans, m = 0, int(1e9+7)
for i in range(n-1):
ans = (ans + a[i]*sum(a[i+1:])) % m
print(ans)
| n = int(eval(input()))
a = [0] + list(map(int, input().split()))
for i in range(1, n+1): a[i] += a[i-1]
ans, m = 0, int(1e9+7)
for i in range(1, n):
ans = (ans + (a[i]-a[i-1])*(a[n]-a[i])) % m
print(ans)
| p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000007
s = 0
for i in range(N - 1):
s += (A[i]*sum(A[i+1:]))%mod
print((s%mod)) | N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000007
s = 0
S = sum(A)
for i in range(N - 1):
S -= A[i]
s += (A[i]*(S))%mod
print((s%mod)) | p02572 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
mod = 10**9+7
for i in range(n):
for j in range(i+1,n):
ans += (a[i]*a[j])%mod
print((ans%mod)) | n = int(eval(input()))
a = list(map(int,input().split()))
arr = [0]*(n+1)
ans = 0
mod = 10**9+7
for i in range(n):
arr[i+1] += arr[i]+a[i]
for i in range(n):
ans += (a[i]*(arr[n]-arr[i+1]))%mod
print((ans%mod)) | p02572 |
N = int(eval(input()))
A_list = [int(_) for _ in input().split()]
ans = 0
for i in range(len(A_list)):
if i <= N-1:
if A_list[i] == 0:
continue
j = i+1
ans += sum([x*A_list[i]%(10**9+7) for x in A_list[j:N]])
ans = ans%(10**9+7)
print(ans) | N = int(eval(input()))
A_list = [int(_) for _ in input().split()]
c = 10**9+7
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
inv = modinv(2, c)
sum_of_a = sum(A_list) % c
sum_of_sq_a = sum([i**2 for i in A_list]) % c
ans = (sum_of_a**2 % c - sum_of_sq_a)*inv %c
print(ans) | p02572 |
##C - Sum of product of pairs
N = int(eval(input()))
A = list(map(int,input().split()))
import itertools
B = list(itertools.combinations(A,2))
print((sum (list([x[0] * x[1] for x in B])) % (10**9+7) )) | ##C - Sum of product of pairs
##累積和
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N-1):
ans += A[i]*sum(A[i+1:])
print((ans % (10**9+7))) | p02572 |
import itertools
n=int(eval(input()))
l=list(map(int,input().split()))
c = list(itertools.combinations(l, 2))
sum=0
for i in range(len(c)):
sum+=c[i][0]*c[i][1]
print((sum%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
sum=0
f=0
for i in range(n-1):
f=f+a[i]
sum+=f*a[i+1]
print((sum%(10**9+7))) | p02572 |
n = eval(input())
max = 10**9 + 7
a_list = [int(a) % max for a in input().split(" ")]
sum = 0
for i in range(0, len(a_list)-1):
for j in range(i+1, len(a_list)):
sum += a_list[i] * a_list[j]
sum = sum % max
print(sum)
| n = eval(input())
max = 10**9 + 7
a_list = [int(a) % max for a in input().split(" ")]
a_sum = sum(a_list)
total = 0
for i in range(0, len(a_list)-1):
a_sum -= a_list[i]
total += a_list[i] * a_sum
total = total % max
print(total)
| p02572 |
# import sys
# import math #sqrt,gcd,pi
# import decimal
import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce
mod = int(1e9+7)
# mod = 998244353
INF = 1<<50
def readInt():
return list(map(int,input().split()))
def main():
n = int(eval(input()))
a = readInt()
ans = 0
for i in range(n-1):
for j in range(i+1,n):
ans += a[i] * a[j]
ans %= mod
print(ans)
return
if __name__=='__main__':
main()
| # import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce
mod = int(1e9+7)
# mod = 998244353
INF = 1<<50
def readInt():
return list(map(int,input().split()))
def main():
n = int(eval(input()))
a = readInt()
c_sum = [0]
for i in range(n):
c_sum.append(c_sum[i]+a[i])
ans = 0
for i in range(n-1):
ans += a[i] * (c_sum[-1] - c_sum[i+1])
ans %= mod
print(ans)
return
if __name__=='__main__':
main()
| p02572 |
import itertools
def main():
N = int(eval(input()))
A = [int(c) for c in input().split() if int(c) > 0]
MOD = int(10**9+7)
mono = 0
bi = 0
for x in A:
mono += x
#mono %= MOD
bi += x**2
#bi %= MOD
ans = (mono**2 - bi)//2
ans %= MOD
print(ans)
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
A = [int(c) for c in input().split() if int(c) > 0]
MOD = int(10**9+7)
mono = 0
bi = 0
for x in A:
mono += x
#mono %= MOD
bi += x**2
#bi %= MOD
ans = (mono**2 - bi)//2
ans %= MOD
print(ans)
if __name__ == '__main__':
main() | p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
pr=[a[i]*a[j] for i in range(len(a)-1) for j in range(i+1,len(a))]
print((sum(pr)%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
sum=0
for i in range(len(a)-1):
for j in range(i+1,len(a)):
sum+=a[i]*a[j]
print((sum%(10**9+7))) | p02572 |
n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
sum_n = [0]*n
sumall = sum(l)
sum_n = list(sumall-sum(l[:i+1]) for i in range(n))
for i in range(n):
ans += ((l[i]*sum_n[i])%1000000007)
print((ans%1000000007)) | n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
sum_n = [0]*n
sum_n[0] = l[0]
sumall = sum(l)
for i in range(1,n):
sum_n[i] = sum_n[i-1] + l[i]
for i in range(n):
ans += ((l[i]*(sumall-sum_n[i]))%1000000007)
print((ans%1000000007)) | p02572 |
"""C."""
import sys
input = sys.stdin.readline # noqa: A001
n = int(eval(input()))
a = list(map(int, input()[:-1].split(' ')))
MOD_VALUE = pow(10, 9) + 7
result = 0
for i in range(n - 1):
result += a[i] * sum(a[i + 1:])
if result < MOD_VALUE:
print(result)
else:
print((result % MOD_VALUE))
| """C."""
import sys
input = sys.stdin.readline # noqa: A001
n = int(eval(input()))
a = list(map(int, input()[:-1].split(' ')))
MOD_VALUE = 10**9 + 7
result = 0
a_sum = sum(a)
for i, v in enumerate(a):
result += v * (a_sum - v)
a_sum -= v
if result < MOD_VALUE:
print(result)
else:
print((result % MOD_VALUE))
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
M = 10**9 + 7
cnt = 0
for i in range(N):
cnt += A[i] * sum(A[i+1:])
print((cnt%M)) | n = int(eval(input()))
A = list(map(int, input().split()))
M = 10**9 + 7
S = sum(A)
S2 = sum([x**2 for x in A])
print((((S**2 - S2)// 2)%M))
| p02572 |
from itertools import combinations
N=int(eval(input()))
A=list(map(int,input().split()))
ans=0
for i in range(N-1):
ans+=A[i]*(sum(A[i+1:]))
print((ans%(10**9+7))) | from itertools import combinations
N=int(eval(input()))
A=list(map(int,input().split()))
zen=sum(A)
ans=0
part=0
for i in range(N-1):
part+=A[i]
ans+=A[i]*(zen-part)
print((ans%(10**9+7))) | p02572 |
import itertools
N = int(eval(input()))
A = list(map(int, input().split()))
C = list(itertools.combinations(A, 2))
ans = 0
for i, j in C:
ans += i * j
ans = ans % (1e9 + 7)
print((int(ans)))
| n = int(eval(input()))
A = list(map(int, input().split()))
S = sum(A)
S2 = sum([x * x for x in A])
print(((S*S-S2)//2 % 1000000007)) | p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
s = 0
mod = 10**9 + 7
for i in range(N-1):
for j in range(i+1,N):
n = A[i] * A[j]
n %= mod
s += n
s %= mod
print(s) | N = int(eval(input()))
A = list(map(int,input().split()))
s = 0
mod = 10**9 + 7
for i in range(N-1):
n = A[i] * A[i+1]
n = n % mod
s += n
s %= mod
A[i+1] += A[i]
print(s) | p02572 |
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys,collections
N = int(sys.stdin.readline())
a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
#print(a)
di = 10**9+7
s = 0
for i in range(N):
for j in range(i+1,N):
#print(a[i],a[j])
s = (s + (a[i]*a[j])%di)%di
print(s)
| #!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys,collections
N = int(sys.stdin.readline())
a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
#print(a)
di = 10**9+7
cum = [0]*(N+1)
for i in range(N)[::-1]:
cum[i] = (cum[i+1] + a[i])%di
s = 0
for i in range(N):
s = (s + (a[i]*cum[i+1])%di)%di
# for j in range(i+1,N):
# #print(a[i],a[j])
# s = (s + (a[i]*a[j])%di)%di
print(s)
# import sys,collections
# sys.setrecursionlimit(1000000)
# INF = float("inf")
# Q = int(sys.stdin.readline())
# ab = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(Q)) # multi line with multi param
# N = 1000001
# cum=[0]*(N+1)
# for l,r in ab:
# cum[l] += 1
# if r+1 < N+1: cum[r+1] -= 1
# ret = cum[0]
# for i in range(N):
# cum[i+1] += cum[i]
# ret = max(ret,cum[i+1])
# print(ret)
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n-1):
for j in range(i+1, n):
ans += a[i] * a[j]
ans %= 10 ** 9 + 7
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
sum = sum(a) - a[0]
ans = 0
for i in range(n):
ans += a[i] * sum
if (i == n-1):
break
else:
sum -= a[i+1]
ans %= 10 ** 9 + 7
print(ans) | p02572 |
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
SUM = []
for i in range(N):
SUM.append(sum(A[i:])%(10**9+7))
ans = 0
for i in range(N-1):
ans += A[i]*SUM[i+1]
ans = ans%(10**9+7)
print(ans)
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
SUM = [sum(A)]
for i in range(1,N):
SUM.append((SUM[i-1]-A[i-1])%(10**9+7))
ans = 0
for i in range(N-1):
ans += A[i]*SUM[i+1]
ans = ans%(10**9+7)
print(ans)
if __name__ == '__main__':
main() | p02572 |
N = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for i in range(N):
for j in range(i+1,N):
tmp = a[i]*a[j]
ans += tmp
m = 10**9 + 7
ans = ans % m
print(ans) | N = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
sum = 0
for i in range(N):
sum += a[i]
for i in range(N-1):
sum -= a[i]
ans += a[i]*sum
m = 10**9 + 7
ans = ans % m
print(ans) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
x = 0
ans = 0
for i in range(len(A)):
ans += A[i] * x % MOD
x += A[i] % MOD
print((ans%MOD)) | N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
max_edge = sum(A)
tmp = 0
for num in A:
tmp += num ** 2
print(((max_edge ** 2 - tmp) // 2 % MOD)) | p02572 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
for i in range(N):
A[i] = A[i] % (1e9 + 7)
sum = 0
for i in range(N-1):
for j in range(i+1,N):
sum += A[i]*A[j] % (1e9 + 7)
print((int(sum % (1e9 + 7))))
| import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
mod = int(1e9+7)
sum = 0
row = 0
for ii in range(N-1):
i = N-2-ii
row += A[i+1]
row %= mod
sum += A[i] * row
sum %= mod
print(sum) | p02572 |
from sys import setrecursionlimit
from collections import Counter
from collections import defaultdict
from collections import deque
from heapq import heapify
from heapq import heappop
from heapq import heappush
from time import time
import re
setrecursionlimit(10**9)
mod=10**9+7
inf=10**18
n=int(eval(input()))
a=[int(x) for x in input().split()]
ans=0
for i in range(n):
ans+=a[i]*sum(a[i+1:])
ans%=mod
print(ans) | from sys import setrecursionlimit
from collections import Counter
from collections import defaultdict
from collections import deque
from heapq import heapify
from heapq import heappop
from heapq import heappush
from time import time
import re
setrecursionlimit(10**9)
mod=10**9+7
inf=10**18
n=int(eval(input()))
a=[int(x) for x in input().split()]
cum_a=[]
for i in range(n):
if i==0:cum_a.append(a[i])
else:cum_a.append(cum_a[-1]+a[i])
ans=0
for i in range(n-1):
ans+=a[i]*(cum_a[n-1]-cum_a[i])
ans%=mod
print(ans) | p02572 |
# C
N=int(eval(input()))
A=list(map(int,input().split()))
p=10**9+7
Asum=[sum(A[i+1:])%p for i in range(len(A))]
print((sum((A[i]*Asum[i])%p for i in range(N))%p)) | # C
N=int(eval(input()))
A=list(map(int,input().split()))
p=10**9+7
sumA = sum(A)
sumA_2 = sum([a**2 for a in A])
print((((sumA**2-sumA_2)//2)%p)) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
goukei = 0
for i in range(N):
a = A[0]
del A[0]
Agoukei = sum(A)
goukei = goukei + a*Agoukei
k = 10**9 + 7
print((goukei%k)) | N = int(eval(input()))
A = list(map(int, input().split()))
goukei = 0
sumA = sum(A)
for i in range(N):
a = A[i]
sumA = sumA - a
goukei = goukei + sumA*a
k = 10**9 + 7
print((goukei%k)) | p02572 |
N = int(eval(input()))
As = list([int(x) for x in input().split(" ")])
result = 0
MOD = 10**9+7
for i in range(len(As)-1):
tmp = As[i] * (sum(As[i+1:]) % MOD)
result += tmp
result %= MOD
print(result)
| N = int(eval(input()))
As = list([int(x) for x in input().split(" ")])
result = 0
MOD = 10**9+7
S = sum(As)
for i in range(len(As)-1):
S -= As[i]
tmp = As[i] * S
result += tmp
result %= MOD
print(result)
| p02572 |
n = int(eval(input()))
ar = list(map(int,input().split(" ")))
count = 0
for i in range(n-1):
br = ar[i+1:n]
count += ar[i] * sum(br)
print((count % (10 ** 9 + 7))) | n = int(eval(input()))
ar = list(map(int,input().split(" ")))
sm = sum(ar)
count = 0
for i in range(n-1):
sm -= ar[i]
count += ar[i] * sm
print((count % (10 ** 9 + 7))) | p02572 |
#!/usr/bin/env python3
def main():
import itertools
N, *A = list(map(int, open(0).read().split()))
print((sum([v[0] * v[1] for v in itertools.combinations(A, 2)]) % (10 ** 9 + 7)))
main()
| #!/usr/bin/env python3
def main():
import itertools
N, *A = list(map(int, open(0).read().split()))
# print(sum([v[0] * v[1] for v in itertools.combinations(A, 2)]) % (10 ** 9 + 7))
s = 0
for i in range(N):
v1 = A[i]
for v2 in A[i + 1 :]:
s += v1 * v2
print((s % (10 ** 9 + 7)))
main()
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
mod = (10 ** 9) + 7
answer = 0
for i in range(N-1):
for j in range(i+1, N):
answer += A[i] * A[j] % mod
print((answer % mod)) | N = int(eval(input()))
A = list(map(int, input().split()))
mod = (10 ** 9) + 7
answer = 0
sum_A = sum(A)
for i in range(N):
sum_A -= A[i]
answer += A[i] * sum_A % mod
print((answer % mod)) | p02572 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
p = 10 ** 9 + 7
AA = [a % p for a in A]
sum = 0
for i in range(0, N - 1):
for j in range(i + 1, N):
sum += (AA[i] * AA[j]) % p
print((sum % p)) | N = int(eval(input()))
A = [int(a) for a in input().split()]
p = 10 ** 9 + 7
S = [A[0]] * N
for i in range(1, N):
S[i] = S[i - 1] + A[i]
sum = 0
for i in range(0, N - 1):
sum += (A[i] * (S[N - 1] - S[i])) % p
print((sum % p)) | p02572 |
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
import random
J=int(1e9)+7
###############################################################################\n=17
n=int(eval(input()))
A=INPUT()
sum=0
for i in range(n):
for j in range(i+1,n):
sum+=(A[i]*A[j])%J
sum%=J
print((sum%J))
| from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
import random
J=int(1e9)+7
###############################################################################\n=17
n=int(eval(input()))
A=INPUT()
sum=0
for i in range(n):
sum+=A[i]
sum=sum*sum
s=0
for i in range(n):
s+=A[i]**2
ans=(sum-s)//2
ans%=J
print(ans)
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
for j in range(i+1, N):
ans += A[i]*A[j]
print((ans%(10**9+7))) | N = int(eval(input()))
A = list(map(int, input().split()))
sum_A = sum(A)
ans = 0
for i in range(N):
sum_A = sum_A - A[i]
ans += A[i] * sum_A
print((ans%(10**9 + 7)))
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
mod = 1000000000+7
for i in range(n):
if a[i] >= mod:
a[i] = a[i] % mod
for i in range(n-1):
#if a[i] >= mod:
#a[i] = a[i] % mod
for j in range(i+1, n):
#if a[j] >= mod:
#a[j] = a[j] % mod
sum = sum + a[i] * a[j]
#print(sum)
if sum >= mod:
#print('no')
sum = sum % mod
#print(sum)
#print('o')
print(sum) | n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
sum1 = 0
mod = 1000000000+7
for i in range(n):
if a[i] >= mod:
a[i] = a[i] % mod
sum1 += a[i]
sum1 %= mod
for i in range(n-1):
#for j in range(i+1, n):
sum1 -= a[i]
#sum += a[i] * a[j]
if sum1 < 0:
sum1 += mod
sum += a[i] * sum1
sum %= mod
print(sum) | p02572 |
import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
c = itertools.combinations(a, 2)
ini = [v[0]*v[1] for v in c]
print((sum(ini)%(10**9+7))) | import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
ini = [a[i]*sum(a[i+1:]) for i in range(n)]
print((sum(ini)%(10**9+7))) | p02572 |
import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
ini = [a[i]*sum(a[i+1:]) for i in range(n)]
print((sum(ini)%(10**9+7))) | import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a)
ini = []
for i in range(n):
s -= a[i]
tmp = a[i]*s
ini.append(tmp)
print((sum(ini)%(10**9+7))) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
a = [x%mod for x in a]
ans = 0
for i in range(n):
for j in range(i+1, n):
ans += (a[i] * a[j])
print((ans % mod)) | n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
aa = [a[0] % mod]
for i in range(1, n-1):
aa.append((aa[i-1] + a[i]) % mod)
ans = 0
for i in range(n-1):
ans += ((aa[i] * a[i+1]) % mod)
print((ans % mod)) | p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
MOD = 1000000007
SUM = 0
for i in range(0,N-1):
for j in range(i+1,N):
SUM += (A[i]*A[j]) % MOD
print((SUM % MOD)) | N = int(eval(input()))
A = list(map(int,input().split()))
MOD = 1000000007
S = sum(A) % MOD
ans = 0
for x in A:
S -= x
S %= MOD
ans += S * x
ans %= MOD
ans %= MOD
print(ans) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
print((sum([A[i] * A[j] for i in range(N - 1) for j in range(i + 1, N)]) % (10 ** 9 + 7))) | N = int(eval(input()))
A = list(map(int, input().split()))
total = 0
for i in range(N - 1):
for j in range(i + 1, N):
total += A[i] * A[j]
total %= (10 ** 9 + 7)
print(total) | p02572 |
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
N = I()
AArray = LI()
MOD = 1000000007
ans = 0
for i in range(N-1):
a = AArray[i]
asum = sum(AArray[i+1:])
asum %= MOD
ans += a*asum % MOD
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| # coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
N = I()
AArray = LI()
MOD = 1000000007
aSum = sum(AArray)
nowAsum = 0
ans = 0
for i in range(N-1):
a = AArray[i]
nowAsum += a
asum = aSum-nowAsum
asum %= MOD
ans += a*asum % MOD
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| p02572 |
n=int(eval(input()))
arr=list(map(int,input().split()))
count=0
for i in range(len(arr)):
for j in range(i+1,len(arr)):
count+=(arr[i]*arr[j])
print((count%((10**9)+7))) | n=int(eval(input()))
arr=list(map(int,input().split()))
count=0
pre=[arr[0]]
for i in range(1,len(arr)):
pre.append((pre[-1]+arr[i]))
ans=0
for i in range(len(arr)-1,0,-1):
ans+=(pre[i-1]*arr[i])
print((ans%((10**9)+(7)))) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1,N):
ans += A[i-1] * sum(A[i:])
ans = ans % 1000000007
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
sum = sum(A)
for i in range(1,N):
sum -= A[i-1]
ans += A[i-1] * sum
ans = ans % 1000000007
print(ans)
| p02572 |
n = int(eval(input()))
nums = [int(x) for x in input().split()]
total = 0
for i in range(0,n-1):
total += nums[i]*sum(nums[i+1:n])
print((total%(10**9+7))) | n = int(eval(input()))
nums = [int(x) for x in input().split()]
multinums = [0]
total = 0
for i in range(0,n): #累積和配列を作成する
multinums.append(multinums[i]+nums[i])
#print(multinums)
for i in range(0,n):
#print(nums[i],multinums[n]-multinums[i+1],nums[i] * (multinums[n]-multinums[i+1]))
total += nums[i] * (multinums[n]-multinums[i+1])
print((total%(10**9+7))) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
calc = 0
for i in range(n):
calc += ((sum(a[i+1:]) % 1000000007) * a[i]) % 1000000007
calc %= 1000000007
print(calc) | n = int(eval(input()))
a = list(map(int, input().split()))
sum_a = sum(a)
calc = 0
for i in range(n):
sum_a -= a[i]
calc += ((sum_a % 1000000007) * a[i]) % 1000000007
calc %= 1000000007
print(calc) | p02572 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
L = len(A)
total = 0
mod = 10**9+7
for x in range(L):
tmp = 0
for y in range(x+1, L):
tmp += A[y]
total += tmp*A[x]
print((total % mod))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
L = len(A)
total = 0
tmp = 0
mod = 10**9+7
for y in range(L):
tmp += A[y]
for x in range(L):
tmp -= A[x]
total += tmp*A[x]
print((total % mod))
| p02572 |
def main():
n = int(eval(input()))
h = list(map(int,input().split()))
ans = 0
import itertools
for i in itertools.combinations(h,2):
ans += (i[0]%(10**9 + 7)) * (i[1]%(10**9 + 7))
print((ans%(10**9 + 7)))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
h = list(map(int,input().split()))
sum_h = sum(h)%(10**9 + 7)
ans = 0
for i in h:
i = i%(10**9 + 7)
sum_h -= i
ans += i*sum_h
print((ans%(10**9 + 7)))
if __name__ == '__main__':
main() | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
sumA = [A[N-1]]
for i in range(1, N - 1):
sumA.insert(0, sumA[0]+A[N-i-1])
ans = 0
for i in range(N-1):
ans += A[i] * sumA[i]
ans = ans % (10 ** 9 + 7)
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
X = 0
Ans = 0
for i in range(N - 1):
X += A[i]
Ans += X * A[i + 1]
Ans = Ans % (10 ** 9 + 7)
print(Ans)
| p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N-1):
s = sum(A[i+1:])
ans += A[i]*s
print((ans % (10**9+7))) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
s = sum(A[1:])
for i in range(N-1):
ans += A[i]*s
s = s - A[i+1]
print((ans % (10**9+7))) | p02572 |
N = int(eval(input()))
A_list = list(map(int,input().split()))
cnt = 0
for i in range(1,N):
for j in range(i+1, N+1):
amari = (A_list[i-1] * A_list[j-1]) % (10**9 + 7)
cnt += amari
if cnt >= (10**9 + 7):
cnt %= (10**9 + 7)
print(cnt) | from itertools import accumulate
N = int(eval(input()))
A_list = list(map(int,input().split()))
B_list = A_list[::-1]
C_list = list(accumulate(B_list))
D_list = C_list[::-1]
cnt = 0
for i in range(1,N):
cnt += (A_list[i-1] * D_list[i]) % (10**9 + 7)
if cnt >= (10**9 + 7):
cnt -= (10**9 + 7)
print(cnt) | p02572 |
from sys import stdin
import itertools
def main():
number = int(eval(input()))
num_list = list(map(int, stdin.readline().split()))
comb = list(itertools.combinations(num_list, 2))
total = sum([c1*c2 for c1, c2 in comb])
print((total % (1000000007)))
if __name__ == '__main__':
main()
| from sys import stdin
import itertools
def main():
number = int(eval(input()))
num_list = list(map(int, stdin.readline().split()))
num_list_sum = sum(num_list)
total = 0
for i in range(number):
num_list_sum -= num_list[i]
total += num_list[i] * num_list_sum
print((total % (10**9+7)))
if __name__ == '__main__':
main() | p02572 |
mod = 10 ** 9 + 7
N = int(input().rstrip())
As = list(map(int, input().rstrip().split()))
ans = 0
add = 0
for i in range(N - 1):
add = 0
for j in range(1, N - i):
add += As[i + j]
ans += As[i] * add
print((ans % mod))
|
mod = 10 ** 9 + 7
N = int(input().rstrip())
As = list(map(int, input().rstrip().split()))
ans = 0
add = 0
for i in range(N):
add += As[i]
add %= mod
ans = add * add % mod
for i in range(N):
ans -= As[i] * As[i] % mod
if (ans < 0):
ans += mod
ans *= int((mod + 1) / 2)
ans %= mod
print(ans) | p02572 |
def solve(N, As):
total = 0
for i in range(N - 1):
for j in range(i + 1, N):
total += As[i] * As[j]
ans = total % (10 ** 9 + 7)
print(ans)
if __name__ == "__main__":
N = int(eval(input()))
As = list(map(int, input().split()))
solve(N, As)
| def solve(N, As):
Ss = [0]
total = 0
for a in As:
Ss.append(Ss[-1] + a)
for i in range(N - 1):
total += As[i] * (Ss[-1] - Ss[i + 1])
ans = total % (10 ** 9 + 7)
print(ans)
if __name__ == "__main__":
N = int(eval(input()))
As = list(map(int, input().split()))
solve(N, As)
| p02572 |
from itertools import accumulate
N, *A = list(map(int, open(0).read().split()))
MOD = 1_000_000_007
acc = list(accumulate(A, initial=0))
ans = 0
for i in range(1, N):
ans += A[i - 1] * (acc[N] - acc[i])
ans %= MOD
print(ans)
| from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 1_000_000_007
acc = list(accumulate(A, initial=0))
ans = 0
for i in range(N):
ans += A[i] * (acc[N] - acc[i + 1])
ans %= MOD
print(ans)
| p02572 |
n=int(eval(input()))
aa=list(map(int,input().split()))
ans=0
list=[]
for i in range(n-1):
list=aa[i+1:n]
ans+=aa[i]*(sum(list))
list=[]
x=10**9+7
print((ans%x)) | n=int(eval(input()))
aa=list(map(int,input().split()))
su=sum(aa)
new=[n**2 for n in aa]
sa=sum(new)
x=10**9+7
print(((su**2-sa)//2%x))
sa | p02572 |
n=int(eval(input()))
aa=list(map(int,input().split()))
accumulation=[]
total=0
for i in range(n):
aacut=aa[:(i+1)]
accumulation.append(sum(aacut))
for i in range(n):
total+=aa[i]*(accumulation[n-1]-accumulation[i])
x=10**9+7
ans=total%x
print(ans) | n=int(eval(input()))
aa=list(map(int,input().split()))
total=0
c=sum(aa)
for i in range(n):
c-=aa[i]
total+=aa[i]*c
x=10**9+7
ans=total%x
print(ans) | p02572 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
sum = 0
for i in range(N):
for j in range(i + 1, N):
sum += A[i] * A[j]
print((sum % (10 ** 9 + 7))) | N = int(eval(input()))
A = [int(x) for x in input().split()]
sums = [0] * N
sums[0] = A[0]
for i in range(N - 1):
sums[i + 1] = sums[i] + A[i + 1] # sums[i] stores the sum of A0~Ai
sum = 0
for i in range(N):
sum += A[i] * (sums[N-1] - sums[i])
print((sum % 1000000007)) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
total = 0
for i in range(n - 1):
for j in range(i+1, n):
total += (a[i] * a[j])
if total >= 10 ** 9 + 7:
total = total % (10 ** 9 + 7)
ans = total % (10 ** 9 + 7)
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a_sum = sum(a)
a_list = []
for num in a:
a_sum -= num
a_list.append(a_sum)
total = 0
for i in range(n-1):
ans = a[i] * a_list[i]
total += ans
if total > 10 ** 9 + 7:
total = total % (10 ** 9 + 7)
print(total)
| p02572 |
N = int(input().split()[0])
a_list = list(map(int, input().split()))
mod = 10 ** 9 + 7
total = 0
for i, a in enumerate(a_list):
for j in range(len(a_list) - (i + 1)):
total += (a * a_list[i + 1 + j]) % mod
total = total % mod
ans = total
print(ans) | #!/usr/bin/env python3
N = int(input().split()[0])
a_list = list(map(int, input().split()))
mod = 10 ** 9 + 7
sum_a = sum(a_list)
total = 0
for i, a in enumerate(a_list):
total += (a * (sum_a - a)) % mod
sum_a -= a
total = total % mod
ans = total
print(ans)
| p02572 |
import sys
from collections import defaultdict
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
D = defaultdict(int)
for i in range(N - 1):
for j in range(i + 1, N):
v = A[i] * A[j] % MOD
D[v] += 1
# print(D)
ans = 0
for key, item in list(D.items()):
ans += key * item
# ans = (ans + (key * item)) % MOD
ans %= MOD
print(ans)
| import sys
input = sys.stdin.buffer.readline
MOD = 10**9 + 7
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
C = [0]
for i in range(1, len(A)):
C.append(C[-1] + A[i])
ans = 0
for i in range(1, N):
ans += A[i] * (C[-1] - C[i])
ans %= MOD
print(ans)
| p02572 |
n = int(eval(input()))
list1 = list(map(int,input().split()))
mod = 10 ** 9 + 7
total = 0
y = sum(list1)
for i in range(0,n-1):
x = y- sum(list1[:i+1])
total += list1[i] * x % mod
total = total % mod
print(total)
| n = int(eval(input()))
list1 = list(map(int,input().split()))
mod = 10 ** 9 + 7
total = 0
y = sum(list1)
for i in range(0,n-1):
y = y- list1[i]
total += list1[i] * y % mod
total = total % mod
print(total)
| p02572 |
import sys
from itertools import combinations
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(combinations(A,2))
sum = 0
for i in range(len(B)):
sum += B[i][0]*B[i][1]
print((sum%1000000007))
| import sys
input = sys.stdin.readline
def multipleSum(A, n):
sum = 0
for i in range(n):
for j in range(i + 1, n):
sum += A[i] * A[j]
return sum%1000000007
N = int(eval(input()))
A = list(map(int,input().split()))
n = len(A)
print((multipleSum(A,n))) | p02572 |
import sys
input = sys.stdin.readline
def multipleSum(A, n):
sum = 0
for i in range(n):
for j in range(i + 1, n):
sum += A[i] * A[j]
return sum%1000000007
N = int(eval(input()))
A = list(map(int,input().split()))
n = len(A)
print((multipleSum(A,n))) | import sys
input = sys.stdin.readline
def multipleSum(A, n):
sum = 0
for i in range(n):
sum += A[i]
mulsum = sum*sum
insum = 0
for i in range(n):
insum+=A[i]*A[i]
return (mulsum-insum)//2
N = int(eval(input()))
A = list(map(int,input().split()))
n = len(A)
print((multipleSum(A,n)%1000000007))
| p02572 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += ((A[i]% (10**9 + 7))*(A[j]% (10**9 + 7))) % (10**9 + 7)
print((ans % (10**9 + 7))) | N = int(eval(input()))
A = [int(i) for i in input().split()]
S = []
e = 0
for i in A:
e += i
S.append(e)
ans = 0
for i in range(N-1):
ans += A[i]%(10**9+7)*((S[N-1] - S[i])%(10**9+7))
print((ans%(10**9+7))) | p02572 |
MOD = 1000000007
N = int(eval(input()))
n_list = list(map(int,input().split()))
result = 0
for i in range(N):
for j in range(N-i-1):
result += n_list[i] * n_list[j+i+1] % MOD
result = result % MOD
print(result)
|
N = int(eval(input()))
n_list = list(map(int,input().split()))
result = 0
s = sum(n_list)
m = 10**9+7
for num in n_list:
s -= num
result += num * s % m
result %= m
print(result)
| p02572 |
import sys
n = int(eval(input()))
a = (list(map(int, input().split())))
dx = 10 ** 9 + 7
a = [i for i in a if i != 0]
ans = 0
alist = []
for i in range(len(a)-1):
for j in range(i+1, len(a)):
t = (a[i] * a[j]) % dx
alist.append(t)
for i in range(len(alist)):
ans += alist[i]
ans %= dx
ans %= dx
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
S = sum(a)
S2 = sum([x * x for x in a])
ans = (S * S - S2) // 2 % 1000000007
print(ans)
| p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
x=(sum(a))**2
y=0
p=10**9+7
for i in range(n):
y+=a[i]**2
print(((x-y)//2%p)) | n=int(eval(input()))
a=list(map(int,input().split()))
x=0
for i in range(n):
x+=a[i]**2
y=sum(a)**2
print((((y-x)//2)%(10**9+7))) | p02572 |
N=int(eval(input()))
A=list(map(int, input().split()))
def calc_mod(n):
return n %(10**9+7)
AA=list(map(calc_mod, A))
X=0
for i in range(N-1):
X+=AA[i]*sum(AA[i+1:N])
X=X%(10**9+7)
print(X) | N=int(eval(input()))
A=list(map(int, input().split()))
def calc_mod(n):
return n %(10**9+7)
AA=list(map(calc_mod, A))
X=0
XX=0
for i in range(N-1):
XX+=AA[N-i-1]
X+=AA[N-i-2]*XX
X=X%(10**9+7)
print(X) | p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000007
sum = 0
for i in range(N-1):
for j in range(i+1,N):
add = (A[i]*A[j]) % mod
sum = sum + add
sum = sum % mod
print(sum)
| N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000007
sum_A = (sum(A)**2) % mod
B = list([(x**2)% mod for x in A])
sum_B = sum(B) % mod
print((((sum_A-sum_B)*500000004)%mod)) | p02572 |
N=int(eval(input()))
l=list(map(int,input().split()))
num=0
ans=0
for i in range(N-1):
ans+=l[i]*sum(l[i+1:N])%1000000007
print((ans%1000000007)) | N=int(eval(input()))
l=list(map(int,input().split()))
ans=0
i=0
S=sum(l)
while i<len(l)-1:
S=S-l[i]
ans+=l[i]*S
i+=1
print((ans%1000000007)) | p02572 |
n = int(input().rstrip())
a = list(map(int,input().rstrip().split()))
mod = 1_000_000_007
ans = 0
for i in range(n):
for j in range(i+1,n):
ans = (ans+a[i]*a[j]%mod)%mod
print((ans%mod)) | n = int(input().rstrip())
a = list(map(int,input().rstrip().split()))
mod = 1_000_000_007
ans = 0
tmp = 0
for i in range(n-1,0,-1):
tmp = (tmp+a[i])%mod
ans += (tmp*a[i-1])%mod
print((ans%mod)) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += (A[i] * A[j])
print((ans % (10**9+7) )) | N = int(eval(input()))
A = list(map(int, input().split()))
S = sum(A)
ans = 0
for i in range(N-1):
a = A[i]
S -= a
ans += a * S
print((ans % (10**9+7) )) | p02572 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
#myans_list = [ [0 for n in range(N)] for nn in range(N) ]
#myans = 0
#for n in range(N):
# for nn in range(N):
# myans_list[n][nn] = A_list[n] * A_list[nn]
#for n in myans_list:
# print(n)
myans = 0
for n in range(N-1):
for nn in range(n+1, N):
myans += A_list[n] * A_list[nn]
print((myans%(1000000007))) | N = int(eval(input()))
A_list = list(map(int, input().split()))
#myans_list = [ [0 for n in range(N)] for nn in range(N) ]
#myans = 0
#for n in range(N):
# for nn in range(N):
# myans_list[n][nn] = A_list[n] * A_list[nn]
#for n in myans_list:
# print(n)
mysum = sum(A_list)
myans = 0
for n in range(N-1):
mysum -= A_list[n]
myans += mysum*A_list[n]
print((myans%(1000000007))) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
assert len(A) == N
total = 0
for i,ai in enumerate(A):
total += ai * sum(A[i+1:])
print((total % (10 ** 9 + 7))) | N = int(eval(input()))
A = list(map(int, input().split()))
assert len(A) == N
total = 0
sum_A = sum(A)
for i,ai in enumerate(A):
sum_A -= ai
total += ai * sum_A
print((total % (10 ** 9 + 7))) | p02572 |
n=int(eval(input()))
*a,=list(map(int,input().split()))
for i in range(n):
a[i]=a[i]%(10**9+7)
sum_a=[]
for i in range(n):
sum_a.append(sum(a)-sum(a[:i+1]))
b=0
for i in range(n):
b+=sum_a[i]*a[i]
print((b%(10**9+7))) | n=int(eval(input()))
*a,=list(map(int,input().split()))
s=sum(a)%(10**9+7)
c=0
b=0
for i in range(n):
b+=a[i]
amod=a[i]%(10**9+7)
c+=(s-b)*amod
print((c%(10**9+7))) | p02572 |
n = int(eval(input()))
alist = list(map(int,input().split()))
wa = 0
answer = 0
for i in range(n):
for j in range(n-i-1):
wa += alist[i+j+1]
wa = wa % (10**9 + 7)
answer += wa * alist[i]
answer = answer % (10**9 + 7)
wa = 0
print(answer) | n = int(eval(input()))
alist = list(map(int,input().split()))
wa = sum(alist)
answer = 0
atai = wa
for i in range(n):
atai -= alist[i]
answer += atai * alist[i]
answer = answer % (10**9 + 7)
print(answer) | p02572 |
N = int(eval(input()))
A = [0] * N
A = list(map(int,input().split()))
ans = 0
mod = 10**9+7
# for i in range(N-1):
# for j in range(i+1,N):
# ans += (A[i]%mod) * (A[j]%mod)
# ans %= mod
A = list([x %mod for x in A])
for i in range(N-1):
for j in range(i+1,N):
ans += A[i] * A[j]
ans %= mod
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
B = [0] * (N+1)
# 累積和を使う
for i in range(1,N+1):
B[i] = A[i-1]+B[i-1]
# 累積和の配列完成
# print(B)
ans = 0
MOD = 10**9+7
for i in range(N):
ans += A[i] * (B[N] - B[i+1])
ans %= MOD
print(ans) | p02572 |
from itertools import combinations
N = int(eval(input()))
A = list(map(int, input().split()))
com_A = [x * y for x,y in combinations(A,2)]
print((sum(com_A) % (10**9 + 7))) | from itertools import combinations
N = int(eval(input()))
A = list(map(int, input().split()))
com_A = [x * y % (10**9 + 7) for x,y in combinations(A,2)]
print((sum(com_A) % (10**9 + 7))) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
M = 0
JM = 0
for i in range(N-1):
JM =0
for j in range(i+1,N):
JM += A[j]
if JM > 10**9 + 7:
JM = JM % (10 ** 9 + 7)
M+= JM * A[i]
if M > 10 ** 9 + 7:
M = M % (10 ** 9 + 7)
print(M) | N = int(eval(input()))
A = list(map(int, input().split()))
M = 0
sum = 0
for i in range(N):
sum += A[i]
for i in range(N-1):
sum = sum - A[i]
M += A[i] * sum
if M > 10 ** 9 + 7:
M = M % (10 ** 9 + 7)
print(M) | p02572 |
import sys
sys.setrecursionlimit(10**6)
MOD = 10**9+7
def main(input, print):
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += A[i]*A[j]
ans %= MOD
print(ans)
if __name__ == '__main__':
main(sys.stdin.readline, print)
| import sys
sys.setrecursionlimit(10**6)
MOD = 10**9+7
def main(input, print):
N = int(input())
A = list(map(int, input().split()))
ans = 0
t = 0
for i in reversed(range(N-1)):
t += A[i+1]
t %= MOD
ans += t * A[i]
ans %= MOD
print(ans)
if __name__ == '__main__':
main(sys.stdin.readline, print)
| p02572 |
n = int(eval(input()))
li = list(map(int, input().split()))
res = 0
sum2 = 0
m = 10**9 + 7
for i in range(0, len(li)-1):
sum2 += li[i]
res = (res + li[i]*(sum(li)-sum2))%m
print(res) | n = int(eval(input()))
li = list(map(int, input().split()))
res = 0
sum1 = sum(li)
sum2 = 0
m = 10**9 + 7
for i in range(0, len(li)-1):
sum2 += li[i]
res = (res + li[i]*(sum1-sum2))%m
print(res) | p02572 |
# C Sum of product of pairs
N = int(eval(input()))
A = list(map(int, input().split()))
s = 0
for i in range(N-1):
s += A[i] * sum(A[i+1:])
print((s % (10**9 + 7))) | # C Sum of product of pairs
N = int(eval(input()))
A = list(map(int, input().split()))
s = 0
old = 0
for i in range(N-1):
old += A[i]
s += old * A[i+1]
print((s % (10**9 + 7))) | p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
result = 0
for i in range(N):
for j in range(i):
result = result + (A[i]*A[j])%1000000007
result = result % 1000000007
print(result) | N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000007
ans = 0
res = [A[0]]
for i in range(N-1):
res.append(res[i]+A[i+1])
for i in range(1,N):
ans = ans + (A[i]*res[i-1])%mod
ans = ans%mod
print(ans) | p02572 |
n=int(eval(input()))
mod=int(1e9)+7
l=[int(x) for x in input().split()]
sum1=0
for i in range(n-1):
for j in range(i+1,n,1):
prod=(l[i]*l[j])%mod
sum1=(sum1%mod+prod%mod)%mod
print(sum1)
| n=int(eval(input()))
mod=int(1e9)+7
l=[int(x) for x in input().split()]
sum1=0
sum2=0
for i in range(n):
sum2=(sum2%mod+l[i]%mod)%mod
for i in range(n-1):
sum2=sum2-l[i]
x=(sum2%mod*(l[i]%mod))%mod
sum1=(sum1%mod+(x%mod))%mod
print(sum1)
| p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=0
c=0
for v in range(n-1):
b+=a[v]
c+=a[v]*(sum(a)-b)
print((c%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
b=sum(a)
c=0
for v in range(n-1):
b-=a[v]
c+=a[v]*b
print((c%(10**9+7)))
| p02572 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.