input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a_list = list(map(int, input().split()))
if n != 0 :
ans = a_list[0]
else :
ans = 0
for i in range(1, n):
ans = ans * a_list[i]
if 10**18 < ans :
ans = -1
print(ans) |
n = int(eval(input()))
a_list = list(map(int, input().split()))
if n != 0 :
ans = a_list[0]
else :
ans = 0
if 0 in a_list :
ans = 0
for i in range(1, n):
ans = ans * a_list[i]
if 10**18 < ans :
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in range(N):
ans *= a[i]
if ans > 10 ** 18 and 0 not in a:
print((-1))
break
else:
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
else:
for i in range(N):
ans *= a[i]
if ans > 10 ** 18:
print((-1))
break
else:
print(ans) | p02658 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
for i in range(N):
ans = ans*A[i]
if ans>10**18:
ans = -1
return ans
if __name__=="__main__":
ans = main()
print(ans) | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
if 0 in A:
ans = 0
else:
for i in range(N):
ans = ans*A[i]
if ans>10**18:
ans = -1
break
return ans
if __name__=="__main__":
ans = main()
print(ans) | p02658 |
import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10 ** 9 + 7
INF = 10 ** 18
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
answer = 1
for i in range(N):
answer *= A[i]
if answer > INF:
print((-1))
else:
print(answer)
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10 ** 9 + 7
INF = 10 ** 18
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
return
answer = 1
for i in range(N):
answer *= A[i]
if answer > INF:
print((-1))
return
print(answer)
if __name__ == "__main__":
main()
| p02658 |
n = int(eval(input()))
lst = list(map(int, input().split()))
mult = 1
for i in lst:
mult *= i
if mult > 10 ** 18:
print((-1))
exit()
else:
print(mult) | n = int(eval(input()))
lst = sorted(list(map(int, input().split())))
mult = 1
for i in lst:
mult *= i
if 10**18 < mult:
print((-1))
exit()
else:
print(mult) | p02658 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = 1
for i in range(n):
ans *= a[i]
if ans > pow(10, 18):
print((-1))
else:
print(ans)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = 1
a.sort()
for i in range(n):
ans *= a[i]
#print(ans)
if ans > pow(10, 18):
print((-1))
exit()
print(ans)
| p02658 |
from functools import reduce
N = int(eval(input()))
A = reduce(lambda x, y:x*y if x*y <= 10**18 else -1, list(map(int, input().split())))
print(A)
| from math import log
from functools import reduce
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
if A[0] == 0:
print((0))
else:
ans = 1
for a in reversed(A):
ans *= a
if ans > 10**18:
ans = -1
break
print(ans)
| p02658 |
import sys
def main():
n = int(eval(input()))
A = list(map(int, sys.stdin.readline().split()))
ans = 1
for i in range(n):
ans *= A[i]
if ans > 10 ** 18:
print('-1')
else:
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n = int(eval(input()))
A = list(map(int, sys.stdin.readline().split()))
ans = 1
if 0 in A:
print((0))
sys.exit()
for i in range(n):
ans *= A[i]
if ans > 10 ** 18:
print('-1')
sys.exit()
print(ans)
if __name__ == '__main__':
main() | p02658 |
import functools
import operator
n = int(eval(input()))
ms = list(map(int, input().split()))
if 0 in ms:
r = 0
else:
r = functools.reduce(operator.mul, ms)
if r > 10 ** 18:
r = -1
print(r) | n = int(eval(input()))
ms = list(map(int, input().split()))
iter_ms = iter(ms)
r = 1
if 0 in ms:
r = 0
else:
for i in range(n):
x = next(iter_ms)
r *= x
if r > 10 ** 18:
r = -1
break
print(r) | p02658 |
n = int(eval(input()))
s = list(map(int, input().split()))
ans = 1
for i in range(n):
if s[i] == 0:
print("0")
exit()
ans *= s[i]
if ans > 10**18:
print("-1")
else: print(ans) | n = int(eval(input()))
s = list(map(int, input().split()))
ans = 1
if 0 in s:
print("0")
exit()
for i in range(n):
ans *= s[i]
if ans > 10**18:
print("-1")
exit()
print(ans) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for x in a:
ans *= x
if ans > 10**18:
print((-1))
else:
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
a.sort()
for x in a:
ans *= x
if x == 0:
print((0))
break
elif ans > 10**18:
print((-1))
break
else:
print(ans)
| p02658 |
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
max_ans = 10 ** 18
ans = 0
for i in A:
if ans == 0:
ans = i
else:
ans *= i
if max_ans < ans:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
A = list(map(int, input().split()))
max_ans = 10 ** 18
ans = 0
if 0 in A:
print((0))
exit()
for i, a in enumerate(A):
if i == 0:
ans = a
continue
ans = ans * a
if ans > max_ans:
print((-1))
exit()
if max_ans < ans:
print((-1))
else:
print(ans)
if __name__ == '__main__':
main()
| p02658 |
from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int,input().split()))
count =data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count ==0:
break
elif count <= 10**18:
count *= _
if count ==0:
print((0))
elif count <= 10**18:
print(count)
else:
print((-1)) | from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int,input().split()))
count =data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count ==0:
break
elif count <= 10**18:
count *= _
if count <= 10**18:
print(count)
else:
print((-1)) | p02658 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
ans = 1
for i in range(N):
ans *= A[i]
if ans>10**18:
ans = -1
break
print(ans) | # B - Multiplication 2
N = int(eval(input()))
A = list(map(int,input().split()))
def ans():
global N,A
for i in range(N):
if A[i]==0:
return 0
tmp = 1
for i in range(N):
tmp *= A[i]
if tmp>10**18:
return -1
return tmp
print((ans())) | p02658 |
n = int(eval(input()))
aas = list(map(int, input().split()))
if 0 in aas:
print((0))
exit()
res = 1
for i in aas:
res*=i
if res>10**18:
print((-1))
else:
print(res) | n = int(eval(input()))
aas = list(map(int, input().split()))
if 0 in aas:
print((0))
exit()
res = 1
for i in aas:
res*=i
if res > 10 ** 18:
print((-1))
exit()
else:
print(res) | p02658 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
i=n-1
res=1
z=10**18
while(i>=0):
res*=a[i]
if(a[i]>z):
break
i-=1
if(res>z):
res=-1
print(res) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
res=1
z=10**18
for i in a:
if(i==0):
res=0
break
i=n-1
while(i>=0):
if(a[i]==0):
res=0
break
if(res>z/a[i]):
res=z+1
break
res*=a[i]
if(a[i]>z):
break
i-=1
if(res>z):
res=-1
print(res) | p02658 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = 1
for i in range(n):
s *= a[i]
if s > 1000000000000000000:
print((-1))
else:
print(s) | n = int(eval(input()))
a = list(map(int,input().split()))
if 0 in a:
print((0))
else:
s = 1
for i in range(n):
s *= a[i]
if s > 10**18:
break
elif a[i] == 0:
break
if s > 10**18:
print((-1))
else:
print(s)
| p02658 |
x = int(eval(input()))
line = [int(y) for y in input().split()]
yeet = 1
for i in range(0,x):
yeet = yeet*line[i]
if yeet > 10**18:
print((-1))
else:
print(yeet)
| x = int(eval(input()))
line = [int(y) for y in input().split()]
line.sort()
yeet = 1
solved = False
if line[0] == 0:
print((0))
else:
for i in range(0,x):
yeet = yeet*line[i]
if yeet > 10**18:
solved = True
print((-1))
break
if solved == False:
print(yeet) | p02658 |
n = eval(input())
s = 1
for i in input().split():
s = s * int(i)
if s > 1e+18:
print((-1))
else:
print(s) | n = eval(input())
s = 1
int_list = [int(s) for s in input().split()]
if 0 in int_list:
print((0))
else:
for i in int_list:
s = s * int(i)
if s > 1e+18:
s = -1
break
print(s) | p02658 |
from sys import stdin
N = int(eval(input()))
A = list(map(int, stdin.readline().split()))
"""ans = 1
for a in A:
ans = ans*a
if ans == 0:
break"""
from functools import reduce
ans = reduce(lambda x,y:x*y,A)
if ans >10**18:
print((-1))
else:
print(ans)
| from sys import stdin
N = int(eval(input()))
A = list(map(int, stdin.readline().split()))
if 0 in A:
print((0))
else:
ans = 1
for a in A:
ans = ans*a
if ans > 10**18:
break
"""from functools import reduce
ans = reduce(lambda x,y:x*y,A)"""
"""import numpy as np
A = np.array(A)
ans = np.prod(A)"""
if ans >10**18:
print((-1))
else:
print(ans)
| p02658 |
#TIME :
import sys
from math import sqrt
input = sys.stdin.readline
def inp():
return(int(eval(input())))
def inlt():
return(list(map(int,input().split())))
def insr():
s = eval(input())
return(list(s[:len(s) - 1]))
def invr():
return(list(map(int,input().split())))
MAX = 10**18
n = inp()
a = inlt()
if 0 in a:
print((0))
exit()
res = 1
for num in a:
res*=num
if res > MAX:
print((-1))
else:
print(res) | def main ():
N = int(eval(input()))
A = list(map(int,input(). split ()))
if 0 in A:
print((0))
return
prod = 1
for a in A:
prod *= a
if prod > 1000000000000000000:
print((-1))
return
print(prod)
main () | p02658 |
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n = int(stdin.readline().rstrip())
a = list(map(int,stdin.readline().rstrip().split()))
if 0 in a:
print((0))
exit()
now = 1
for i in a:
now *= i
if now > 10**18:
print((-1))
exit()
print(now)
| n = int(eval(input()))
a = list(map(int,input().split()))
if 0 in a:
print((0))
exit()
now = 1
for i in a:
now *= i
if now > 10**18:
print((-1))
exit()
print(now) | p02658 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
ans=1
for i in range(n):
ans*=a[i]
if ans>10**18:
print((-1))
break
else:
print(ans) | t=1;[t:=(-1,t:=t*int(a))[0<=t<=1e18] for a in[*open(0)][1].split()];print(t) | p02658 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
for i in range(n):
ans *= a[i]
if ans > 10**18:
print((-1))
else:
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print((0))
exit()
for i in range(n):
ans *= a[i]
if ans > 10**18:
print((-1))
exit()
print(ans) | p02658 |
#import numpy as np
import functools
import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
N = int(eval(input()))
#H1,M1,H2,M2,K= map(int,input().split())
A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
prod = functools.partial(functools.reduce, operator.mul)
#c=np.array(A)
p=prod(A)
if p<0:
p=p*(-1)
if p>10**18:
print((-1))
else:
print(p)
| N = int(eval(input()))
#H1,M1,H2,M2,K= map(int,input().split())
A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
#prod = functools.partial(functools.reduce, operator.mul)
#c=np.array(A)
#p=np.prod(A)
c=1
if 0 in A:
print((0))
exit()
for i in A:
c=c*i
if c>10**18:
print((-1))
exit()
print(c)
| p02658 |
from operator import mul
from functools import reduce
n = eval(input())
tmp = input().split(" ")
l = (int(e) for e in tmp)
res = 1
res = reduce(mul,l)
if res > 1e+18:
print("-1")
else:
print(res) | from operator import mul
from functools import reduce
n = eval(input())
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
res = 1
for e in l:
res = e*res
if res > 1e+18:
print("-1")
return
print(res)
solve() | p02658 |
from functools import reduce
from operator import mul
N = int(eval(input()))
A = sorted(list(map(int,input().split())),reverse = True)
lim = 10 ** 18
ans = 1
for i in A:
ans *= i
if ans > lim and A[-1] > 0:
ans = -1
break
print(ans) | from functools import reduce
from operator import mul
N = int(eval(input()))
A = sorted(list(map(int,input().split())),reverse = True)
lim = 10 ** 18
ans = 1
if A[-1] == 0:
print((0))
else:
for i in A:
ans *= i
if ans > lim:
ans = -1
break
print(ans) | p02658 |
N = int(eval(input()))
N_list = [int(i) for i in input().split()]
res = 1
for i in range(len(N_list)) :
res = res * N_list[i]
if (res > 1000000000000000000) :
print((-1))
else :
print(res) | def main() :
N = int(eval(input()))
N_list = [int(i) for i in input().split()]
res = 1
if (N_list.count(0) > 0) :
print((0))
return
for i in range(len(N_list)) :
res = res * N_list[i]
if (res > 1000000000000000000) :
print((-1))
return
print(res)
main() | p02658 |
eval(input())
*a, = list(map(int, input().split()))
ans = 1
for i in a: ans *= i
print((ans if ans<=10**18 else -1)) | eval(input())
*a, = list(map(int, input().split()))
if 0 in a:
print((0))
exit()
ans = 1
a = sorted(a)[::-1]
for i in a:
ans *= i
if ans > 10**18:
print((-1))
exit()
print(ans) | p02658 |
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
flag = 0
zeroflag = 0
for a in A:
ans *= a
if ans > pow(10, 18):
flag = 1
if a == 0:
zeroflag = 1
if flag:
ans = -1
if zeroflag:
ans = 0
print((ans if ans <= pow(10, 18) else -1))
| n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
flag = 0
zeroflag = 0
for a in A:
if a == 0:
print((0))
exit()
for a in A:
ans *= a
if ans > pow(10, 18):
print((-1))
exit()
print(ans)
| p02658 |
import math
import fractions
import collections
import itertools
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
ans=1
flag=1
for i in range(N):
ans=ans*A[i]
if ans>10**18:
flag=0
if flag==1:
print(ans)
else:
print((-1)) | import math
import fractions
import collections
import itertools
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
#A=[10**5]*(10**5)
#N=10**5
ans=1
flag=1
for i in range(N):
ans=ans*A[i]
if ans>10**18:
flag=0
break
if flag==1:
print(ans)
else:
print((-1)) | p02658 |
N = int(eval(input()))
AB = list(map(int, input().split()))
limit = 10 ** 18
sum = 1
for i in range(N):
sum *= AB[i]
if (limit < sum):
print((-1))
else:
print(sum)
| N = int(eval(input()))
AB = list(map(int, input().split()))
limit = 1000000000000000000
sum = 1
for i in range(N):
if (limit < sum or sum == -1):
sum = -1
else:
sum *= AB[i]
if (AB[i] == 0):
print((0))
exit()
if (limit < sum):
sum = -1
print(sum)
| p02658 |
N = int(eval(input()))
nums = input().split()
nums = [int(s) for s in nums]
result = 1
for num in nums:
result = result * num
if 10**18 < result:
result = -1
print(result) | N = int(eval(input()))
nums = input().split()
end = False
result = 1
for num in nums:
if num == "0":
print((0))
end = True
break
if not end:
nums = [int(s) for s in nums]
for num in nums:
result = result * num
if 10**18< result:
result = -1
break
print(result)
| p02658 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = a[0]
for i in range(1,n):
ans *= a[i]
if ans > 10**18:
print((-1))
else:
print(ans)
| n = int(eval(input()))
a = [int(x) for x in input().split()]
lim = 10**18
flag = True
ans = a[0]
if a.count(0) >= 1:
ans = 0
else:
for i in range(1,n):
ans *= a[i]
if ans > lim:
flag = False
break
if flag:
print(ans)
else:
print((-1))
| p02658 |
N = int(eval(input()))
A = list(map(int, input().split()))
mul = 1
for i in range(N):
mul *= A[i]
if mul > 10**18:
print("-1")
else:
print(mul)
| N = int(eval(input()))
A = list(map(int, input().split()))
#print(A)
A.sort()
#print(A)
mul = 1
for i in range(N):
if mul == 0:
break
elif mul > 10**18:
mul = -1
break
else:
mul *= A[i]
if mul > 10**18:
print("-1")
else:
print(mul)
| p02658 |
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
res = 1
for num in A:
res = res * num
if res > 10 ** 18:
print((-1))
else:
print(res)
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
A = list(map(int, input().split()))
res = 1
if 0 in A:
res = 0
else:
for num in A:
res = res * num
if res > 10**18:
res = -1
break
print(res)
if __name__ == '__main__':
main() | p02658 |
n=int(eval(input()))
x=list(map(int, input().split()))
ans = 1
for i in x:
ans = ans*i
if ans > 1000000000000000000:
ans = -1
print(ans)
| n=int(eval(input()))
x=list(map(int, input().split()))
ans=1
if 0 in x:
ans=0
else:
for i in x:
ans=ans*i
if ans>10**18:
ans=-1
break
print(ans) | p02658 |
n = int(eval(input()))
a = [int(v) for v in input().split()]
ans = 1
num = 1
limit = 1000000000000000000
for i in a:
if i == 0:
num = 0
break
if i >= limit:
num = -1
break
else:
num *= i
if num > limit:
num = -1
ans = num
print(ans)
| n = int(eval(input()))
a = [int(v) for v in input().split()]
limit = 1000000000000000000
if 0 in a:
print((0))
else:
ans = 1
num = 1
for i in a:
num *= i
if num > limit:
num = -1
break
ans = num
print(ans) | p02658 |
while True:
try:
for i in range(3):
line = input().strip()
if line == '0':
raise Exception
a = b = 0
for i, s in enumerate(line):
if i != 0:
if s == 'A':
a += 1
else:
b += 1
if a > b:
a += 1
else:
b += 1
print(a, b)
except:
break | while True:
try:
for i in range(3):
line = input().strip()
if line == '0':
raise Exception
if line[0] == 'A':
a = -1
b = 0
else:
a = 0
b = -1
for i, s in enumerate(line):
if s == 'A':
a += 1
else:
b += 1
if a > b:
a += 1
else:
b += 1
print(a, b)
except:
break | p00174 |
# -*- using:utf-8 -*-
from itertools import combinations
if __name__ == "__main__":
n = int(eval(input()))
li = list(map(int, input().split()))
array = list(combinations(li, 2))
sum = 0
mod = 1000000007
for i in range(len(array)):
sum += array[i][0] * array[i][1]
ans = sum % mod
print(ans) | # -*- using:utf-8 -*-
from itertools import combinations
class main:
def v(array):
sum = 0
mod = 1000000007
for i in range(len(array)):
sum += array[i][0] * array[i][1]
ans = sum % mod
print(ans)
if __name__ == "__main__":
n = int(eval(input()))
li = list(map(int, input().split()))
array = list(combinations(li, 2))
main.v(array) | p02572 |
# -*- coding: utf-8 -*-
import sys
import math
from decimal import Decimal, ROUND_DOWN
from collections import deque
from itertools import combinations
import copy
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
for line in sys.stdin:
lines.append(line.strip())
else:
debug = True
lines = [e for e in lines_as_string.split("\n")][1:-1]
(n, ) = [int(e) for e in lines[0].split(' ')]
a = [int(e) for e in lines[1].split(' ')]
return (n, a)
def solve(n, a):
total = 0
m = int(10**9 + 7)
for i in range(n-1):
# for j in range(i+1, n):
# tmp = (a[i] * a[j]) % m
# total = (total + tmp) % m
total = total + (a[i] * (sum(a[i+1:n]) % m))
total = total % m
return total
def main():
# 出力
result = solve(*parse_input())
if isinstance(result, list):
for r in result:
print("%s" % r, sep='')
else:
print("%s" % result, sep='')
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
import math
from decimal import Decimal, ROUND_DOWN
from collections import deque
from itertools import combinations
import copy
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
for line in sys.stdin:
lines.append(line.strip())
else:
debug = True
lines = [e for e in lines_as_string.split("\n")][1:-1]
(n, ) = [int(e) for e in lines[0].split(' ')]
a = [int(e) for e in lines[1].split(' ')]
return (n, a)
def solve(n, a):
total = 0
m = int(10**9 + 7)
s = sum(a)
s_current = 0
for i in range(n):
s_current = s_current + a[i]
total = (total + a[i] * (s - s_current)) % m
total = total % m
return total
def main():
# 出力
result = solve(*parse_input())
if isinstance(result, list):
for r in result:
print("%s" % r, sep='')
else:
print("%s" % result, sep='')
if __name__ == '__main__':
main()
| p02572 |
import sys
input = sys.stdin.readline
def solve():
MOD = 10**9+7
N = int(eval(input()))
A_L = [int(x) for x in input().split()]
ans = 0
for i, ai in enumerate(A_L):
for j in range(i+1, N):
aj = A_L[j]
ans = (ans + ai * aj) % MOD
print(ans)
solve()
| import sys
input = sys.stdin.readline
def solve():
MOD = 10**9+7
N = int(eval(input()))
A_L = tuple(int(x) for x in input().split())
cum_a_l = [0] * N
cum_a_l[0] = A_L[0]
for i in range(1, N):
cum_a_l[i] = (cum_a_l[i-1] + A_L[i]) % MOD
ans = 0
for i in range(N-1, 0, -1):
ans = (ans + cum_a_l[i-1]*A_L[i] % MOD) % MOD
print(ans)
solve()
| p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
mod = 10**9+7
sumans = 0
for i in range(N-1):
sumans += A[i]*sum(A[i+1:])%mod
sumans = sumans%mod
print(sumans) | N = int(eval(input()))
A = list(map(int,input().split()))
mod = 10**9+7
sumpre = 0
sumans = 0
for i in range(N-1):
sumpre += A[i]
sumans += A[i+1]*sumpre%mod
sumans =sumans%mod
print(sumans) | p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
mod = 1000000000+7
T = 0
#print(A[1])
for i in range(N-1):
for j in range(N-i-1):
T += A[i]*A[j+i+1]%mod
#print(T)
T = T%mod
print(T) | 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 |
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
prefixSums = [0]
for num in arr:
prefixSums.append(prefixSums[-1] + num)
for i, num in enumerate(arr):
ans = (ans + num * (prefixSums[-1] - prefixSums[i+1])) % MOD
return ans % MOD
N = readInt()
arr = readList()
print((solve(N, arr)))
|
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
totalSum = sum(arr) % MOD
currSum = 0
for num in arr:
currSum += num
ans = (ans + num * (totalSum - currSum)) % MOD
return ans % MOD
N = readInt()
arr = readList()
print((solve(N, arr)))
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
s = 0
for i in range(len(A)):
for j in range(i + 1, len(A)):
s += A[i] * A[j]
print((s % (10 ** 9 + 7))) | N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
ans = 0
for i in range(N - 1):
s -= A[i]
ans += A[i] * s
print((ans % (10 ** 9 + 7)))
| p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
ans = (ans + A[i] * sum(A[i+1:N])) % (10**9+7)
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
DIV = 10**9+7
ans = 0
Asum = sum(A)
Asum_sq = Asum**2
for i in range(N):
ans += A[i]**2
res = (Asum_sq-ans)//2
print((res%DIV)) | p02572 |
n = int(eval(input()))
k = list(map(int, input().split()))
x = 0
for i in range(0, n - 1):
for j in range(i + 1, n):
x += (k[i] * k[j]) % (10 ** 9 + 7)
if x < 10 ** 9 + 7:
continue
else:
x = x % (10 ** 9 + 7)
print(x) | mod = 10 ** 9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
ans = 0
for i in a:
s -= i
s %= mod
ans += i * s
ans %= mod
print(ans) | p02572 |
#####
# C #
#####
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(len(A)-1):
tmp1 = A[i] % (10**9 + 7)
tmp2 = sum(A[i+1:]) % (10**9 + 7)
ans += tmp1 * tmp2
ans %= (10**9 + 7)
# for j in range(1,len(A)-i
# # print(A[i],'A[i]',A[i+j],'A[i+j]')
# tmp_ai = A[i] % (10**9 + 7)
# tmp_aij = A[i+j] % (10**9 + 7)
# tmp += (tmp_ai * tmp_aij) % (10**9 + 7)
# # print(tmp,'tmp')
# tmp %= (10**9 + 7)
# ans += tmp
# ans %= (10**9 + 7)
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
sumA = sum(A)
ans = 0
for i in range(len(A)-1):
sumA -= A[i]
tmp1 = A[i] % (10**9 + 7)
tmp2 = sumA % (10**9 + 7)
ans += tmp1 * tmp2
ans %= (10**9 + 7)
print(ans) | p02572 |
N=int(eval(input()))
A=list(map(int,input().split()))
mod=10**9+7
sum=0
for i in range(N-1):
for j in range(i+1,N):
sum+=((A[i])*(A[j]))%mod
else:
sum=sum%mod
print(sum) | N=int(eval(input()))
A=list(map(int,input().split()))
mod=10**9+7
B=[0]
for i in range(1,N+1):
B.append(A[i-1]+B[i-1])
ans=0
for i in range(N-1):
ans+=A[i]*(B[N]-B[i+1])
ans%=mod
print((int(ans))) | p02572 |
N=int(eval(input()))
A= list(map(int,input().split()))
ans=0
for i in range(N):
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)
for i in range(N):
S-=A[i]
ans+=A[i]*S
print((ans%(10**9+7))) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
biggest = 0
humidai = 0
result = 0
for i in range(N-1):
tmp=0
for j in range(i+1,N):
tmp += A[j]
result += A[i]*tmp
if result>10**9+7:
result = result%(10**9+7)
result = result%(10**9+7)
print(result) | N = int(eval(input()))
A = list(map(int, input().split()))
biggest = 0
humidai = 0
result = 0
tmp_list = []
tmp=sum(A)
for i in range(N-1):
# for j in range(i+1,N):
# tmp += A[j]
tmp -= A[i]
result += A[i]*tmp
if result>10**9+7:
result = result%(10**9+7)
result = result%(10**9+7)
print(result) | 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):
SUM += A[i]*A[j] % MOD
SUM %= MOD
print(SUM)
| N = int(eval(input()))
A = list(map(int,input().split()))
MOD = 1000000007
SUM = 0
for i in range(N):
SUM += A[i]
SUM = SUM*SUM
for i in range(N):
SUM -= A[i]*A[i]
SUM = SUM // 2
SUM %= MOD
print(SUM)
| p02572 |
x = (10**9)+7
n = int(eval(input()))
val = 0
lst = list(map(int,input().split()))
for i in range(len(lst)):
lst[i] = lst[i]%x
for i in range(n-1):
for j in range(i+1,n):
val += ((lst[i])*(lst[j]))
print((val%x)) | n = int(eval(input()))
arr = list(map(int,input().split()))
su = sum(arr)
c = 0
for item in arr:
c+= item*item
print((((su**2 - c)//2)%(10**9 + 7)))
| p02572 |
import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in itertools.combinations(a,2):
ans+=(i[0]*i[1])%(10**9+7)
print((ans%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
k=sum(a)
for i in a:
k-=i
ans+=i*k
print((ans%(10**9+7))) | p02572 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
num_list = list(map(int, input().split(' ')))
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += num_list[i] * num_list[j] % (10**9 + 7)
if ans >= (10**9 + 7):
ans -= (10**9 + 7)
print(ans) | # -*- coding: utf-8 -*-
N = int(eval(input()))
num_list = list(map(int, input().split(' ')))
list_sum = sum(num_list)
ans = 0
for i in range(N-1):
list_sum -= num_list[i]
ans += num_list[i] * list_sum
print((ans % (10**9 + 7))) | p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
s=0
for i in range(n-1):
j=i+1
while j<=n-1:
s+=a[i]*a[j]
j+=1
ans=s%(10**9+7)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
sa=sum(a)
s=0
for i in range(n-1):
sa-=a[i]
s+=a[i]*sa
ans=s%(10**9+7)
print(ans) | 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()))
ans=0
s=sum(a)
for i in range(n-1,-1,-1):
s-=a[i]
ans+=a[i]*(s)
ans%=10**9+7
print(ans) | p02572 |
n = int(eval(input()))
a_s = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(i+1, n):
ans += a_s[i] * a_s[j]
print((int(ans % (1e9 + 7))))
| n = int(eval(input()))
a_s = list(map(int, input().split()))
sum_a = 0
mul_a = 0
mod = 1000000007
for a in a_s:
sum_a += a
mul_a += a*a
sum_a %= mod
mul_a %= mod
ans = sum_a * sum_a
ans %= mod
ans -= mul_a
ans %= mod
n = mod-2
inv = 1
base = 2
while n:
if n & 1:
inv = inv*base % mod
base = base*base % mod
n >>= 1
ans *= inv
ans %= mod
print(ans)
| p02572 |
import itertools
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for v in itertools.combinations(A, 2):
ans += v[0] * v[1]
print((ans % 1000000007))
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
all_sum = sum(A) ** 2
st = 0
for i in range(N):
st += A[i] ** 2
print((int(((all_sum - st)//2) % 1000000007)))
main()
| p02572 |
n = int(eval(input()))
a = list(map(int,input().split()))
import itertools
ans = 0
for i in itertools.combinations(a, 2):
ans += i[0]*i[1]
ans%=10**9+7
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
gou = sum(a)
ans = 0
for i in range(n):
gou-=a[i]
ans+=a[i]*(gou)
ans%=10**9+7
print(ans) | p02572 |
N = int(eval(input()))
A_ = list(map(int, input().split()))
A = []
mod = 10 ** 9 + 7
for a_ in A_:
a = a_ % mod
A.append(a)
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += A[i] * A[j] % mod
ans %= mod
print(ans) | N = int(eval(input()))
A_ = list(map(int, input().split()))
A = []
mod = 10 ** 9 + 7
for i, a_ in enumerate(A_[::-1]):
if i == 0:
A.append(a_ % mod)
else:
a = (a_ + A[-1]) % mod
A.append(a)
A = A[::-1]
A = A[1:]
ans = 0
for i, a in enumerate(A_[:-1]):
ans += A[i] * a % mod
ans %= mod
print(ans) | p02572 |
N = int(eval(input()))
num_list = list(map(int, input().split()))
mod = 10**9 + 7
num_sum = 0
for i in range(N-1):
for j in range(i+1, N):
num_sum += num_list[i] * num_list[j]
print((num_sum % mod))
| N = int(eval(input()))
num_list = list(map(int, input().split()))
mod = 10**9 + 7
sum_num = 0
sum_list = []
for num in num_list:
sum_num += num
sum_num = sum_num % mod
sum_list.append(sum_num)
answer = 0
for i in range(N):
sum_num -= num_list[i]
sum_num = sum_num if sum_num >= 0 else sum_num + mod
answer += num_list [i] * sum_num
answer = answer % mod
print(answer) | p02572 |
N=int(eval(input()))
A=list(map(int,input().split()))
sum=0
for i in range(N-1) :
for j in range(i+1,N) :
sum+=A[i]*A[j]
print((sum%(10**9+7))) | N=int(eval(input()))
A=list(map(int,input().split()))
SUM=sum(A)
res=0
for i in range(N) :
SUM-=A[i]
res+=A[i]*SUM
print((res%(10**9+7))) | p02572 |
n = int(eval(input()))
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] * a[j]
print((ans % mod)) | n = int(eval(input()))
a = list(map(int, input().split()))
s = [0] * n
s[n - 1] = a[n - 1]
for i in range(n - 2, -1, -1):
s[i] = s[i + 1] + a[i]
ans = 0
mod = 10 ** 9 + 7
for i in range(n - 1):
ans += a[i] * s[i + 1]
print((ans % mod)) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split(' ')))
const = 1000000007
ans = 0
a = 0
for i in range(N):
for j in range(i + 1, N):
a += A[j]
ans += A[i] * a
a = 0
print((ans%const)) | N = int(eval(input()))
A = list(map(int, input().split(' ')))
const = 1000000007
ans = 0
total = sum(A)
for i in range(N):
total -= A[i]
ans += A[i] * total
print((ans%const)) | 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]
print((ans%mod)) | n = int(eval(input()))
a = list(map(int,input().split()))
ans = sum(a)**2
mod = 10**9 + 7
for i in range(n):
ans -= a[i]**2
ans //= 2
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]
ans = ans % (10 ** 9 + 7)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
sum_a = sum(a)
ans = 0
for i in range(n - 1):
sum_a -= a[i]
ans += a[i] * sum_a
ans = ans % (10 ** 9 + 7)
print(ans) | p02572 |
N = int(eval(input()))
num = list(map(int, input().split()))
tot = 0
num2 = [0]*(N-1)
for i in range(len(num)-1):
num2[i] = sum(num[1+i:]) % (10**9+7)
for i in range(len(num)-1):
num1 = num[i] % (10**9+7)
tot += num1 * num2[i]
if tot >= (10**9+7): tot = tot % (10**9+7)
print(tot) | N = int(eval(input()))
num = list(map(int, input().split()))
tot = 0
num2 = [0]*(N-1)
numtot = sum(num)
for i in range(len(num)-1):
numtot -= num[i]
num2[i] = numtot % (10**9+7)
num1 = num[i] % (10**9+7)
tot += num1 * num2[i]
if tot >= (10**9+7): tot = tot % (10**9+7)
print(tot) | p02572 |
def inp():
return eval(input())
def iinp():
return int(eval(input()))
def inps():
return input().split()
def miinps():
return list(map(int,input().split()))
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
n = iinp()
a = lmiinps()
ans = 0
for i in range(0,n-1):
for j in range(i+1,n):
k = ((a[i]%(10**9+7))*(a[j]%(10**9+7)))%(10**9+7)
ans += k
ans %= (10**9+7)
print(ans) | def inp():
return eval(input())
def iinp():
return int(eval(input()))
def inps():
return input().split()
def miinps():
return list(map(int,input().split()))
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
n = iinp()
a = lmiinps()
ans = 0
count = 0
for i in range(n):
count += (a[i]%(10**9+7))
for i in range(n):
count -= a[i]
ans += (a[i]%(10**9+7))*count
ans %= (10**9+7)
print(ans) | p02572 |
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
sum = 0
for i in range(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 = 10 ** 9 + 7
cs = A[:]
for i in range(1, N):
cs[i] += cs[i-1]
sum = 0
for i in range(0, N-1):
sum += A[i] * (cs[-1] - cs[i])
print((sum % mod)) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
s = 0
for i in range(n):
for j in range(i + 1, n):
s += a[i] * a[j]
s %= 1000000007
print((s % 1000000007))
| n = int(eval(input()))
a = list(map(int, input().split()))
s1 = sum(a)
s2 = 0
ans = 0
for i in range(n - 1):
s2 += a[i]
ans += a[i] * (s1 - s2)
print((ans % 1000000007))
| p02572 |
n = eval(input())
a = [int(num) for num in input().split(" ")]
mod_value = 10**9 + 7
total = 0
for i in range(len(a)-1):
target_value = 0
for j in range(i+1, len(a)):
target_value += a[j]
total += a[i] * target_value
print((total%mod_value))
| n = eval(input())
a = [int(num) for num in input().split(" ")]
mod_value = 10**9 + 7
sum = 0
total = 0
for i in reversed(list(range(1, len(a)))):
sum += a[i]
total += a[i-1] * sum
print((total%mod_value))
| p02572 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
ans = 0
for i in range(n):
for j in range(i+1, n):
ans += (a[i] * a[j]) % mod
ans %= mod
print(ans) | from itertools import accumulate
n = int(eval(input()))
a = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
a_acc = list(accumulate(a))
ans = 0
for i in range(n):
ans += (a[i] * (a_acc[-1] - a_acc[i])) % mod
ans %= mod
print(ans) | p02572 |
MOD = 10**9 + 7
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(len(A)):
for j in range(i + 1, len(A)):
count += (A[i] * A[j]) % MOD
count %= MOD
print(count) | MOD = 10**9 + 7
N = int(eval(input()))
modsum = 0
A = list(map(int, input().split()))
for a in A:
modsum = (modsum + a) % MOD
count = 0
for a in A[:-1]:
modsum -= a
while modsum < 0:
modsum = MOD + modsum
count = (count + (modsum * a) % MOD) % MOD
print(count) | p02572 |
import itertools
N=int(eval(input()))
A = tuple(map(int,input().split(" ")))
ans = 0
for pair in itertools.combinations(A, 2):
ans += pair[0] * pair[1]
print((ans % (10**9+7))) | N=int(eval(input()))
A = tuple(map(int,input().split(" ")))
ans = 0
sum_ = sum(A)
for i in range(N):
sum_ -= A[i]
ans += sum_ * A[i]
print((ans % ( (10**9)+7) )) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
m = 0
for i in range(n):
m += a[i]*(sum(a[i+1:])%(10**9+7))
m = m%(10**9+7)
print(m) | n = int(eval(input()))
a = list(map(int, input().split()))
b = sum([(i**2) for i in a])
print((((sum(a)**2-b)//2)%(10**9+7))) | p02572 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
n, *a = list(map(int, read().split()))
large_p = 10 ** 9 + 7
a2 = [i % large_p for i in a]
com = tuple(combinations(a2, 2))
r = 0
for come in com:
r += (come[0] * come[1]) % large_p
r = r % large_p
print(r)
if __name__ == '__main__':
main() | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import accumulate
def main():
n, *a = list(map(int, read().split()))
large_p = 10 ** 9 + 7
aac = tuple(accumulate(a))
r = 0
for i1 in range(n):
t1 = aac[-1] - aac[i1]
r += (t1 * a[i1]) % large_p
r = r % large_p
print(r)
if __name__ == '__main__':
main()
| p02572 |
from itertools import combinations
N = int(eval(input()))
A = list(map(int, input().split()))
ref = list(combinations(A, 2))
res = 0
for i in range(len(ref)):
a, b = ref[i]
res += ((a * b) % (10 ** 9 + 7))
print((res % (10 ** 9 + 7))) | N = int(eval(input()))
A = list(map(int, input().split()))
res = 0
for i in range(len(A)):
a = A[i]
nokori = A[i+1:]
for j in nokori:
res += (a * j) % (10 ** 9 + 7)
print((res % (10 ** 9 + 7))) | p02572 |
N = int(eval(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
ans = all - di
ans *= (mod + 1) // 2
ans %= mod
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
S = sum(A)
S2 = sum([x*x for x in A])
print(((S*S - S2)//2 % mod)) | p02572 |
mod = 10**9 + 7
n = int(eval(input()))
A = list([int(x) % mod for x in input().split()])
out = 0
for i in range(n - 1):
for j in range(n - i - 1):
k = i + j + 1
# print(A[i], A[k])
out += (A[i] * A[k])
out %= mod
print(out) | mod = 10**9 + 7
n = int(eval(input()))
A = list([int(x) % mod for x in input().split()])
# out = 0
# for i in range(n - 1):
# for j in range(n - i - 1):
# k = i + j + 1
# # print(A[i], A[k])
# out += (A[i] * A[k])
# out %= mod
B = A[1:n]
B_s = 0
for i in range(n - 1):
B_s += B[i] % mod
out = 0
for i in range(n - 1):
out += A[i] * B_s
out %= mod
B_s -= A[i + 1]
B_s %= mod
if B_s < 0:
B_s += mod
print(out)
| p02572 |
import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
return int(readline())
def reads():
return list(map(int, readline().split()))
n=read()
a=list(reads())
num=0
l=len(a)
for i in range(l-1):
for j in range(i+1,l):
num+=a[i]*a[j]
num%=10**9+7
print(num) | import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
return int(readline())
def reads():
return list(map(int, readline().split()))
n=read()
a=list(reads())
num=0
l=len(a)
ls=[]
k=0
for i in range(l-1,0,-1):
k+=a[i]
ls.append(k)
for i in range(l-1):
num+=a[i]*ls[-i-1]
num%=10**9+7
print(num) | p02572 |
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
s = list(accumulate(a))
MOD = 10 ** 9 + 7
ans = 0
for i in range(n):
ans += a[i] * (s[n - 1] - s[i])
ans %= MOD
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
s = sum(a) ** 2
t = sum(ai ** 2 for ai in a)
ans = (s - t) * pow(2, MOD - 2, MOD)
ans %= MOD
print(ans) | p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
m = 1000000007
s = 0
suma = sum(a)
for i in range(n):
suma -= a[i]
s += a[i] * suma
print((s % m)) | n = int(eval(input()))
a = list(map(int, input().split()))
m = 1000000007
print((((sum(a)**2 - sum([x**2 for x in a])) // 2) % m)) | p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
import itertools
seq=[x for x in range(0,n)]
l=list(itertools.combinations(seq,2))
ans=0
for ll in l:
ans += a[ll[1]] * a[ll[0]]
print((ans%(10**9+7))) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
x=0
for i in range(n):
ans += a[i] * x
x +=a[i]
print((ans%(10**9+7)))
| p02572 |
N = int(eval(input()))
A = list(map(int,input().split()))
result = 0
for i in range(N-1):
tmp = 0
for j in range(i+1, N):
tmp += A[j]
result += tmp * A[i]
print((result%1000000007)) | N = int(eval(input()))
A = list(map(int,input().split()))
sum = sum(A)
result = 0
for i in range(N):
sum -= A[i]
result += sum*A[i]
print((result%(10**9+7))) | p02572 |
# coding:UTF-8
import sys
def resultSur97(x):
return x % (10 ** 9 + 7)
if __name__ == '__main__':
# ------ 入力 ------#
# 1行入力
n = int(eval(input())) # 数字
aList = list(map(int, input().split())) # スペース区切り連続数字
# ------ 処理 ------#
pro = 0
for i in range(1,n+1):
sum = 0
for j in range(i+1,n+1):
sum += aList[j-1]
pro += sum * aList[i-1]
out = resultSur97(pro)
# ------ 出力 ------#
print(("{}".format(out)))
# if flg == 0:
# print("YES")
# else:
# print("NO")
| # coding:UTF-8
import sys
def resultSur97(x):
return x % (10 ** 9 + 7)
if __name__ == '__main__':
# ------ 入力 ------#
# 1行入力
n = int(eval(input())) # 数字
aList = list(map(int, input().split())) # スペース区切り連続数字
# ------ 処理 ------#
sum = 0
for i in range(0, n):
sum += aList[i]
pro = 0
for i in range(0, n):
ai = aList[i]
sum = sum - ai
pro += sum * aList[i]
out = resultSur97(pro)
# ------ 出力 ------#
print(("{}".format(out)))
# if flg == 0:
# print("YES")
# else:
# print("NO")
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
for j in range(i+1, len(a)):
ans = (a[i] * a[j]) % 1000000007 + ans % 1000000007
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(2,n+1):
a[-i] += a[-i+1]
for i in range(len(a)-1):
ans = ans % 1000000007 + ((a[i] - a[i+1]) * a[i+1]) % 1000000007
print((ans % 1000000007)) | p02572 |
n = int(eval(input()))
A = list(map(int, input().split()))
mod_n = 10**9+7
cum_A = [0]
for i in range(n-1):
cum_A.append(cum_A[i]+A[::-1][i])
ans = 0
for i in range(n-1):
ans += A[i]*cum_A[::-1][i]%mod_n
print((ans%mod_n)) | n = int(eval(input()))
A = list(map(int, input().split()))
B = A[::-1]
mod_n = 10**9+7
cum_A = [0]
for i in range(n-1):
cum_A.append(cum_A[i]+B[i])
ans = 0
cum_B = cum_A[::-1]
for i in range(n-1):
ans += A[i]*cum_B[i]%mod_n
print((ans%mod_n)) | p02572 |
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
c = 0
for pp in list(itertools.combinations(a,2)):
c += (pp[0] * pp[1]) % (10 **9 + 7)
print((c % (10 **9 + 7)))
| import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
c = 0
for i in range(0, len(a) -1):
for j in range(i + 1, len(a)):
c += (a[i] * a[j]) % 1000000007
print((c % 1000000007))
| p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
sum=0
tmp=0
for i in range(n):
o = i+1
tmp = 0
while (o<n):
tmp=a[o]+tmp
o=o+1
sum=(a[i]%1000000007*tmp%1000000007)%1000000007+sum%1000000007
print((sum%1000000007)) | n=int(eval(input()))
a=list(map(int,input().split()))
mod=1000000007
sum=0
tmp=0
o=0
while(o<n):
tmp = (a[o]%mod + tmp%mod)%mod
o += 1
for i in range(n):
tmp=(tmp%mod-a[i]%mod)%mod
sum=((a[i]%mod)*tmp)%mod+sum%mod
print((sum%mod))
| p02572 |
n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
for i in range(n-1):
for j in range(i+1, n):
sum += a[i]*a[j]
print((sum%(10**9+7))) | n = int(eval(input()))
a = list(map(int, input().split()))
# required function
def findProductSum(A, n):
# calculating array sum (a1 + a2 ... + an)
array_sum = 0
for i in range(0, n, 1):
array_sum = array_sum + A[i]
# calcualting square of array sum
# (a1 + a2 + ... + an)^2
array_sum_square = array_sum * array_sum
# calcualting a1^2 + a2^2 + ... + an^2
individual_square_sum = 0
for i in range(0, n, 1):
individual_square_sum += A[i] * A[i]
# required sum is (array_sum_square -
# individual_square_sum) / 2
return (array_sum_square -
individual_square_sum)
mod = 10**9+7
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
print((modinv(2)*int(findProductSum(a, n))%mod)) | p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
mo=10**9+7
an=0
wk=0
for i in range(n-1):
for j in range(i+1,n):
wk+=(a[j]%mo)
an+=(a[i]*(wk%mo))%mo
an%=mo
wk=0
print(an) | n=int(eval(input()))
a=list(map(int,input().split()))
mo=10**9+7
an=0
wk=0
ru=[]
for i in a:
wk+= i
ru.append(wk%mo)
for i in range(n-1):
an+=a[i]*(ru[n-1]-ru[i])
an%=mo
print(an) | p02572 |
n=int(eval(input()))
a=list(map(int,input().split()))
mod=1000000007
ans=0
for i in range (n-1):
s=0
for j in range(i+1,n):
s=(s+a[j])%mod
ans=(ans+(a[i]*(s))%mod)%mod
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
mod=1000000007
ans=0
s=0
for i in range (n-1):
if i ==0:
for j in range(i+1,n):
s=(s+a[j])%mod
else:
s-=a[i]
ans=(ans+(a[i]*(s))%mod)%mod
print(ans)
| p02572 |
N = int(eval(input()))
A = [int(x) for x in input().split(" ")]
from itertools import combinations
mod = 1000000007 # 丁度いい大きさの素数だけで意味は特にない。
s = 0
for c in combinations(A, 2):
s += c[0] * c[1]
print((s % mod)) | N = int(eval(input()))
A = [int(x) for x in input().split(" ")]
from itertools import combinations
mod = 1000000007 # 丁度いい大きさの素数だけで意味は特にない。
s = 0
ans = 0
for n in A:
s += n
s %= mod
for i in range(N):
s -= A[i]
ans += A[i] * s
ans %= mod
print(ans) | p02572 |
N=int(eval(input()))
A=list(map(int,input().split()))
#437235829 mod(10^9+7)
sumA=0
for i in range(N-1):
for j in range(1,N-i):
sumA+=A[i]*A[i+j]
print((sumA % (10**9+7)))
| N=int(eval(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]
sumtr=sumtr % (10**9+7)
sumAcol=sumAcol % (10**9+7)
for i in range(N):
sumA+=(sumAcol*A[i])%(10**9+7)
sumA=(sumA-sumtr)+10**9+7
print((sumA*(5*10**8+4) % (10**9+7)))
| p02572 |
N = int(eval(input()))
l = list(map(int,input().split()))
mod = 10**9 + 7
ans = 0
for i in range(N):
for j in range(i+1,N):
ans += (l[i] * l[j])
print((ans%mod)) | N = int(eval(input()))
l = list(map(int,input().split()))
mod = 10**9 + 7
area = sum(l) * sum(l)
for i in l:
area -= i*i
ans = area//2
ans = ans % mod
print(ans) | p02572 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
ans = 0
import itertools
for i in itertools.combinations(a_list, 2):
ans += i[0] * i[1]
print((ans % (10**9 + 7))) | n = int(eval(input()))
a_list = list(map(int, input().split()))
s_2 = 0
for i in a_list:
s_2 += i**2
ans = (sum(a_list)**2 - s_2)//2
ans = ans%(10**9+7)
print(ans) | p02572 |
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in itertools.combinations(a, 2):
ans += i[0]*i[1]
print((ans % 1000000007)) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
num=0
for i in range(n-1):
num+=a[i]
ans+=a[i+1]*num
print((ans%1000000007)) | p02572 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = 10**9+7
ans = 0
for i in range(n):
for j in range(i+1,n):
ans+=(a[i]%m)*(a[j]%m)
ans%=m
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
m = 10**9+7
x = 0
ans = 0
for i in range(n):
ans+=a[i]*x
x += a[i]%m
ans%=m
print(ans) | p02572 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.