problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02572 | s246269029 | Wrong Answer | n = int(input())
a = [int(i) for i in input().split()]
sum1 = 0
sum2 = 0
for _ in a:
sum1 += _
sum2 += (_*_)
sum1 = (sum1 * sum1)
print(sum1 - sum2)
|
p02572 | s392792104 | Wrong Answer | N = int(input())
As = list(map(int,input().split()))
sums = 0
moder = 1000000007
s=[0 for i in range(N-1)]
s[-1] = As[-1]
for i in range(N-2):
s[-(i+2)] = s[-(i+1)]+As[-(i-2)]
for i in range(N-1):
sums+= (As[i]*s[i])%moder
print(sums%moder) |
p02572 | s439781607 | Wrong Answer | n = input()
a_list = list(map(int, input().split()))
sum_ = 0
mod = 10 ** 9 + 7
for i in range(len(a_list) - 1):
sum_ += ((a_list[i] % mod) * (a_list[i + 1] % mod)) % mod
print(sum_ % mod) |
p02572 | s346200534 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
sum += a[i]
sum = sum*sum
for i in range(n):
sum -= a[i]*a[i]
sum = int(sum/2)
sum = sum%(10**9+7)
print(sum) |
p02572 | s013895121 | Wrong Answer | l_len = int(input())
l_num = list(map(int,input().split()))
sq_sum_num = sum(l_num)**2
sq_list = [i**2 for i in l_num]
sq_sum_taikaku = sum(sq_list)
total = ((sq_sum_num - sq_sum_taikaku)/2) % (10**9 + 7)
print(int(total)) |
p02572 | s451530423 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
Q = 1e9 + 7
b = 0
for i in range(1, N):
b += A[i-1]
b %= Q
ans += A[i] * b
ans %= Q
print(int(ans)) |
p02572 | s646539627 | Wrong Answer | N= int(input())
list1 =[]
list1 = list(map(int, input().split()))
sum = 0
print(list1)
for i in range(N-1):
for j in range(i+1,N):
sum = sum + list1[i]*list1[j]
answer = divmod(sum, 10**9+7)
print(answer[1])
|
p02572 | s668446806 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
total = sum(a)
total %= mod
total = total ** 2
total %= mod
cnt = 0
for i in range(n):
cnt += a[i]**2
cnt %= mod
ans = total - cnt
ans %= mod
print(ans)
|
p02572 | s356959346 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
s = 0
for i in range(n):
for j in range(i+1, n):
s += (a[i]% (10**9+7)) * (a[j]% (10**9+7))
print(s) |
p02572 | s878919849 | Wrong Answer | import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
mod=1000000007
n = r()
a = rl()
b = [a[-1]]
for i in range(n-2,-1,-1):
b.append(b[-1]+a[i])
b = b[::-1]
print(b)
ans = 0
for i in range(n-1):
ans= (ans+(a[i]*b[i+1])%mod)%mod
print(ans) |
p02572 | s185344163 | Wrong Answer | import numpy as np
n = int(input())
a = input().split()
ai=np.array(a, dtype="int64")
div=(1E9+7)*2
#total=sum(ai)**2
#diagonal=sum(ai**2)
#ans=(total-diagonal)/2
totalmod=(sum(ai)%div)**2
diagonalmod=sum((ai**2)%div)
ansmod=totalmod-diagonalmod
if (ansmod <= 0):
ansmod=ansmod+div
print(int((ansmod/2)%(1E9+7)))
|
p02572 | s422333836 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
mod = 10**9+7
tmp = 0
for i in range(N):
tmp += A[i]
tmp = tmp % mod
all = (tmp % mod)**2
all = all % mod
tmp = 0
for i in range(N):
tmp += (A[i]* A[i]) % mod
di = tmp % mod
tri = (all-di)//2
print(tri % mod) |
p02572 | s688236468 | Wrong Answer | N = int(input())
A = input().split()
S = 0
B = 0
for i in range(N):
A[i] = int(A[i])
B += (A[i]*A[i])
print(int(( (sum(A)*sum(A)) - B ) % ( 10**9 + 7 ) / 2 ) ) |
p02572 | s467071523 | Wrong Answer | N = int(input())
As = list(map(int, input().split()))
S = 0
T = 0
for i in range(N):
S += As[i]
T += As[i] * As[i]
print(int(((S*S - T) / 2))% 1000000007) |
p02572 | s044212010 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
c = 0
for i in range(N-2):
for j in range(int(i)+1, N):
d = A[i]
e = A[j]
c = (c + d*e) % (10**9+7)
c = c % (10**9+7)
print(c) |
p02572 | s599640482 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
sum = 0
t = n-1
for i in a:
for j in range(t):
sum += i * a[-(j+1)]
t -= 1
ans = sum % (10**9 + 7) |
p02572 | s537835343 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
#437235829 mod(10^9+7)
sumAcol=0
sumA=0
sumtr=0
for i in range(N):
sumtr+=A[i]**2
sumAcol+=A[i]
sumAcol=sumAcol % (10**9+7)
for i in range(N):
sumA+=sumAcol*A[i]
sumA=(sumA-sumtr)/2
print(int(sumA % (10**9+7)))
|
p02572 | s828493745 | Wrong Answer | n = int(input())
a = [int(x) for x in input().split()]
b = [0]
for i in range(1,n+1):
b.append((a[i-1] + b[i-1]) % ((10 ** 9) + 7))
print(b)
ans = 0
for i in range(n):
p = b[n] - b[i+1]
p = a[i] * p % (10**9 + 7)
ans += p
print(ans,p)
print(ans) |
p02572 | s462263103 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = []
for i in range(n):
for j in range(i+1, n):
b.append((a[i] * a[j]) % (10 ** 9 + 7))
print(sum(b)) |
p02572 | s020733119 | Wrong Answer |
def pro(A, n):
prr = 0
for i in range(n):
for j in range(i + 1, n):
prr = prr + A[i] * A[j]
return prr
if __name__ == "__main__":
u=0
u=int(input())
A = list(map(int,input().split()))
n = len(A)
print(pro(A, n)) |
p02572 | s186038579 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
#Ai*Ajの和を求めろ
s=sum(A)
ans=0
for i in A:
s=s-i
ans+=i*s
print(ans) |
p02572 | s758760420 | Wrong Answer | import itertools
import numpy as np
N = int(input())
A = list(map(int, input().split()))
p = itertools.combinations(A, 2)
emp = []
for v in p:
a = np.prod(v)
emp.append(a)
print(sum(emp)) |
p02572 | s204699971 | Wrong Answer | N = int(input())
a = list(map(int, input().split(" ")))
s = 0
for i in range(0,N):
s += a[i]
s = s*s
for i in range(0,N):
s -= a[i]*a[i]
if s % 2 == 0:
s = s/2 % (10**9 +7)
else:
s = (s + 10**9 + 7)/2 % (10**9 + 7)
print(int(s)) |
p02572 | s704646704 | Wrong Answer | import sys
from collections import defaultdict
input = sys.stdin.buffer.readline
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
D = defaultdict(int)
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
v = A[i] * A[j] % MOD
D[v] += 1
print(D)
|
p02572 | s779578780 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
k = 0
num = sum(a)
import math
for i in range(n):
reje = num - a[i]
k += reje * a[i]
x = int(k/2)
t = 10 ** 9 + 7
ans = x % t
print(ans)
|
p02572 | s931200347 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
sumA = sum(A)%(1000000007)
sumA2 = (sumA * sumA)%(1000000007)
square = 0
for i in range(N):
square += ( A[i]**2 ) % (1000000007)
square = square % (1000000007)
buf = sumA2 - square
if buf < 0:
buf = buf + (1000000007)
res = ( buf * ((1000000007+1)/2)) % 1000000007
print(round(res)) |
p02572 | s232082049 | Wrong Answer | import numpy as np
N = int(input())
# = str(input())
# = map(int, input().split())
A = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
total = (sum(A)%(10**9+7))**2
doubleA = (np.asarray(A)%(10**9+7))**2
minustotal = sum(doubleA)
print(((total-minustotal)//2)%(10**9+7))
|
p02572 | s683970001 | Wrong Answer | n = int(input())
lst = list(map(int, input().split()))
MOD = 1000000007
def mod(n):
return n % MOD
def multiply(a, b): #mod(a*b)を求める
return mod(mod(a)*mod(b))
ans = mod(multiply(mod(sum(lst)), mod(sum(lst))))
for i in range(n):
ans -= multiply(lst[i], lst[i])
ans = mod(ans)
print(ans//2)
|
p02572 | s229343629 | Wrong Answer | N = int(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]) % (10 ** 9 + 7)
print(ans)
|
p02572 | s294627733 | Wrong Answer | import numpy as np
N = input()
A = list(map(int,input().split()))
s = 0
for i in range(len(A)):
for j in range(i+1,len(A)):
s = s + A[i]*A[j]
print(s)
|
p02572 | s784346801 | Wrong Answer | n = int(input())
a = list(map(int, input().split(" ")))
mod = 10 ** 9 + 7
s=0
for i in range(n):
s += a[i]
s %= mod
s = s*s
s %= mod
for i in range(n):
s -= (a[i] ** 2) % mod
s %= mod
s /= 2
s %= mod
print(int(s))
|
p02572 | s378040582 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
mod = 10**9+7
ans = 0
sa = sum(a)%mod
for i in a:
ans += (sa*i)%mod-i*i%mod
ans %= mod
print(ans//2) |
p02572 | s521746449 | Wrong Answer | N=int(input())
A =list(map(int,input().split()))
sum =0
for i in range(N):
for j in range(i+1,N):
sum += A[i]*A[j]
x =sum
a =10**9+7
result =''
while x>0:
result = str(x % a) + result
x//=a
print(result) |
p02572 | s564888323 | Wrong Answer | import sys
import numpy as np
n = int(sys.stdin.readline())
a = list(map(int, sys.stdin.readline().split()))
a = np.array(a, dtype=np.uint64)
s = ((
(np.sum(a)**2).astype(np.uint64) - np.sum(a**2)
) // 2).astype(np.uint64)
print(int(s % (10**9 + 7)))
|
p02572 | s283234224 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
b = sum(A)
S = 0
for i in range(n):
S += A[i]*b-A[i]*A[i]
S = S%1000000007
print(int(S/2)) |
p02572 | s325107816 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
S = sum(A)
ans = 0
for i in range(N):
ans += A[i]*(S-A[i])
ans = ans % (10**9+7)
print(ans//2) |
p02572 | s275154648 | Wrong Answer | def findProductSum(A, n):
array_sum = 0
individual_square_sum = 0
for i in range(0, n):
array_sum = array_sum + A[i]
individual_square_sum += A[i] * A[i]
array_sum_square = array_sum * array_sum
return (array_sum_square - individual_square_sum) / 2
if __name__ == '__main__':
n = int(input())
A = list(map(int, input().split()))
print(int(findProductSum(A, n)%1000000007)) |
p02572 | s790312653 | Wrong Answer | u=0
u=int(input())
A = list(map(int,input().split()))
n = len(A)
prr = 0
for i in range(n):
for j in range(i + 1, n):
prr = prr + A[i] * A[j]
print(prr)
|
p02572 | s101836422 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
a2=[a[n-1]]
for i in range(n-1,0,-1):
a2.append(a2[-1]+a[i-1])
print(a2)
ans=0
for i in range(n-1):
ans = ( ans + (a[i]*a2[-i-2]) )%(10**9+7)
print(ans)
|
p02572 | s707308639 | Wrong Answer | import math
n=int(input())
s=0
su=0
t=0
k=0
a=list(map(int,input().split()))
if n==1:
print(a[0])
else:
for i in range(n):
s+=a[i]
k=math.pow(s,2)
su+=math.pow(a[i],2)
t=(k-su)//2
print(round(t))
|
p02572 | s875823796 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
def selfmult(x):
return (x%1000000007)**2
dot=((sum(A)%1000000007)**2-sum(map(selfmult,A)))/2
print(int(dot)%1000000007) |
p02572 | s669727268 | Wrong Answer | mod=(10**9)+7
n=int(input())
a=list(map(int,input().strip().split(' ')))
s=0
for x in a:
s= (s+x)%mod
s=(s*s)%mod
t=0
for x in a:
t= (t+ (x*x)%mod)%mod
ans=((((s-t)%mod+mod)%mod)//2)
print(ans%mod)
|
p02572 | s491647363 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
mod = 10**9 + 7
x = sum(A)**2 % mod
y = (x / 2 - sum([a**2 / 2 % mod for a in A]))
print(int(y) % mod)
|
p02572 | s363514438 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
s = sum(a)
ans = 0
for x in a:
ans += (s-x) * x
ans %= mod
print(ans) |
p02572 | s893866481 | Wrong Answer | n = int(input())
lis = list(map(int,input().split()))
num = sum(lis)% (10 ** 9 + 7)
ans = 0
for i in range(n):
ans += lis[i] * (num-lis[i])
ans %= 10 ** 9 + 7
while ans < 0:
ans += 10 ** 9 + 7
print(ans//2) |
p02572 | s872008577 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
T=0
x=0
D=0
S=0
L=10**9+7
for i in range(0,N):
x=A[i]**2
D+=x
for j in range(0,N):
S+=A[j]
F=S**2
T=(F-D)/2
T=int(T)
ans=T%L
print(ans) |
p02572 | s592710499 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
sum=0
for j in range(n):
for i in range(j):
seki=A[i]*A[j]
keta=seki%(10**10)
sum+=keta
sum=sum%(10**10)
print(sum % (10**9+7))
|
p02572 | s145319399 | Wrong Answer | n = int(input())
s = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = ans + s[i] * (sum(s) - s[i])
print(ans%(10**9+7))
|
p02572 | s600042196 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
s = 0
for i in range(N):
s += A[i]
s %= (10**9+7)
s = s**2
s %= (10**9+7)
t = 0
for i in range(N):
t += (A[i]**2 % (10**9+7))
t %= (10**9+7)
ans = (s-t) % (10**9+7)
print(int(ans/2))
|
p02572 | s166848085 | Wrong Answer | N = int(input())
A = [int(i) for i in input().split()]
mod = 10**9 + 7
sum_A = sum(A)
ans = 0
for i in A:
ans += i * (sum_A := sum_A - i) % mod
print(ans)
|
p02572 | s869071749 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
s = sum(a)
S = 0
for i in range (n):
S += a[i] * (s-a[i])
print(int((S/2)%(10**9+7))) |
p02572 | s932383297 | Wrong Answer | ans = 0
mod = 1e9+7
N = int(input())
A = [int(num)%mod for num in input().split()]
A_sum = sum(A)
A_squared = sum([num**2 for num in A])
ans = (A_sum**2 - A_squared)/2
ans = int(ans%mod)
print(ans)
|
p02572 | s926111097 | Wrong Answer |
N = int(input())
A = [int(x) for x in input().split()]
partial_sum = A.copy()
sum_now = A[N-1]
for j in range(N-2,-1,-1):
sum_now = int((sum_now+A[j])%(1e9+7))
partial_sum[j] = sum_now
res = 0
for i in range(N-1):
res = (res + (A[i]*partial_sum[i+1]) %(1e9+7)) %(1e9+7)
print(int(res)) |
p02572 | s025454046 | Wrong Answer | CONST = 10**9 + 7
n = int(input())
a = list(map(int,input().split()))
s = pow(sum(a),2,CONST)
for x in a:
s -= pow(x,2)
s %= CONST
if s < 0: s += CONST
print(s//2)
|
p02572 | s399169982 | Wrong Answer | mod = (10**9)+7
def findProductSum(A, n):
array_sum = 0
for i in range(0, n, 1):
array_sum = (array_sum + A[i])%mod
array_sum_square = (array_sum * array_sum)%mod
individual_square_sum = 0
for i in range(0, n, 1):
individual_square_sum = (individual_square_sum + A[i] * A[i])%mod
tmp = (((array_sum_square - individual_square_sum)%mod) // 2)%mod
return tmp
n = int(input())
lis = list(map(int,input().split()))
print(findProductSum(lis,n)) |
p02572 | s898219095 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split()))
A_array = np.array(A)
# i = j
ij = np.sum(A_array * A_array)
Acum = np.sum(A_array)
temp = 0
for i in A:
temp += i*Acum
ans = (temp - ij)/2
print(int(ans) % (10**9 + 7))
|
p02572 | s381994488 | Wrong Answer | # C - Sum of product of pairs
import numpy as np
N = int(input())
A = list(int(a) for a in input().split())
MOD = 10**9 + 7
A = np.array(A)
csA = np.zeros((N+1), dtype=object)
for i in range(N):
csA[i+1] = csA[i] + A[i]
ans = 0
for i in range(N-1):
ans += (A[i] * (csA[N] - csA[i+1])) % MOD
print(ans%MOD)
|
p02572 | s664897348 | Wrong Answer | import numpy
n=input()
l=list(map(int, input().split()))
res=0
#print(f"le{len(l)}")
l.append(0)
l.reverse()
for i in range(len(l)):
print(l[len(l)-1-i],numpy.cumsum(l)[len(l)-i-2])
res+=l[len(l)-1-i]*numpy.cumsum(l)[len(l)-i-2]
#print(f"{res}レス")
print(res%(10**9+7))
#print(res) |
p02572 | s098602442 | Wrong Answer | l_len = int(input())
l_num = list(map(int,input().split()))
sq_sum_num = sum(l_num)**2
sq_list = [i**2 for i in l_num]
sq_sum_taikaku = sum(sq_list)
totals = int(((sq_sum_num - sq_sum_taikaku)/2))
total_v = totals % (10**9+7)
print(int(total_v)) |
p02572 | s301982869 | Wrong Answer | import numpy as np
n=int(input())
t=np.array(input().split(' '))
num=np.zeros(n)
for a in range(n):
num[a]=int(t[a])
x=0
for a in range(n-1):
x+=num[a+1]*np.sum(num[0:a+1])
x=x%((10**9)+7)
print(int(x)) |
p02572 | s654724593 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
partial_sum = A.copy()
sum_now = A[N-1]
for j in range(N-2,-1,-1):
sum_now = int((sum_now+A[j])%(1e9+7))
partial_sum[j] = sum_now
res = 0
for i in range(N-1):
res = (res + (A[i]*partial_sum[i+1])%(1e9+7)) %(1e9+7)
print(int(res)) |
p02572 | s240767930 | Wrong Answer | input()
lis = list(map(int,input().split()))
def sol(lis):
s = [0]*len(lis)
x = 0
for i in range(len(s)-1,-1,-1):
s[i] +=x
x +=lis[i]
res = 0
for i in range(len(lis)):
res += lis[i]*s[i]
print(res)
sol(lis)
|
p02572 | s438802066 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = []
for i in range(n):
for j in range(n):
b.append((a[i] % (10 ** 9 + 7)) * (a[j] % (10 ** 9 + 7)))
print(sum(b)) |
p02572 | s137595782 | Wrong Answer | MOD = 10**9+7
def findProductSum(A, n):
array_sum = 0
for i in range(n):
array_sum += A[i]
array_sum_square = array_sum * array_sum % MOD
individual_square_sum = 0
for i in range(n):
individual_square_sum = (individual_square_sum + A[i] * A[i]) % MOD
if array_sum_square < individual_square_sum:
array_sum_square += MOD
return (array_sum_square - individual_square_sum) / 2
N = int(input())
a = [int(_) for _ in input().split()]
print(int(findProductSum(a, N)))
|
p02572 | s213928731 | Wrong Answer | import numpy as np
N = int(input())
A = np.asarray(input().split()).astype(np.int)
A_sq = np.square(A)
print(int(np.mod(((A.sum())*(A.sum())-A_sq.sum())/2, 10**9+7))) |
p02572 | s367005146 | Wrong Answer | MOD = 1000000007
N = int(input())
A = list(map(int, input().split()))
s = 0
r = 0
for a in A:
s = (s + a)
r = (r + a ** 2) % MOD
print(int(((s * s - r) % MOD) / 2))
|
p02572 | s297276031 | Wrong Answer | N = int(input())
data = list(map(int, input().split()))
sum = 0
for i in range(N):
for j in range(i+1,N):
sum += (data[i]*data[j]) % (1000000007)
print(sum) |
p02572 | s639734692 | Wrong Answer | ##C - Sum of product of pairs
N = int(input())
A = list(map(int,input().split()))
import itertools
B = list(itertools.combinations(A,2))
print(sum (list(map(lambda x: x[0] * x[1], B))) ) |
p02572 | s816715877 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split()))
A = np.array(A)
MOD = 10**9 + 7
ruisekiwa = np.zeros(N, dtype='int')
for i in range(1, N):
ruisekiwa[i] = ruisekiwa[i-1] + A[i]
res = 0
for i in range(N-1):
# res += np.sum(np.mod(A[i] * A[i+1:], MOD))
res += (ruisekiwa[N-1] - ruisekiwa[i]) * A[i]
res = res % MOD
print(res % MOD)
# FIXME TLE |
p02572 | s565122393 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, *a = map(int, read().split())
MOD = 10 ** 9 + 7
total = 0
s = sum(a)
for i in range(n):
total += (a[i] * (s - a[i])) % MOD
print((total % MOD) // 2)
|
p02572 | s617349503 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
x = 0
z = 0
MOD = 10**9 + 7
for i in A:
x = (x%MOD + i%MOD)%MOD
z = (z%MOD + i*i%MOD)%MOD
y = x*x%MOD
print((y-z)//2) |
p02572 | s472946706 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(N):
ans+=(sum(A)-A[i])*A[i]
ans = ans / 2
print(int(ans%(10**9+7))) |
p02572 | s816867450 | Wrong Answer | import itertools
n = int(input())
a = list(map(int, input().split()))
amaria = []
ans = 0
p = 10 ** 9+7
#for i in itertools.combinations(a,2):
#ans += i[0]* i[1]
#print(ans)
for i in range(n):
amaria.append(a[i]%p)
for j in itertools.combinations(amaria,2):
ans += j[0]* j[1]
print(ans) |
p02572 | s338706269 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
total = sum(a)
for i in range(n) :
m = a[i]
add = 0
add += (total-m)*m / 2
add %= (1e9)+7
ans += add
ans %= (1e9)+7
print(int(ans))
|
p02572 | s497535648 | Wrong Answer | n = int(input(''))
adl = input('')
a = list(map(int,adl.split(' ')))
number = 0
mod0 = 1000000000
mod1 = 7
amari = 0
for i in range(n):
aa = 0
for e in range(n-i-1):
j = i+e+1
if i != j:
aa = aa + a[j]
number = number + (a[i] * aa)
amari0 = number % mod0
amari1 = number % mod1
amari = amari0 + amari1
print(amari)
|
p02572 | s630139193 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split()))
A_array = np.array(A)[::-1]
A_cum = A_array.cumsum()[::-1]
ans = 0
for i in range(N-1):
ans += A_cum[i+1] * A[i]
print(ans%(10**9 +7))
|
p02572 | s027549285 | Wrong Answer | num = int(input())
line = input()
arr = [int(x) for x in line.split(" ")]
post = [0 for x in range(num)]
post[num - 1] = arr[num - 1]
for i in range(2, num + 1):
post[num - i] = post[num-i+1] + arr[num - i]
sum = 0
for i in range(num-1):
sum += arr[i] * post[i+1]
#sum %= 1e9 + 7
sum %= 1e9 + 7
print(int(sum)) |
p02572 | s112499497 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
s=0
for i in range(0,n):
x=l[i%n]*l[(i+1)%n]
s=s+x
print(s) |
p02572 | s135442475 | Wrong Answer | import itertools
def NextInts(): return map(int,input().split())
saisyo = input()
X = NextInts()
p = itertools.combinations(X, 2)
ANSWER = 0
MOD = 10**9+7
for i in p:
answer = (int(i[0])%MOD*int(i[1])%MOD)
ANSWER+=answer
print(ANSWER)
|
p02572 | s733146963 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
mod = 1e9+7
S = 0
for i in range(N):
S += A[i]
sum = 0
for i in range(N):
S -= A[i]
if S<0:
S+= mod
sum += int(A[i]*S%(1e9+7))
sum = int(sum%(1e9+7))
print(sum) |
p02572 | s748112773 | Wrong Answer | import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
ans = 0
Asum = [0 for _ in range(N)]
Asum[0] = A[0]
for i in range(1,N):
Asum[i] = Asum[i-1] + A[i]
for i in range(N-1):
ans += (A[i]*(Asum[N-1] - Asum[i]))%(10**9+7)
print(ans%(10**9+7)) |
p02572 | s661139347 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
f = sum(a)
ans = 0
for i in range(n):
e = f-a[i]
ans+= ((e*a[i])%mod)
ans%=mod
print(ans//2) |
p02572 | s949378211 | Wrong Answer | N = int(input())
As = list(map(int,input().split()))
out = int((sum(As)**2 - sum([a**2 for a in As]))/2)
print(out % (10**9+7)) |
p02572 | s409609512 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
Amap=map(lambda x:x%1000000007,A)
def selfmult(x):
return (x%1000000007)**2
dot=((sum(Amap)%1000000007)**2-sum(map(selfmult,A)))/2
print(int(dot)%1000000007) |
p02572 | s727764019 | Wrong Answer | import numpy as np
from numba import njit, i8
import sys
read = sys.stdin.readline
mod = 10 ** 9 + 7
@njit((i8, i8[:]), cache=True)
def main(n, a):
s = np.sum(a)
ans = 0
for i in range(n):
ans = (ans + a[i] * (s - a[i])) % mod
print(ans // 2)
n = int(read())
a = np.fromstring(read(), dtype=np.int64, sep=' ')
main(n, a)
|
p02572 | s636022516 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b=sum(a)
score=0
for i in range(len(a)):
b -= a[i]
score=a[i]*b
print(score) |
p02572 | s586766074 | Wrong Answer | n=int(input())
a=list(map(int,input().split(" ")))
print(int((sum(a)**2-sum([i**2 for i in a]))/2)%int(10**9+7)) |
p02572 | s332289160 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
p = 10**9+7
ans = (sum(a)%p)**2
for i in range(n):
ans = ans-(a[i]**2)
ans = ans/2
print(ans%p)
|
p02572 | s261697681 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
b=sum(l)**2
a=0
for i in range(n):
a+=l[i]**2
print((b-a)%(10**9+7)//2) |
p02572 | s480023478 | Wrong Answer | 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(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-J)//2
ans%=J
print(ans)
|
p02572 | s035872572 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
s = sum(a)
S = 0
for i in range (n):
S += a[i] * (s-a[i])
S = S/2
ans = S%(10**9+7)
print(int(ans)) |
p02572 | s975231664 | Wrong Answer | n = int(input())
an = list(map(int,input().split()))
mod = 10**9 + 7
total =sum(an)
ans = 0
for x in range(n-1):
nokori = total-sum(an[:x+1])
ans += an[x] * nokori % mod
print(ans)
|
p02572 | s911998159 | Wrong Answer | import numpy as np
n=int(input())
t=np.array(input().split(' '))
num=np.zeros(n)
for a in range(n):
num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
if x<10**9+7:
print(x)
else:
x=x%(10**9+7)
x-=1
print(x) |
p02572 | s657356941 | Wrong Answer | import math
from fractions import Fraction as frac
MOD = 1e9 + 7
def solve(case_no):
n = int(input())
a = list(map(int, input().split()))
ps = [a[0]]
for i in range(1, n):
ps.append(ps[i - 1] + a[i])
ans = 0
for i in range(n - 2, -1, -1):
ans += a[i + 1] * ps[i]
ans %= MOD
print(ans)
t = 1
# t = int(input())
for i in range(1, t + 1):
solve(i)
|
p02572 | s202129295 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split(" ")))
mod_num = 1e9 + 7
sum_lst = sum(A)
sum_tmp = 0
for i in range(N):
sum_tmp += (((sum_lst - A[i])%mod_num)*(A[i]%mod_num))
sum_lst = sum_lst - A[i]
print(int(sum_tmp%mod_num)) |
p02572 | s254723324 | Wrong Answer | N = int(input())
A = map(int, input().split())
ans = 0
mod = 10**9+7
S = sum(A)
S2 = sum(map(lambda x: x*x, A))
print((S*S-S2)//2 % mod)
|
p02572 | s650972749 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
s = 0
for i in a:s+=i
ans = 0
for i in a:
ans += ((i*s)-(i*i))/2
ans = ans % MOD
print(int(ans)) |
p02572 | s286279242 | Wrong Answer | n=int(input())
arr = list(map(int,input().split()))
sum1=0
sum2=0
for i in arr:
sum1+=i
sum2+=i**2
x=((sum1**2)%(10**9+7) - sum2%(10**9+7))%(10**9+7)
x=x//2
print(x) |
p02572 | s639697726 | Wrong Answer |
n = int(input())
item = [int(i) for i in input().split()]
mod = 10**9+7
ans = sum(item)**2/2 - sum([i**2/2 for i in item])
print(int(ans) % mod)
|
p02572 | s047001045 | Wrong Answer | N = int(input())
l = list(map(int, input().split()))
import itertools
sum = 0
for p in list(itertools.combinations(l, 2)):
if p[1] != p[0]:
sum+= (p[0] * p[1])
r = sum % (10**9 + 7)
print(r) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.