problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02572 | s685630352 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
ans += a[i] * sum(a[i + 1 :n])
print(int(ans % (float('1e9') + 7)))
|
p02572 | s422266601 | Wrong Answer | import copy
N=int(input())
list1=list(map(int,input().split()))
list2=copy.copy(list1)
x=0
for i in list1:
for j in list2:
if i<j:
x=x+i*j
else:
continue
x=x%(10**9+7)
print(str(x)) |
p02572 | s601527140 | Wrong Answer | from collections import deque
import sys, copy, itertools,heapq
input = sys.stdin.readline
n = int(input())
A = list(map(int,input().split()))
suma = sum(A)
a = (suma ** 2)
b =0
for i in range(n):
b += A[i]*A[i]
ans = a-b
if ans < 0:
ans += 10**9 +7
answer = ans/2
answer = answer%(10**9 +7)
print(int(answer)) |
p02572 | s853691270 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n-1):
for j in range(n-i-1):
cnt+=a[i]*a[j+1]
print(cnt) |
p02572 | s320173703 | Wrong Answer | N=int(input())
A=list(map(int, input().split()))
count=0
S=0
while 1:
for i in range(N):
if count+1+i<N:
S=S+A[count]*A[count+1+i]
count=count+1
if count==N:
break
print(S) |
p02572 | s130613212 | Wrong Answer | x=int(input())
A=input().split()
n=len(A)
array_sum = 0
for i in range(0, n, 1):
A[i]=int(A[i])
array_sum = array_sum + A[i]
array_sum_square = array_sum * array_sum
individual_square_sum = 0
for i in range(0, n, 1):
individual_square_sum += A[i] * A[i]
print( int((array_sum_square - individual_square_sum) / 2) %1000000007 ) |
p02572 | s391158779 | Wrong Answer | def main():
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
tmp = [0] * N
s = 0
for i in range(N):
tmp[- i - 1] = s
s += A[-i - 1]
print(tmp)
ans = 0
for i in range(N):
ans += A[i] * tmp[i]
print(ans % mod)
if __name__ == '__main__':
main()
|
p02572 | s656205200 | Wrong Answer | import numpy as np
n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
a = np.array(a)
sum_a = np.sum(a)
sum_a2 = np.sum(a**2)
ans = (((sum_a*sum_a)-sum_a2)//2)%mod
print(ans) |
p02572 | s320001710 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
ans = 0
for aa in a:
ans += aa
ans %= mod
ans *= ans
ans %= mod
for aa in a:
ans -= aa*aa
ans %= mod
ans //= 2
print(ans) |
p02572 | s702109982 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
LA = len(A)
print(N)
print(A)
i = 0
j = 0
SUM = 0
for i in range(LA):
for j in range(LA):
if j <= i:
continue
SUM = SUM + (A[i] * A[j])
print(SUM % 1000000007) |
p02572 | s795265068 | Wrong Answer | import sys
def main():
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split(" ")))
mod = 10**9+7
res = 0
for i in range(N-1):
for j in range(i, N):
if i >= j: break
res += A[i] * A[j]
print(res % mod)
if __name__ == "__main__":
main() |
p02572 | s985297056 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
mod= 10**9+7
A = sum(a)
ans=0
for i in a:
ans += (A-i)*i %mod
print(ans//2%mod)
|
p02572 | s641351419 | Wrong Answer | def square(list):
return [i ** 2 for i in list]
m = 1000000007
n = int(input())
A = list(map(int, input().split()))
sq = square(A)
s1 = sum(A)
s2 = sum(sq)
result = (s1**2-s2)/2
print(round(result%m)) |
p02572 | s451136600 | Wrong Answer | #Worst Solution
input()
l = list(map(int,input().split()))
r = 0
s = l
for i in range(len(l)):
for j in range(i+1,len(s)):
r+=l[i]*l[j]
print(r) |
p02572 | s794785131 | Wrong Answer | N = int(input())
As = list(map(int,input().split()))
out = (sum(As)**2 - sum([a**2 for a in As]))/2
string = str(out % (10**9+7))
print(string[0:len(string)-2]) |
p02572 | s895307777 | Wrong Answer | n = int(input())
a = tuple(map(int,input().split()))
b = sum([(i**2) for i in a])
print(int(((sum(a)**2-b)/2)%(10**9+7)))
|
p02572 | s419959450 | Wrong Answer | mod = 1e9 +7
n = int(input())
a = list(map(int,input().split()))
pref=[0 for x in range(n)]
pref[0] = a[0]
for i in range(1,n):
pref[i] += ((pref[i-1]+a[i])%mod)
ans=0
for i in range(n-1,0,-1):
ans += (a[i]*pref[i-1])
ans %= mod
print(int(ans))
|
p02572 | s917908592 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
k = 0
num = sum(a)
import math
for i in range(n):
k = k + (a[i] * num) - (a[i] ** 2)
x = (k / 2) % ((10 ** 9) + 7)
print(math.floor(x))
|
p02572 | s968041184 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, N, 1):
A_sum = A_sum + A[i]
A_sum_sq = A_sum * A_sum
idv_sq_sum = 0
for i in range(0, N, 1):
idv_sq_sum += A[i] * A[i]
Answer = (A_sum_sq -
idv_sq_sum) / 2
if Answer > 10**9:
print(int(Answer % (10**9+7)))
else:
print(int(Answer)) |
p02572 | s383718493 | 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]
print(ans % (10 ** 9) + 7)
|
p02572 | s365296343 | Wrong Answer | import numpy
N = int(input())
A = list(map(int, input().split()))
res = numpy.cumsum(A)
sum = 0
for i in range(N-1):
sum += A[i] * (res[N-1] - res[i])
print(sum % (10**9+7)) |
p02572 | s912953646 | Wrong Answer | N = int(input())
numbers = list(map(int, input().split()))
S = 0
for i in range(N-1):
for j in range(i+1, N):
S += numbers[i]*numbers[j]
print(S) |
p02572 | s453235380 | Wrong Answer | import numba
from numba import njit, b1, i4, i8, f8
import numpy as np # noqa
N = int(input())
A = np.array([int(x) for x in input().split()], dtype=np.int32)
s = 0
for i in range(N):
s += A[i]
s %= 10**9 + 7
def main(A, s):
ans = 0
for i in range(N - 1):
s -= A[i]
ans = (ans + A[i] * s) % (10**9 + 7)
return ans
print(main(A, s))
|
p02572 | s842777650 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = sum(a)**2
for i in range(n):
b -= a[i]**2
print(int(b%(10**9+7)/2)) |
p02572 | s523139443 | Wrong Answer | M = 1e9 + 7
def findProductSum(A, n):
array_sum = 0
for i in range(0, n, 1):
array_sum = array_sum + A[i]
array_sum_square = array_sum * array_sum
individual_square_sum = 0
for i in range(0, n, 1):
individual_square_sum += A[i] * A[i]
return int(((array_sum_square - individual_square_sum) // 2)%M)
n = int(input())
A = list(map(int, input().split()))
print(findProductSum(A,n)) |
p02572 | s670923262 | Wrong Answer | import decimal
n = int(input())
a = list(map(int, input().split()))
first = a[0]
ans = first*a[1]
print(ans)
for i in range(1, n-1):
first += a[i]
ans += first*a[i+1]
print(ans%(10**9+7)) |
p02572 | s330465566 | Wrong Answer | N = int(input())
al = list(map(float,input().split()))
sss=0
for i in range(N):
sss+=al[i]*sum(al[i+1:N])
print(int(sss)%1000000007) |
p02572 | s432991820 | Wrong Answer | N=int(input())
List = list(map(int, input().split()))
S=0
for i in range(len(List)):
S+=List[i]
mod=10**9+7
S=S%mod
T=0
for i in range(len(List)):
T+=List[i]*(S-List[i])
T=T%mod
print(T/2) |
p02572 | s223532042 | Wrong Answer | n=int(input())
num=input().split()
sq=[]
for i in range(n):
num[i]=int(num[i])
sq.append(num[i]*num[i])
total=sum(num)
total=total*total
sqtotal=sum(sq)
print((total-sqtotal)/2) |
p02572 | s444697503 | Wrong Answer | import numpy as np
n = int(input())
a = input().split()
ai=np.array(a, dtype="int64")
total=sum(ai)**2
diagonal=sum(ai**2)
ans=(total-diagonal)/2
print(int(ans%(1E9+7))) |
p02572 | s626440495 | Wrong Answer | import numpy as np
n = int(input())
a_s = list(map(int, input().split()))
a_s_np = np.array(a_s)
inpro = np.inner(a_s, a_s)
sum_a = np.sum(a_s)
ans = (sum_a * sum_a - inpro) // 2
print(ans)
|
p02572 | s902520601 | Wrong Answer | n= int(input())
mod=10**9+7
a= [int(x ) for x in input().split()]
b= a[:]
s=0
for i in range(n-2,-1,-1):
b[i]=b[i+1]+b[i]
for i in range(n):
s += (b[i]-a[i])*a[i]
|
p02572 | s651959171 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
z = 0
for i in range(n):
z += a[i]
y = z ** 2
x = 0
for j in range(n):
x += a[j] ** 2
w = int(((y - x) / 2) % 1000000007)
print(w) |
p02572 | s211369151 | Wrong Answer | n = int(input())
a_list = list(map(int, input().split()))
count = 0
b_list = a_list
for i in range(n-1):
for k in range(len(b_list[i+1:])):
count += a_list[i] * b_list[i+1:][k]
print(count)
|
p02572 | s141060191 | 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 = ((sq_sum_num - sq_sum_taikaku)/2)
total_v = totals % (10**9+7)
print(int(total_v)) |
p02572 | s346755325 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split()))
mod = 1000000007
res = np.cumsum(A, dtype=np.float64)
ans = 0
for i in range(N-1):
S = (res[N-1]-res[i]) % mod
ans += A[i]*S
ans %= mod
print(int(ans)) |
p02572 | s411628653 | Wrong Answer | mod = 1e9 +7
n = int(input())
a = list(map(int,input().split()))
a_sum = sum(a)
a_sum_sq = (a_sum*a_sum)%mod
i = 0
for y in range(n):
i += (a[y]*a[y])
i %= mod
print(int((((a_sum_sq-i)+mod)%mod)/2)) |
p02572 | s226239490 | Wrong Answer | import numpy as np
import copy
N = int(input())
h = list(map(int, input().split()))
h.sort(reverse=True)
h2 = copy.copy(h)
ans = 0
s = np.sum(h2)
for i in range(N-1):
s = s - h[i]
ans = ans + h[i] * s
ans = ans % (10 ** 9 + 7)
print(int(ans)) |
p02572 | s568336013 | Wrong Answer | n = int(input())
x = list(map(int, input().strip().split()))
sum=0
minsum=0
for i in range(0,n):
minsum += x[i]
for i in range(0,n-1):
minsum-=x[i]
sum += x[i]*minsum
print(sum)
if(sum>10**9+7):
sum%=(10**9+7)
print(sum) |
p02572 | s935350146 | Wrong Answer | n,*l=map(int,open(0).read().split())
print(int((sum(l)**2 - sum([a**2 for a in l])) / 2) % (10**9 + 7))
|
p02572 | s938040017 | Wrong Answer | # -*- coding: utf-8 -*-
N= int(input())
A= list(map(int,input().split(' ')))
ans = 0
for i in range(len(A)-1):
for j in range(i+1, len(A)):
ans += A[i]*A[j]
print(ans)
|
p02572 | s654536223 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
# (A合計**2)-ΣAそれぞれ**2
mod = 10**9+7
AA = sum(A)
ans = (AA%mod)**2
ans %= mod
for a in A:
ans -= a**2
ans %= mod
ans %= mod
print(ans//2) |
p02572 | s832452744 | Wrong Answer | n= int(input())
a=list(map(int,input().split()))
nanika=[]
s=sum(a)
k=0
ans=0
for i in range(n):
k+=a[i]
nanika.append(k)
for j in range(n):
ans+=a[j]*(s-nanika[j])
print(int(ans%(1e+9 +7))) |
p02572 | s861263046 | Wrong Answer | n = int(input())
a = list(map(int, input().split(' ')))
MOD = 1000000007
sum_all = 0
for i in range(len(a)):
sum_all += a[i]
sum_all %= MOD
sum = 0
for i in range(len(a)):
sum += ((sum_all-a[i])*a[i])
sum %= MOD
print(((sum//2) % MOD)) |
p02572 | s506363959 | Wrong Answer | n = input()
vals = list(map(int, input().split()))
s = sum(vals)
ret = 0
for i, val in enumerate(vals):
ret += val * (s - val)
mod = 10 ** 9 + 7
print(int(ret/2) % mod) |
p02572 | s996677953 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
res = 0
for i in range(n):
res = res + (sum - a[i]) * a[i]
print(int(res% (10**9 + 7)/2)) |
p02572 | s431494177 | Wrong Answer | import itertools
N = int(input())
A = list(map(int, input().split()))
sm=0
mod=10**9+7
for i in itertools.combinations(A,2):
sm+=(i[0]*i[1])%mod
sm%mod
print(sm) |
p02572 | s237029046 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
assert(len(A) == N)
ps = A.copy()
sum_now = A[N-1]
for j in range(N-2,0,-1):
sum_now = (sum_now + A[j])%(1e9+7)
ps[j] = sum_now
res = 0
for i in range(N-1):
res = (res + A[i] * ps[i+1]) % (1e9+7)
print(int(res)) |
p02572 | s142383361 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
sumA = sum(A)
s = sum(a*a for a in A)
ans = sumA*sumA - s
print(ans//2)
|
p02572 | s728506366 | 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)
x=(x-1)%(10**9+7)
print(x) |
p02572 | s279686514 | Wrong Answer | #code
from itertools import combinations
n=1
while n>0:
n-=1
s=0
k=int(input())
l=list(map(int,input().split()))
p=list(combinations(l,2))
for i in p:
t=list(i)
s=s+(t[0]*t[1])
print(s) |
p02572 | s119910241 | Wrong Answer | n=int(input())
x = [int(i) for i in input().split()]
s1=0
s2=0
for i in range (0,n):
s1=s1+x[i]
s2=s2+x[i]**2
s1=s1**2
ans=(s1-s2)/2
print(int(ans%1000000007)) |
p02572 | s359329383 | Wrong Answer | N = int(input())
A_list = [int(_) for _ in input().split()]
sum_of_A_sq = sum(A_list)
sum_of_sq_A = sum([_**2 for _ in A_list])
ans = (sum_of_A_sq**2-sum_of_sq_A)/2
ans = ans%(10**9+7)
print(int(ans)) |
p02572 | s356811041 | Wrong Answer | from numba import jit
import numpy as np
@jit
def main():
N = int(input())
A = np.array(list(map(int, input().split())), dtype=np.int64)
mod = 10**9 + 7
answer = 0
for i in range(N):
answer = answer % mod + A[i] % mod * (A[i+1:]).sum() % mod
print(answer)
main() |
p02572 | s336772415 | Wrong Answer | n = int(input())
alist = list(map(int,input().split()))
wa = sum(alist) % (10**9 + 7)
answer = 0
for i in range(n):
atai = 0
if wa - alist[i] < 0:
atai = wa - alist[i] + 10**9 + 7
else:
atai = wa - alist[i]
answer += atai * alist[i]
answer = answer % (10**9 + 7)
print(int(answer/2)) |
p02572 | s010637025 | Wrong Answer | import numpy as np
n = int(input())
num_list = list(map(int, input().split()))
mod = 1e+9+7
cumsum_list = np.cumsum(num_list[::-1])[::-1][1:]
score = 0
for i in range(n-1):
score += num_list[i] * cumsum_list[i] % mod
print(int(score % mod)) |
p02572 | s826610031 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
f = sum(a)%mod
ans = 0
for i in range(n):
e = (f-a[i])%mod
ans+= (e*a[i])%mod
ans%=mod
print(int(round(ans/2))) |
p02572 | s025570939 | Wrong Answer | import numpy as np
mod = 10**9+7
N = int(input())
A = np.array([int(i) for i in input().split()])
sum = A.sum() % mod
B = np.square(A)
sum2 = B.sum() % mod
ans = (sum**2 - sum2) % mod
if ans%2==1 : ans += mod
ans //= 2
ans %= mod
print(int(ans))
|
p02572 | s564639178 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
mod = 10**9 + 7
x = int(sum(A) / 2)**2 * 2 % mod
y = (x - sum([a**2 / 2 % mod for a in A]))
print(int(y) % mod)
|
p02572 | s096746539 | Wrong Answer | # C - Sum of product of pairs
import numpy as np
N = int(input())
A = list(int(a) for a in input().split())
A = np.array(A)
MOD = 10**9 + 7
csA = np.cumsum(A)
ans = 0
for i in range(N-1):
ans += (A[i] * (csA[-1] - csA[i])) % MOD
ans = ans % MOD
print(ans%MOD) |
p02572 | s307438175 | Wrong Answer | n=int(input())
b=input().split()
i=0
j=1
s=0
while i<(n-1):
if j==n:
i+=1
j=i+1
else:
s=(s+(int(b[i])*int(b[j])))
j+=1
print(s)
|
p02572 | s743826292 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
x = 0
for a in A:
ans = (ans + a * x) % (1e9+7)
x = (x + a) % (1e9+7)
print(ans)
|
p02572 | s738943858 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
mod = 10**9+7
total = sum(A)
ans = 0
for a in A:
ans += (total-a)*a
ans = ans % mod
ans = ans // 2
print(ans) |
p02572 | s552731481 | Wrong Answer | import numpy as np
import itertools
N = input()
A = list(map(int,input().split()))
mod = 10**9+7
s = 0
for pair in itertools.combinations(A, 2):
s = s + (pair[0]*pair[1] % mod)
print(s)
|
p02572 | s355987165 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = sum(a)**2
c = 0
for i in range(n):
c += a[i]**2
print((b-c)/2%(10**9+7)) |
p02572 | s366518322 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=sum(a)*sum(a)
for i in range(n):
ans-=a[i]*a[i]
ans/=2
mod=10**9+7
ans//=mod
print(ans) |
p02572 | s430672342 | Wrong Answer | N = int(input())
A = [int(e) for e in input().split()]
S = [0]
sum =0
for i in range(0, N):
S.append(S[i] + A[i])
print(S[i+1])
for i in range(N):
sum = sum + (S[i+1]-A[i]) * A[i]
print(sum)
|
p02572 | s922013049 | Wrong Answer |
import collections
from functools import lru_cache
import bisect
INF = float("inf")
ZERO = 0
ONE = 1
def read():
return input().strip()
def readInt():
return int(input().strip())
def readList():
return list(map(int, input().strip().split()))
def solve(N, arr):
ans = 0
MOD = 10**9 + 7
s = sum(arr) % MOD
for num in arr:
ans = (ans + (s-num)*num) % MOD
return (ans % MOD) // 2
N = readInt()
arr = readList()
print(solve(N, arr))
|
p02572 | s228305257 | Wrong Answer | from sys import stdin
n = stdin.readline().rstrip().split()[0]
A = [int(x) for x in stdin.readline().rstrip().split()]
print(int(((sum(A)**2 - sum([a**2 for a in A])) / 2) % (10**9 + 7))) |
p02572 | s263260357 | Wrong Answer | a = int(input())
p = list(map(int,input().split()))
t = 1
sum_list = []
for i in range(a):
for t in range(a):
if i >= t:
continue
w = p[i]*p[t]
sum_list.append(w)
print(sum(sum_list)) |
p02572 | s451331032 | Wrong Answer | N=int(input())
S=list(input().split())
A=[int(n) for n in S]
ans=int(0)
for i in A:
for j in A:
ans += i*j
print(ans) |
p02572 | s587306093 | Wrong Answer | n = int(input())
a = list(map(int, input().split(' ')))
MOD = 1000000007
sum_all = 0
for i in range(len(a)):
sum_all += a[i]
#sum_all %= MOD
sum = 0
#print(sum_all)
for i in range(len(a)):
X = (sum_all - a[i])
Y = a[i]
sum += (X*Y/2)%MOD
print(int(sum)%MOD) |
p02572 | s444558378 | Wrong Answer | n=int(input())
i = list(map(int, input().split()))
m=sum(i)
ans=0
for k in range(n-1):
ans+=(i[k]+(m-i[k]))
ans=ans//2
ans=ans%(10**9+7)
print(ans) |
p02572 | s070069910 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
C=[A[i]**2 for i in range(N)]
print(int(((sum(A)**2-sum(C))/2)%(10**9+7))) |
p02572 | s867800165 | 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]
print((ans/2)%(10**9+7)) |
p02572 | s694492648 | 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)//2)
|
p02572 | s567702662 | Wrong Answer | N = 3
alist = [1, 2, 3]
Sum_a = 0
for i in range(N):
Sum_j = 0
for j in range(i+1, N):
Sum_j += alist[j]%(1e9+7)
Sum_a += (alist[i]%(1e9+7))*Sum_j
print(int(Sum_a)) |
p02572 | s337565568 | Wrong Answer | n = int(input())
m = 1e9 + 7
a = list(map(int, input().split()))
s = sum(a)
s *= s
r = sum([x*x for x in a])
ans = (s - r) / 2
ans %= m
print(ans) |
p02572 | s701723382 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
p=10**9+7
for i in range(n):
ans=(ans+a[i]**2)%p
am=sum(a)%p
print(((am**2-ans)%p)//2) |
p02572 | s278692403 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
sum_of_power = sum(A) ** 2
power_of_sum = sum([a ** 2 for a in A])
ans = ((sum_of_power - power_of_sum) / 2) % (1e9 + 7)
print(int(ans)) |
p02572 | s749759478 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
sums = 0
for i in range(n):
sums += a[i]
sums = sums*sums;
suma = 0
for i in range(n):
suma += a[i]*a[i]
ans = (sums - suma) / 2
ans %= 1000000007
if (ans < 0):
ans += 1000000007
ans /= 2
print(int(ans))
|
p02572 | s419345131 | Wrong Answer | mod = pow(10,9)+7
n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(n):
a[i] %= mod
ans += sum(a)*sum(a)
for i in range(n):
ans -= a[i]*a[i]
ans = int(ans/2)
print((ans)%mod) |
p02572 | s758803692 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
A_cum = np.array(A).cumsum()
ans = 0
for i in range(N):
ans += ((A_cum[-1] - A_cum[i]) * A[i])
print(ans % mod)
|
p02572 | s377699121 | Wrong Answer | N = int(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]
# div, mod = divmod(ans, 1000000007)
# print(mod)
diag=0
for a in A:
diag+=a**2
print(int(((sum(A)**2-diag)/2) % (1e9+7)))
|
p02572 | s819392322 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
if sum(a)==0:
print(0)
exit()
else:
k=1
for i in range(n-1):
for j in range(i+1,n):
k*=a[i]*a[j]
k/=10**9+7
print(k)
|
p02572 | s769786870 | Wrong Answer | n = int(input())
A = list(map(int,input().split()))
wa = sum(A)
ans = 0
for i in range(n):
ans += (wa - A[i]) * A[i]
print((ans % ((10 ** 9)+7))//2) |
p02572 | s570725389 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = 10**9+7
sa = sum(a)
c=0
for i in a:
c +=i*i
print(int(((sa**2-c)/2)%b)) |
p02572 | s836862916 | Wrong Answer | n = int(input())
aaa = list(map(int, input().split()))
sum_a = 0
sum_aa = 0
for a in aaa:
sum_a += a
sum_aa += a ** 2
print(int(((sum_a ** 2 - sum_aa) / 2) % (10 ** 9 + 7))) |
p02572 | s025786561 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in a[:n]:
for j in a[a.index(i)+1:]:
ans += i*j
print(ans%(10**9+7)) |
p02572 | s413825645 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A_sum = 0
for i in range(0, N, 1):
A_sum = A_sum + A[i]
A_sum_sq = A_sum * A_sum
idv_sq_sum = 0
for i in range(0, N, 1):
idv_sq_sum += A[i] * A[i]
Answer = (A_sum_sq -
idv_sq_sum) / 2
print(Answer%(10**9 + 7)) |
p02572 | s828020433 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
Sum = 0
mod_n = 10.0E8 +7
for i in range(N-1):
for j in range(i+1,N):
if j == len(A):
break
else:
Sum += A[i]*A[j]
# for i in A:
# Sum -= i**2
# Sum = int(Sum/2)
print(Sum)
print(int(Sum % mod_n)) |
p02572 | s094466958 | Wrong Answer | import numpy as np
N = int(input())
A = np.array([int(i) for i in input().split()])
sum = A.sum()
sum2 = int((A**2).sum())
ans = int(((A.sum())**2 - sum2)/2) % (10**9+7)
print(ans) |
p02572 | s444113488 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
sum = 0
ans = 0
for i in range(n):
sum+=a[i]
for i in range(n):
sum-=a[i]
ans+=(a[i]*sum)
ans%=1e9+7
print(int(ans))
|
p02572 | s423113087 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
sum = 0
m = 10**9+7
for i in range(n):
sum = (sum+a[i])%m
#sum = sum%m
#sum = sum*sum
ans = 0
for i in range(n):
ans = (ans + sum*a[i])%m
ans = (ans - a[i]*a[i])%m
ans = int(ans/2)
ans = ans%m
print(ans) |
p02572 | s688087601 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
n = int(input())
A = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]
MOD = 10**9+7
tot = sum(A)
ans = 0
for a in A:
ans += a*(tot-a)
ans %= MOD
ans //= 2
ans %= MOD
print(ans)
|
p02572 | s512917672 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=sum(a)*sum(a)
for i in range(n):
ans=ans-(a[i]*a[i])
ans=ans/2
mod=10**9+7
ans=ans%mod
print(ans) |
p02572 | s612070921 | Wrong Answer | import sys
import array
import numpy as np
N = int(input())
A = list(map(int, input().split()))
array_sum = 0
B = np.array(A)
result = (B.sum()**2 - B.dot(B)) / 2
print(int(result%(10**9+7))) |
p02572 | s005215001 | Wrong Answer | #入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n=int(input())
A=input_array()
acc_A=[0]
for i in range(n):
acc_A.append(acc_A[i]+A[i])
ans=0
print(A,acc_A)
for i in range(n):
# print(A[i]*acc_A[i:n+1])
ans+=A[i]*(acc_A[n]-acc_A[i+1])
print(ans %(10**9+7)) |
p02572 | s001572899 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
A = [0]*(n)
num = 1e9+7
ans = 0
for i in range(1, n):
A[i] = A[i-1] + a[i-1]
for i in range(n-1, 0, -1):
ans += (A[i]*a[i])%num
ans %= num
ans %= num
print(int(ans)) |
p02572 | s822204039 | Wrong Answer | def solve():
N = int(input())
AA = list(map(int,input().split()))
ans = 0
for a in AA:
ans += a
ans = ans % (10**9+7)
ans = ans**2
for a in AA:
ans -= a**2
if ans<0:
ans += 10**9+7
ans = ans % (10**9+7)
while ans<0:
ans += 10**9+7
print(int(ans/2))
solve() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.