input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#Big Array
N, K = list(map(int, input().split()))
a = [0]*N
b = [0]*N
R = []
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
for i in range(N):
for j in range(b[i]):
R.append(a[i])
R.sort()
print((R[K-1])) | #Big Array
N, K = list(map(int, input().split()))
a = [0]*(N)
b = [0]*(N)
R = [0]*(10**5+1)
ans = 0
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
for i in range(N):
R[a[i]] = R[a[i]] + b[i]
j = 0
while K > 0:
K = K - R[j]
ans = ans + 1
j = j + 1
print((ans-1)) | p03721 |
from collections import defaultdict
def main():
n, k = list(map(int, input().split()))
d = defaultdict(int)
for _ in range(n):
a, b = list(map(int, input().split()))
d[a] += b
A = sorted(list(d.items()), key = lambda x: x[0])
count = 0
for a in A:
count += a[1]
if count >= k:
print((a[0]))
exit()
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
n, k = list(map(int, input().split()))
D = defaultdict(int)
for _ in range(n):
a, b = list(map(int, input().split()))
D[a] += b
for d in sorted(list(D.items()), key = lambda x: x[0]):
k -= d[1]
if k <= 0:
print((d[0]))
break
if __name__ == '__main__':
main()
| p03721 |
N, K = list(map(int, input().split()))
a = [0] * N
b = [0] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
a, b = list(zip(*sorted(zip(a, b))))
count = 0
while K > 0:
K -= b[count]
count += 1
print((a[count - 1])) | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
a = [0] * N
b = [0] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
a, b = list(zip(*sorted(zip(a, b))))
count = 0
while K > 0:
K -= b[count]
count += 1
print((a[count - 1])) | p03721 |
import bisect
n,k= (int(i) for i in input().split())
array = []
for i in range(n):
a,b= (int(i) for i in input().split())
for j in range(b):
bisect.insort(array, a, lo=0, hi=len(array))
print((array[k-1])) | import bisect
n,k= (int(i) for i in input().split())
array = []
for i in range(n):
a,b= (int(j) for j in input().split())
array.append((a,b))
array = sorted(array)
cnt = 0
for ab in array:
a,b = ab
cnt += b
if cnt >= k:
print(a)
break | p03721 |
N,K=list(map(int,input().split()))
c=[]
for i in range(N):
a,b=list(map(int,input().split()))
c+=[a]*b
c.sort()
print(c[K-1]) | N,K=list(map(int,input().split()))
c=[0]*N
for i in range(N):
a,b=list(map(int,input().split()))
c[i]=(a,b)
c.sort()
i,j=0,0
while i<=K-1:
i+=c[j][1]
if i>=K:break
j+=1
print(c[j][0]) | p03721 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *AB = list(map(int, read().split()))
c = Counter()
for a, b in zip(*[iter(AB)] * 2):
c[a] += b
num = 0
for k, n in sorted(c.items()):
num += n
if num >= K:
ans = k
break
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *AB = list(map(int, read().split()))
vec = [0] * (10 ** 5 + 1)
for a, b in zip(*[iter(AB)] * 2):
vec[a] += b
total = 0
for i, n in enumerate(vec):
total += n
if total >= K:
ans = i
break
print(ans)
return
if __name__ == '__main__':
main()
| p03721 |
# ABC061 C - Big Array
from operator import itemgetter
N,K = list(map(int,input().split()))
A = []
B = []
AB = [[] for _ in range(N)]
for i in range(N):
a,b = list(map(int,input().split()))
AB[i].append(a)
AB[i].append(b)
AB.sort(key=itemgetter(0, 1))
ans = 0
if len(AB) == 1:
ans = AB[0][0]
print(ans)
exit()
for i in range(N):
if i == 0:
AB[0].append(AB[0][1])
continue
AB[i].append(AB[i-1][2]+AB[i][1])
for i in range(N):
if i == 0:
f = 0
t = AB[0][2]
if f < K <= t:
ans = AB[0][0]
break
continue
f = AB[i-1][2]
t = AB[i][2]
if f < K <= t:
ans = AB[i][0]
break
print(ans) | n,k=list(map(int,input().split()))
ab=[]
for i in range(n):
aa,bb=list(map(int,input().split()))
ab.append([aa,bb])
ab.sort(key=lambda x: x[0])
a,b=[],[]
for aa,bb in ab:
a.append(aa)
b.append(bb)
from itertools import accumulate
c=list(accumulate(b))
idx=-1
for i in range(n):
if i==0:
if 0<=k<=c[i]:
idx=i
break
continue
if c[i-1]<k<=c[i]:
idx=i
break
print((a[idx])) | p03721 |
n, k = list(map(int,input().split(" ")))
l = []
for i in range(n):
a, b = list(map(int, input().split(" ")))
l.extend([a] * b)
l.sort()
print((l[k - 1]))
| n, k = list(map(int,input().split(" ")))
num_count = dict()
for i in range(n):
a, b = list(map(int, input().split(" ")))
if a not in num_count:
num_count[a] = 0
num_count[a] += b
temp = 0
for key in sorted(num_count.keys()):
temp += num_count[key]
if temp >= k:
print(key)
break
| p03721 |
N,K = list(map(int, input().split()))
li=[]
for i in range(N):
a,b = list(map(int, input().split()))
for j in range(b):
li.append(a)
li.sort()
print((li[K-1])) | N,K=list(map(int,input().split()))
AB=[[0,0]for _ in range(N)]
for i in range(N):
AB[i]=list(map(int,input().split()))
AB.sort()
ans=0
i=0
while K>0 and i<N:
K-=AB[i][1]
ans=AB[i][0]
i+=1
print(ans)
| p03721 |
n, k = list(map(int, input().split()))
A = sorted([[int(i) for i in input().split()] for i in range(n)])
cnt = 0
for i in range(n):
cnt += A[i][1]
if cnt >= k:
print((A[i][0]))
break | N, K = list(map(int, input().split()))
A = sorted([[int(i) for i in input().split()] for i in range(N)])
cnt = 0
for i in range(N):
cnt += A[i][1]
if cnt >= K:
print((A[i][0]))
break | p03721 |
N, K = list(map(int,input().split()))
array = []
for i in range(N):
a,b = list(map(int,input().split()))
array += [a] * b
array.sort()
ans = array[K-1]
print(ans) | N, K = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(N)]
info.sort()
count = 0
for e in info:
count += e[1]
if count >= K:
ans = e[0]
break
print(ans) | p03721 |
def rren(): return list(map(int, input().split()))
a = set()
b = dict()
N, K = rren()
for i in range(N):
a_t, b_t = rren()
if(a_t not in a):
a.add(a_t)
b[a_t] = b_t
else:
b[a_t] += b_t
count = K
for i in range(K-1):
mn = min(a)
nu = b[mn]
a.discard(mn)
count -= nu
if(count <= 0):
print(mn)
break
| def rren(): return list(map(int, input().split()))
a = set()
b = dict()
N, K = rren()
for i in range(N):
a_t, b_t = rren()
if(a_t not in a):
a.add(a_t)
b[a_t] = b_t
else:
b[a_t] += b_t
li_a = list(a)
li_a.sort()
count = K
for i in range(K):
count -= b[li_a[i]]
if(count <= 0):
print((li_a[i]))
break
| p03721 |
# -*- coding: utf-8 -*-
def flatten(nested_list):
return [e for inner_list in nested_list for e in inner_list]
N, K = list(map(int, input().split()))
a = [0] * N
b = [0] * N
ab = [[0, 0]] * N
for i in range(N):
_a, _b = list(map(int, input().split()))
ab[i] = [_a, _b]
ab.sort(key=lambda x:x[0])
ans = flatten([[a] * b for a, b in ab])
print(ans[K - 1])
| # -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
ab = [[0, 0]] * N
for i in range(N):
_a, _b = list(map(int, input().split()))
ab[i] = [_a, _b]
ab.sort(key=lambda x:x[0])
j = 0
index = 0
while j < K:
j += ab[index][1]
if j < K:
index += 1
print(ab[index][0])
| p03721 |
# a 200
from collections import Counter
from math import factorial
N = int(eval(input()))
a = list(map(int, input().split()))
#累計和
wa = [0]
for ai in a:
wa.append(wa[-1]+ai)
wa = wa[1:]
def combination(n, r):
return factorial(n)//(factorial(r)*factorial(n-r))
c = Counter(wa)
ans = 0
for k,v in list(c.items()):
if v<2: continue
ans += combination(v, 2)
ans += c[0]
print(ans) | N = int(eval(input()))
a = list(map(int , input().split()))
s = [0]
d = {0:1}
for i in range(N):
nex = s[-1]+a[i]
s.append(nex)
if nex not in d:
d[nex] = 0
d[nex] += 1
ans = 0
for v in list(d.values()):
if v >= 2:
ans += int(v*(v-1)/2)
print(ans)
| p03363 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]
for i, num in enumerate(a):
b.append(b[i] + a[i])
count = []
for num in list(set(b)):
count.append(b.count(num))
ans = int(sum([(i*(i-1))/2 for i in count]))
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]
for i, num in enumerate(a):
b.append(b[i] + a[i])
count = {}
for num in b:
if num in count:
count[num] += 1
else:
count[num] = 1
ans = int(sum([(i*(i-1))/2 for i in list(count.values())]))
print(ans) | p03363 |
import collections
def main(N,A):
B=[0]
count = 0
for i in range(N):
T = A[i] + B[i]
B.append(T)
c = collections.Counter(B)
for i in range(len(c)):
k, v = c.popitem()
for z in range(v):
count += z
return print(count)
if __name__ == "__main__":
N=int(input())
A=list(map(int,input().split()))
main(N,A)
| def main(N,A):
B=[0]
count = 0
for i in range(N):
T = A[i] + B[i]
#print('count:',count)
#
# B = [A[i] +B[i] for i in range(N)]
#
# count = [ count + 1 for m in range(len(B)) if B[i] - B[i-m] == 0]
# for m in range(len(B)):
# if T - B[m] == 0:
# # print(i, m)
# # print(B[i],B[i-m])
# # print(T)
# # print("kore",B[i],B[i-m])
# count += 1
B.append(T)
B = sorted(B)
# print(B)
c = 0
for i in range(len(B)):
if i==0:
continue
if B[i] == B[i-1]:
c+=1
count +=c
# print(c)
#
# print(count)
else:
c = 0
#
# c = collections.Counter(B)
# for i in range(len(c)):
# k, v = c.popitem()
# for z in range(v):
# count += z
#print(count)
#print(B)
return print(count)
if __name__ == "__main__":
N=int(input())
A=list(map(int,input().split()))
main(N,A)
| p03363 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
memo = collections.defaultdict(int)
memo[0] += 1
total = 0
cnt = 0
for i in range(n):
total += a[i]
cnt += memo[total]
memo[total] += 1
print(cnt)
| n = int(eval(input()))
a = list(map(int, input().split()))
cs = [0]*(n+1)
cs[0] = a[0]
for i in range(1, n+1):
cs[i] += cs[i-1] + a[i-1]
cs.sort()
total = 0
focus = None
count = 0
for s in cs:
if s == focus:
count += 1
else:
total += count * (count-1)//2
focus = s
count = 1
total += count * (count-1)//2
print(total)
| p03363 |
N = int(eval(input()))
A_list = list(map(int, input().split(' ')))
A_len = len(A_list)
result = 0
for i in range(A_len):
tmp = 0
for j in range(i, A_len):
tmp += A_list[j]
if tmp == 0:
result += 1
print(result) | import math
def calc_combination(n):
combination = math.factorial(n) / (math.factorial(2) * math.factorial(n - 2))
return combination
N = int(eval(input()))
list_A = list(map(int, input().split(' ')))
tmp_sum = 0
sum_map = {}
for A in list_A:
tmp_sum += A
sum_map[tmp_sum] = sum_map.get(tmp_sum, 0) + 1
result = sum_map.get(0, 0)
for value in list(sum_map.values()):
if value >= 2:
result += calc_combination(value)
print((int(result))) | p03363 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
s = [0 for _ in range(N)]
for i in range(N):
if i == 0:
s[i] = A[i]
else:
s[i] = s[i-1] + A[i]
count += s.count(0)
for i in range(N-1):
del s[0]
for j in range(len(s)):
s[j] -= A[i]
count += s.count(0)
return count
if __name__ == '__main__':
print((main()))
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
s = [0 for _ in range(N+1)]
for i in range(N):
s[i+1] = s[i] + A[i]
s.sort()
n = 1
for i in range(N):
if s[i+1] == s[i]:
n+=1
else:
count += n*(n-1)//2
n = 1
count += n*(n-1)//2
return count
if __name__ == '__main__':
print((main()))
| p03363 |
N = int(eval(input()))
a = [int(i) for i in input().split()]
b =[0]
i = 1
num = 0
while i < N+1:
b.append(sum(a[0:i]))
i = i+1
b.sort()
j = 0
num = 0
v = 0
while j < N:
if b[j+1] == b[j]:
v = v+1
else:
num = num + (v*(v+1))//2
v = 0
j = j +1
num = num + (v*(v+1))//2
print(num) | N = int(eval(input()))
a = [int(i) for i in input().split()]
b =[0]*(N+1)
for i in range(N):
b[i+1]= b[i] + a[i]
b.sort()
j = 0
num = 0
v = 0
while j < N:
if b[j+1] == b[j]:
v = v+1
else:
num = num + (v*(v+1))//2
v = 0
j = j +1
num = num + (v*(v+1))//2
print(num) | p03363 |
N = int(eval(input()))
A = list(map(int, input().split()))
sums = [[None for j in range(N-i)] for i in range(N)]
for i in range(N):
for j in range(N-i):
if j == 0:
sums[i][j] = A[i]
else:
sums[i][j] = sums[i][j-1] + A[j+i]
count = 0
for line in sums:
count += line.count(0)
print(count) | N = int(eval(input()))
A = list(map(int,input().split()))
sums_dic = {}
a = sum(A)
sums_dic[a] = 1
for n in range(1,N):
a -= A[n-1]
sums_dic[a] = sums_dic.setdefault(a, 0) + 1
count = 0
for key, value in list(sums_dic.items()):
if key == 0:
count += value
if value >= 2:
count += value * (value - 1) // 2
print(count) | p03363 |
import sys
input=sys.stdin.readline
from math import factorial
def combinations_count(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
B = {}
for i in range(len(A)):
x = sum(A[0:i+1])
if x not in B:
B[x] = 1
else:
B[x] += 1
ans = 0
for i in list(B.values()):
if i >= 2:
ans += combinations_count(i,2)
print(ans)
| import sys
input=sys.stdin.readline
from math import factorial
def combinations_count(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
B = {}
x = 0
for i in A:
x += i
if x not in B:
B[x] = 1
else:
B[x] += 1
ans = 0
for i in list(B.values()):
if i >= 2:
ans += combinations_count(i,2)
print(ans)
| p03363 |
n = int(eval(input()))
a = list(map(int,input().split()))
list_S = [0]
ans = 0
for i in range(n):
list_S.append(list_S[i] + a[i])
list_S.sort() # 昇順に並び替え 計算量はO(NlogN)
pre = list_S[0] # 前の数字
acc = 1 # 今まで何個同じ数字が連続したか
for i in range(1,n+1): # i番目の数字を見る．ちなみに0番目の数字は上2行でもう見た
if list_S[i] == pre: # 今見ている数字が前の数字と同じなら，accに1加算
acc += 1
else: # 違うなら，ansに(acc個の中から2個選ぶ場合の数)を加算
ans += acc * (acc-1) // 2
pre = list_S[i]
acc = 1 # accを初期化
ans += acc * (acc-1) // 2 # 一番最後に連続している数字群を足せていないので，ここで補正
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
list_S = [0]
ans = 0
for i in range(n):
list_S.append(list_S[i] + a[i])
dict_S = {}
for i in list_S:
if i in dict_S:
dict_S[i] += 1
else:
dict_S[i] = 1
for v in list(dict_S.values()):
ans += v * (v-1) // 2
print(ans) | p03363 |
# AGC023A - Zero-Sum Ranges
from collections import Counter
from itertools import accumulate
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
C = list(Counter(list(accumulate(A)) + [0]).values())
ans = sum(i * (i - 1) // 2 for i in C)
print(ans)
if __name__ == "__main__":
main() | # AGC023A - Zero-Sum Ranges
from collections import Counter
from itertools import accumulate
def main():
n = int(eval(input()))
A = [0] + list(map(int, input().split()))
C = list(Counter(accumulate(A)).values())
ans = sum(i * (i - 1) // 2 for i in C if i >= 2)
print(ans)
if __name__ == "__main__":
main() | p03363 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
S = [0] * (N+1)
for i in range(1, N+1):
S[i] = S[i-1] + A[i-1]
d = defaultdict(int)
for i in range(len(S)):
d[S[i]] += 1
ans = 0
for key, val in list(d.items()):
ans += val * (val-1) // 2
print(ans) | from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
d = defaultdict(int)
S = [0]*(N+1)
S[0], d[0] = 0, 1
for i in range(1, N+1):
S[i] = S[i-1] + A[i-1]
d[S[i]] += 1
ans = 0
for val in list(d.values()):
ans += val * (val - 1) // 2
print(ans) | p03363 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
b = []
for i in range(n):
for j in range(i+1,n+1):
b = a[i:j]
# print(b)
if sum(b) == 0:
ans += 1
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]
for i in range(n):
b.append(b[-1]+a[i])
#print(b)
ans = 0
b.sort()
for i in range(n+1):
if i == 0:
x=b[0]
m=1
else:
if x==b[i]:
m+=1
if i==n:
ans += m*(m-1)//2
else:
if m!=1:
ans += m*(m-1)//2
m=1
x=b[i]
print(ans) | p03363 |
import bisect
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0]
X = [0]
ans = 0
for i in range(N):
X.append(X[i]+A[i])
insert_index = bisect.bisect_left(B,X[i+1])
ans += bisect.bisect_right(B,X[i+1])-insert_index
B.insert(insert_index,X[i+1])
print(ans) | N = int(eval(input()))
A = [int(i) for i in input().split()]
B = {}
B[0] = 1
s = 0
ans = 0
for a in A:
s += a
ans += B.get(s,0)
B[s] = B.get(s,0)+1
print(ans) | p03363 |
n = int(eval(input()))
As = input().split()
As = [int(A) for A in As]
ss = [0]
sss = 0
for i in range(n):
sss += As[i]
ss.append(sss)
ans = 0
for i in range(0, n):
for j in range(i + 1, n + 1):
if ss[j] - ss[i] == 0:
ans += 1
print(ans) | n = int(eval(input()))
As = input().split()
As = [int(A) for A in As]
ss = [0]
sss = 0
nd = {0: 1}
for i in range(n):
sss += As[i]
ss.append(sss)
if sss in nd:
nd[sss] += 1
else:
nd[sss] = 1
ans = 0
for k in nd:
if nd[k] > 0:
ans += (nd[k] * (nd[k] - 1) // 2)
#for i in range(0, n):
# for j in range(i + 1, n + 1):
# if ss[j] - ss[i] == 0:
# ans += 1
print(ans) | p03363 |
import sys
from collections import defaultdict as dd
from bisect import bisect_left as bl
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
cs = [0] * (N + 1)
d = dd(list)
res = 0
for i in range(N):
cs[i + 1] = cs[i] + A[i]
for i in range(1, N + 1):
d[cs[i]].append(i)
for i in range(N):
x = bl(d[cs[i]], i + 1)
res += max(len(d[cs[i]]) - x, 0)
#print(res, i)
#print(d)
#print(cs)
print(res) | import sys
from collections import defaultdict as dd
from bisect import bisect_right as br
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
cs = [0] * (N + 1)
res = 0
for i in range(N): cs[i + 1] = cs[i] + a[i]
d = dd(list)
for i in range(N + 1): d[cs[i]].append(i)
for i in range(N):
s = cs[i]
j = br(d[s], i)
res += len(d[s]) - j
print(res) | p03363 |
n=int(eval(input()))
a=list(map(int,input().split()))
import math
s=[0]*(n+1)#累積和法
a.insert(0,0)
for i in range(1,n+1):
s[i]=s[i-1]+a[i]
from collections import Counter
data=Counter(s)
def combination_cout(n,r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))#組み合わせ計算
ans=[]
for i in list(data.values()):
if 2<=i:#同じ文字が2個以上ある時の文字数
ans.append(i)
total=0
for i in ans:
total+=combination_cout(i,2)
print(total)
| n=int(eval(input()))
a=list(map(int,input().split()))
from collections import Counter
a.insert(0,0)
s=[0]*(n+1)
for i in range(1,n+1):
s[i]=s[i-1]+a[i]
data=Counter(s)
cnt=[]
for i in list(data.values()):
if 2<=i:
cnt.append(i)
def combination_cnt(n):
return n*(n-1)//2
ans=0
for i in range(len(cnt)):
ans+=combination_cnt(cnt[i])
print(ans)
| p03363 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
ca = [A[0]] + [0]*(N-1)
for i in range(1,N):
ca[i] = ca[i-1] + A[i]
count = 1
number = 0
number += ca.count(0)
sca = sorted(ca) + ['hoge']
for i in range(1,N+1):
if sca[i] == sca[i-1]:
count += 1
else:
number += count*(count - 1)/2
count = 1
print((int(number))) | N = int(eval(input()))
A = [int(i) for i in input().split()]
dic = {}
S = 0
dic[0] = 1
for i in range(N):
S += A[i]
if S in dic:
dic[S] += 1
else:
dic[S] = 1
number = 0
for i in dic:
N = dic[i]
number += N * (N - 1) / 2
print((int(number)))
| p03363 |
N = int(eval(input()))
A_li = list(map(int, input().split()))
s_li = [0]
for i in range(N) :
s_li.append(s_li[i] + A_li[i])
s_num = set(s_li)
ans = 0
for sn in s_num :
cnt = s_li.count(sn)
ans += cnt * (cnt - 1) // 2
print(ans) | N = int(eval(input()))
A_li = list(map(int, input().split()))
s_li = [0]
for i in range(N) :
s_li.append(s_li[i] + A_li[i])
s_dic = {}
for s in s_li :
if s in s_dic :
s_dic[s] += 1
else :
s_dic[s] = 1
ans = 0
for sd in list(s_dic.values()) :
ans += sd * (sd - 1) // 2
print(ans) | p03363 |
n=int(eval(input()))
arr=list(map(int,input().split()))
acum=[0]*(n+1)
acum[1]=arr[0]
cnt=0
for i in range(2,n+1):
acum[i]=acum[i-1]+arr[i-1]
for i in range(n):
for j in range(1,n-i+1):
if acum[i+j]-acum[i]==0:
cnt+=1
print(cnt) | n=int(eval(input()))
arr=list(map(int,input().split()))
acum=[0]*(n+1)
cnt=0
for i in range(1,n+1):
acum[i]=acum[i-1]+arr[i-1]
acum=sorted(acum)
acum.append(10**10)
tmp=1
for i in range(1,len(acum)):
if acum[i]==acum[i-1]:
tmp+=1
else:
cnt+=tmp*(tmp-1)//2
tmp=1
print(cnt) | p03363 |
N = int(eval(input()))
a = list(map(int,input().split()))
s = [0]*(len(a)+1)
for i in range(len(a)):
s[i+1] = s[i] + a[i]
s.sort()
n = 0
for x in set(s):
l = s.count(x)
n += l*(l-1)/2
print((int(n))) | N = int(eval(input()))
a = list(map(int,input().split()))
s = [0]*(len(a)+1)
for i in range(len(a)):
s[i+1] = s[i] + a[i]
b = {}
for x in s:
if str(x) not in b:
b[str(x)] = 1
else:
b[str(x)] += 1
n = 0
for x in b:
n += b[x]*(b[x]-1)/2
print((int(n))) | p03363 |
n = int(eval(input()))
s = list(map(int, input().split()))
count = 0
cl = []
sm = 0
for i in range(n):
sm+=s[i]
cl.append(sm)
m = set(cl)
st = set(cl)
for x in st:
t = cl.count(x)
count+=int(t*(t-1)/2)
count+=cl.count(0)
print(count) | n = int(eval(input()))
s = list(map(int, input().split()))
count = 0
dic = {}
cl = []
sm = 0
for i in range(n):
sm+=s[i]
if sm not in list(dic.keys()):
dic.update({sm:1})
else:
dic[sm]+=1
for x in list(dic.keys()):
t = dic[x]
if x==0:
count+=dic[x]
count+=int(t*(t-1)/2)
print(count) | p03363 |
from collections import defaultdict
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0] -q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
# aの逆元を求める
def mod_inv(a,m):
x = extgcd(a,m)[0]
return (m+x%m)%m
def combination(m,k):
res = 1
for i in range(1,m+1):
res = res*i%(10**9+7)
for i in range(1,k+1):
res = res*mod_inv(i,10**9+7)
for i in range(1,m-k+1):
res = res*mod_inv(i,10**9+7)
return res%(10**9+7)
def main():
n = int(eval(input()))
ls = [int(x) for x in input().split()]
cumsum = [0]*(n+1)
for i in range(1,n+1):
cumsum[i] = cumsum[i-1]+ls[i-1]
cnt = defaultdict(int)
for i in cumsum:
cnt[i] +=1
ans = 0
for i in list(cnt.values()):
if i==1:
continue
ans += combination(i,2)
print(ans)
if __name__ == '__main__':
main() | from collections import defaultdict
def main():
n = int(eval(input()))
ls = [int(x) for x in input().split()]
cumsum = [0]*(n+1)
for i in range(1,n+1):
cumsum[i] = cumsum[i-1]+ls[i-1]
cnt = defaultdict(int)
for i in cumsum:
cnt[i] +=1
ans = 0
for i in list(cnt.values()):
if i==1:
continue
ans += int(i*(i-1)/2)
print(ans)
if __name__ == '__main__':
main() | p03363 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [0]
for i in range(n):
x = 0
x += b[i] + a[i]
b.append(x)
b.sort()
check = 1000000000000
ans = 0
for i in range(n+1):
if b[i] != check:
y = b.count(b[i])
ans += y * (y - 1) //2
check = b[i]
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
b = [0]
for i in range(n):
x = 0
x += b[i] + a[i]
b.append(x)
b.sort()
check = b[0]
count = 1
ans = 0
for i in range(1,n+1):
if b[i] == check:
count += 1
else:
ans += count * (count - 1) // 2
check = b[i]
count = 1
ans += count * (count - 1) // 2
print(ans)
| p03363 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = [0]
sum = 0
for i in range(len(a)):
sum += a[i]
s.append(sum)
ans = 0
for s_ in set(s):
k = s.count(s_)
ans += k*(k-1)//2
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
s = [0]
sum = 0
for i in range(len(a)):
sum += a[i]
s += [sum]
s.sort()
ans = 0
k = 1
for i in range(1,len(s)):
if s[i]==s[i-1]:
k+=1
if i==len(s)-1:
ans += k*(k-1)//2
else:
if k>1:
ans += k*(k-1)//2
k = 1
print(ans)
| p03363 |
from itertools import accumulate
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(accumulate(a))
b = [0]+b
c = Counter(b)
ans = 0
for x in c:
ans += c[x]*(c[x]-1)//2
print(ans) | from itertools import accumulate
from collections import Counter
n = eval(input())
c = Counter(accumulate(list(map(int, input().split()))))
c[0]+=1
ans = 0
for x in c:
ans += c[x]*(c[x]-1)//2
print(ans) | p03363 |
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
now = 0
for j in A[i:]:
now += j
if now == 0:
cnt += 1
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
DP = [0] * (N + 1)
for i in range(N):
DP[i + 1] = DP [i] + A[i]
dic = {}
for i in DP:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
for i in list(dic.values()):
cnt += (i * (i - 1)) // 2
print(cnt) | p03363 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
l_sum = []
s= 0
for i in range(n):
s += a[i]
l_sum.append(s)
ans = 0
for i in range(n):
if l_sum[i] == 0:
ans += 1
for j in range(i+1, n):
if l_sum[i] == l_sum[j]:
ans += 1
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
l_sum = [0]
s= 0
for i in range(n):
s += a[i]
l_sum.append(s)
c_sum = Counter(l_sum)
# print(c_sum)
ans = 0
for i in c_sum:
if c_sum[i] > 1:
ans += c_sum[i] * (c_sum[i] - 1) // 2
print(ans) | p03363 |
from collections import defaultdict
N = int(eval(input()))
A = [int(i) for i in input().split()]
d = defaultdict(int)
d[0] = 1
sum = 0
for i in range(N):
sum += A[i]
d[sum] += 1
ans = 0
for v in list(d.values()):
if v >= 2:
ans += (v*(v-1))//2
print(ans)
| import collections
N = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0]
for a in A:
S.append(S[-1]+a)
C = collections.Counter(S)
ans = 0
for v in list(C.values()):
if v >= 2:
ans += v*(v-1)//2
print(ans)
| p03363 |
n=int(eval(input()))
a=list(map(int,input().split()))
a=[0]+a
for i in range(1,n+1):
a[i]+=a[i-1]
#print(a)
dic={}
for i in a:
if i in dic:
dic[i]+=1
else:
dic[i]=1
ans=0
for i in list(dic.values()):
#print(i)
ans+=i*(i-1)//2
print(ans) | import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]+[i for i in itertools.accumulate(a)]
dic={}
for i in b:
if i in dic:
dic[i]+=1
else:
dic[i]=1
ans=0
for i in list(dic.values()):
ans+=i*(i-1)//2
print(ans) | p03363 |
import itertools
def aCb(a,b):return len(list(itertools.combinations([0]*a,b)))#組み合わせ
n,a=int(eval(input())),list(map(int,input().split()));b=[0]#入力
b+=list(itertools.accumulate(a))#累積和
b.sort();c=1;ans=0
for i in range(n):#2個以上存在する要素があるとき、cC2を加える
if b[i]==b[i+1]:c+=1
else:
if c>=2:ans+=aCb(c,2)
c=1
if c>=2:ans+=aCb(c,2)#アレ対策
print(ans) | n,a=int(eval(input())),list(map(int,input().split()));b=[0]
for i in range(n):b.append(b[i]+a[i])
b.sort();c=1;ans=0
for i in range(n):
if b[i]==b[i+1]:c+=1
else:
if c>=2:ans+=(c*(c-1))//2
c=1
if c>=2:ans+=(c*(c-1))//2
print(ans) | p03363 |
from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
a_ = [0]
for i in range(n):
a_.append(a_[i] + a[i])
cnt = 0
def sum(i):
return int((i + 1) / 2 * i)
for i in list(Counter(a_).values()):
cnt += sum(i-1)
print(cnt) | from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
a_ = [0]
for i in range(n):
a_.append(a_[i] + a[i])
cnt = 0
def sum(i):
return i * (i-1) // 2
for i in list(Counter(a_).values()):
cnt += sum(i)
print(cnt) | p03363 |
def get_input():
N = int(eval(input()))
numbers = [int(i) for i in input().split()]
return N, numbers
def DPsolve(N, numbers):
count = 0
dp = [[1 for i in range(len(numbers))] for j in range(len(numbers))]
for i in range(N):
for j in range(N-i):
if j == 0:
dp[i][j] = numbers[i]
else:
dp[i][j] = dp[i][j-1] + numbers[i+j]
if dp[i][j] == 0:
count += 1
return dp, count
if __name__ == '__main__':
N, numbers = get_input()
dp, count = DPsolve(N, numbers)
print(count) | def get_input():
N = int(eval(input()))
numbers = [int(i) for i in input().split()]
return N, numbers
def DPsolve(N, numbers):
count = 0
dp = [[1 for i in range(len(numbers))] for j in range(len(numbers))]
for i in range(N):
for j in range(N-i):
if j == 0:
dp[i][j] = numbers[i]
else:
dp[i][j] = dp[i][j-1] + numbers[i+j]
if dp[i][j] == 0:
count += 1
return dp, count
if __name__ == '__main__':
N, numbers = get_input()
s = [0]
for i in range(N):
s.append(s[-1] + numbers[i])
s.sort()
count = 1
result = 0
for i in range(N):
if(s[i] == s[i+1]):
count += 1
else:
result += count * (count -1 ) // 2
count = 1
result += count * (count -1 ) // 2
print(result) | p03363 |
n = int(eval(input()))
A = list(map(int,input().split()))
from collections import Counter
from itertools import accumulate
D = Counter(list(accumulate(A)))
res = D[0]
#print(D)
for v in list(D.values()):
res += v*(v-1)//2
print(res) | from collections import Counter
from itertools import accumulate
n = eval(input())
D = Counter(accumulate(list(map(int,input().split()))))
res = D[0]
for v in list(D.values()):
res += v*(v-1)//2
print(res) | p03363 |
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
cum = [0]
for a in A:
cum.append(cum[-1] + a)
count = Counter(cum)
ans = 0
for v in list(count.values()):
ans += v * (v - 1) // 2
print(ans) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
cum = [0]
for a in A:
cum.append(cum[-1] + a)
count = Counter(cum)
ans = 0
for v in list(count.values()):
ans += v * (v - 1) // 2
print(ans)
| p03363 |
from collections import defaultdict
import math
def combnations(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(eval(input()))
a = list(map(int, input().split()))
rui = [0] * (N + 1)
for i in range(N):
rui[i + 1] = rui[i] + a[i]
d = defaultdict(int)
for key in rui:
d[key] += 1
sortd = sorted(list(d.items()), key=lambda x: x[1], reverse=True)
cnt = 0
for i, j in sortd:
if j >= 2:
cnt += combnations(j, 2)
else:
break
print(cnt) | from collections import defaultdict
N = int(eval(input()))
a = list(map(int, input().split()))
rui = [0] * (N + 1)
for i in range(N):
rui[i + 1] = rui[i] + a[i]
d = defaultdict(int)
for key in rui:
d[key] += 1
sortd = sorted(list(d.items()), key=lambda x: x[1], reverse=True)
cnt = 0
for i, j in sortd:
if j >= 2:
cnt += (j * (j - 1) // 2)
print(cnt) | p03363 |
import sys
sys.setrecursionlimit(100000)
nCr = {}
def cmb(n, r):
if n == 1: return 0
if r == 0 or r == n: return 1
if r == 1: return n
if (n,r) in nCr: return nCr[(n,r)]
nCr[(n,r)] = cmb(n-1,r) + cmb(n-1,r-1)
return nCr[(n,r)]
N=int(eval(input()))
a=list(map(int,input().split()))
L=[0]
s=0
for i in range(N):
s+=a[i]
L.append(s)
L=sorted(L)
s=0
t=L[0]
c=1
for i in range(1,len(L)):
if(t==L[i]):
c+=1
else:
s+=cmb(c,2)
t=L[i]
c=1
else:
s+=cmb(c,2)
print(s)
| import sys
sys.setrecursionlimit(10000000)
nCr = {}
def cmb(n, r):
if n == 1: return 0
if r == 0 or r == n: return 1
if r == 1: return n
if (n,r) in nCr: return nCr[(n,r)]
nCr[(n,r)] = cmb(n-1,r) + cmb(n-1,r-1)
return nCr[(n,r)]
N=int(eval(input()))
a=list(map(int,input().split()))
L=[0]
s=0
for i in range(N):
s+=a[i]
L.append(s)
L=sorted(L)
s=0
t=L[0]
c=1
for i in range(1,len(L)):
if(t==L[i]):
c+=1
else:
s+=cmb(c,2)
t=L[i]
c=1
else:
s+=cmb(c,2)
print(s)
| p03363 |
n = int(eval(input()))
a = list(map(int, input().split()))
c = [0] * (n + 1)
for i in range(n):
c[i + 1] = c[i] + a[i]
result = 0
for i in range(1, n + 1):
for j in range(i):
if c[i] - c[j] == 0:
result += 1
print(result)
| n = int(eval(input()))
a = list(map(int, input().split()))
c = [0] * (n + 1)
for i in range(n):
c[i + 1] = c[i] + a[i]
d = {}
for i in range(1, n + 1):
if c[i] not in d:
d[c[i]] = 0
d[c[i]] += 1
result = 0
if 0 in d:
result += d[0]
for k in d:
if d[k] != 1:
result += d[k] * (d[k] - 1) // 2
print(result)
| p03363 |
import math
n = int(eval(input()))
a = list(map(int,input().split()))
dic_S = {0:[0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += math.factorial(I) // (math.factorial(I-2)*2)
elif I == 2:
ans += 1
else:
pass
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
dic_S = {0:[0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += (I*(I-1))// 2
elif I == 2:
ans += 1
else:
pass
print(ans)
| p03363 |
from itertools import*
from collections import*
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
n,*a=list(map(int,open(0).read().split()))
print((sum(cmb(v,2)for k,v in list(Counter(accumulate(a)).items()) if v>1)+list(accumulate(a)).count(0))) | from itertools import accumulate
from collections import Counter
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
n,*a=list(map(int,open(0).read().split()))
b=list(accumulate(a))
print((sum(cmb(v,2)for k,v in list(Counter(b).items()) if v>1)+b.count(0))) | p03363 |
import sys
readline = sys.stdin.buffer.readline
from collections import Counter
n = int(readline())
lst1 = list(map(int,readline().split()))
def cumsum(lst): #元のリストを保持
res = lst[:]
for i in range(1,len(res)):
res[i] += res[i-1]
return res
lst2 = [0]+cumsum(lst1)
c = Counter(lst2)
ans = 0
for i in range(len(lst2)-1):
c[lst2[i]] -= 1
ans += c[lst2[i]]
print(ans) | import sys
readline = sys.stdin.buffer.readline
n = int(readline())
lst1 = list(map(int,readline().split()))
def cumsum(lst): #元のリストを保持
res = lst[:]
for i in range(1,len(res)):
res[i] += res[i-1]
return res
lst2 = [0] + cumsum(lst1)
ans = 0
dic1 = dict()
for i in lst2:
if i in dic1:
ans += dic1[i]
dic1[i] += 1
else:
dic1[i] = 1
print(ans) | p03363 |
from itertools import accumulate
from collections import Counter
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
f = [1]*(N+1)
def fact():
for i in range(1, N):
f[i+1] = f[i]*(i+1)
def comb(n, r):
return f[n]//(f[r]*f[n-r])
a = accumulate(A)
C = Counter(a)
fact()
ans = 0
for i, v in list(C.items()):
if i == 0:
ans += v
if v > 1:
ans += comb(v, 2)
print(ans)
| from itertools import accumulate
from collections import Counter
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
f = [1]*(N+1)
def fact(n):
for i in range(1, n):
f[i+1] = f[i]*(i+1)
def comb(n, r):
return f[n]//(f[r]*f[n-r])
a = accumulate(A)
C = Counter(a)
fact(max(C.values()))
ans = 0
for i, v in list(C.items()):
if i == 0:
ans += v
if v > 1:
ans += comb(v, 2)
print(ans)
| p03363 |
from itertools import accumulate
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0] + list(accumulate(A))
ans = 0
for i in set(B):
p = Counter(B)[i]
ans += p*(p-1)//2
print(ans)
| from itertools import accumulate
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0] + list(accumulate(A))
C = Counter(B)
ans = 0
for i in set(B):
p = C[i]
ans += p*(p-1)//2
print(ans)
| p03363 |
n=int(eval(input()))
s=input().split()
l=[int(i) for i in s]
ll=[0 for i in range(n)]
ll[0]=l[0]
for i in range(1,n):
ll[i]=ll[i-1]+l[i]
ll=[0]+ll
dic={}
for i in ll:
if i not in list(dic.keys()):
dic[i]=1
else:
dic[i]+=1
res=0
for i in list(dic.keys()):
res+=dic[i]*(dic[i]-1)//2
print(res)
| n=int(eval(input()))
s=input().split()
l=[int(i) for i in s]
ll=[0 for i in range(n)]
ll[0]=l[0]
for i in range(1,n):
ll[i]=ll[i-1]+l[i]
ll=[0]+ll
ll.sort()
now=ll[0]
cnt=1
res=0
for i in range(1,n+1):
if ll[i]==now:
cnt+=1
else:
res+=cnt*(cnt-1)//2
cnt=1
now=ll[i]
res+=cnt*(cnt-1)//2
print(res) | p03363 |
def into_ruiseki(a):
n = len(a)
ret = [0 for i in range(n + 1)]
for i in range(n):
ret[i + 1] = ret[i] + a[i]
return ret
n = int(eval(input()))
a = list(map(int, input().split()))
left = into_ruiseki(a)
right = into_ruiseki(a[::-1])
total = sum(a)
ans = 0
for i in range(n):
for j in range(n - i):
if total - left[i] - right[j] == 0:
ans += 1
print(ans)
| def into_ruiseki(a):
n = len(a)
ret = [0 for i in range(n + 1)]
for i in range(n):
ret[i + 1] = ret[i] + a[i]
return ret
n = int(eval(input()))
a = list(map(int, input().split()))
b = sorted(into_ruiseki(a))
# print("b =", b)
ans = 0
cnt = 1
for i in range(1, n + 1):
if b[i] == b[i - 1]:
cnt += 1
else:
ans += cnt * (cnt - 1) // 2
cnt = 1
ans += cnt * (cnt - 1) // 2
print(ans) | p03363 |
# -*- coding: utf-8 -*-
# 整数の入力
import sys
n = int(eval(input()))
li = list(map(int, input().split()))
count = 0
table = {}
for i in range(len(li)) :
sum = 0
if i in list(table.keys()) :
count += table[i]
continue
match_i = list()
for j in range(len(li)-i) :
sum = sum + li[i+j]
if sum == 0:
count = count + 1
for k in match_i:
table[k] = table[k] + 1
table[i+j+1] = 0
match_i.append(i+j+1)
print(count)
#print(table) | def tri(n):
return n * (n+1) // 2
N = int(eval(input()))
A = list(map(int, input().split()))
SA = [0] * (N+1)
for i in range(N):
SA[i+1] = SA[i] + A[i]
SA.sort()
ans = 0
cnt = 0
for i in range(N+1):
if i == 0:
now = SA[i]
continue
if now == SA[i]:
cnt += 1
continue
elif cnt > 0:
ans += tri(cnt)
cnt = 0
else:
pass
now = SA[i]
if cnt > 0:
ans += tri(cnt)
print(ans)
| p03363 |
import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
arr = [0]
ans = 0
for i, j in enumerate(a):
arr.append(arr[i] + j)
_set = set(arr)
for i in _set:
c = arr.count(i)
if c == 2:
ans += 1
elif c > 2:
ans += len(list(itertools.combinations(list(range(c)), 2)))
print(ans) | import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
arr = [0]
ans = 0
for i, j in enumerate(a):
arr.append(arr[i] + j)
_set = set(arr)
for i in _set:
c = arr.count(i)
if c == 2:
ans += 1
elif c > 2:
ans += (c * (c - 1)) // 2
print(ans) | p03363 |
from collections import Counter
class Combination:
def __init__(self, n):
"""
:param n: 使用する最大のn (nCm)
"""
self.n = n
self.memo = [None for _ in range(n + 1)]
self.memo[0] = [1]
for i in range(1, n + 1):
self._nCm_pascal(i)
def _nCm_pascal(self, i):
"""
パスカルの三角形のn階層目のリストを取得する
:param i: 作成する階層
:return:
"""
if self.n < i:
return
pre_row = self.memo[i - 1]
row = [1] * (i + 1)
for j in range(1, i):
row[j] = pre_row[j - 1] + pre_row[j]
self.memo[i] = row
def nCm(self, n, m):
return self.memo[n][m]
N = [int(_) for _ in input().split()][0]
a = [int(_) for _ in input().split()]
s = [0] * (N + 1)
cnt = Counter()
comb = Combination(N)
for i in range(N):
s[i + 1] = a[i] + s[i]
cnt[s[i + 1]] += 1
ans = 0
for k, v in list(cnt.items()):
# print(k,v)
if v <= 1: continue
ans += comb.nCm(v, 2)
ans += cnt[0]
print(ans)
| from collections import Counter
N = [int(_) for _ in input().split()][0]
a = [int(_) for _ in input().split()]
s = [0] * (N + 1)
cnt = Counter()
for i in range(N):
s[i + 1] = a[i] + s[i]
cnt[s[i + 1]] += 1
ans = 0
for k, v in list(cnt.items()):
# print(k,v)
if v <= 1: continue
ans += (v * (v - 1)) // 2
ans += cnt[0]
print(ans)
| p03363 |
N = int(eval(input()))
A = list(map(int, input().split()))
Asum = [0]*(N+1)
for i in range(N):
Asum[i+1] = Asum[i] + A[i]
ans = 0
for i in range(N):
ans += Asum[i+1:].count(Asum[i])
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
Asum = [0]*(N+1)
for i in range(N):
Asum[i+1] = Asum[i] + A[i]
Asum.sort()
ans = 0
same = 1
tmp = Asum[0] - 1
for i in range(N+1):
if tmp != Asum[i]:
ans += same*(same - 1)//2
tmp = Asum[i]
same = 1
else:
same += 1
ans += same*(same - 1)//2
print(ans) | p03363 |
import itertools
L = [0]
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
dic = {}
dic[0] = 1
for i in range(N):
n = L[-1] + A[i]
L.append(n)
dic.setdefault(n, 0)
dic[n] += 1
for key in list(dic.keys()):
if dic[key] > 1:
cnt += len(list(itertools.combinations(list(range(dic[key])), 2)))
print((int(cnt))) | from math import factorial as f
L = [0]
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
dic = {}
dic[0] = 1
for i in range(N):
n = L[-1] + A[i]
L.append(n)
dic.setdefault(n, 0)
dic[n] += 1
for key in list(dic.keys()):
if dic[key] > 1:
cnt += f(dic[key]) // f(2) // f(dic[key] - 2)
print((int(cnt))) | p03363 |
from math import factorial as f
L = [0]
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
dic = {}
dic[0] = 1
for i in range(N):
n = L[-1] + A[i]
L.append(n)
dic.setdefault(n, 0)
dic[n] += 1
for key in list(dic.keys()):
if dic[key] > 1:
cnt += f(dic[key]) // f(2) // f(dic[key] - 2)
print((int(cnt))) | L = [0]
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
dic = {}
dic[0] = 1
for i in range(N):
n = L[-1] + A[i]
L.append(n)
dic.setdefault(n, 0)
dic[n] += 1
for key in list(dic.keys()):
n = dic[key]
if n > 1:
cnt += n * (n - 1) // 2
print((int(cnt))) | p03363 |
from collections import *
from itertools import *
N=int(eval(input()))
A=list(map(int,input().split()))
s1=[0]+list(accumulate(A))
nums=defaultdict(int)
for i in range(N+1):
nums[s1[i]]+=1
ans=0
s2=set(s1)
for x in s2:
ans+=nums[x]*(nums[x]-1)//2
print(ans)
| from collections import *
from itertools import *
N=int(eval(input()))
A=list(map(int,input().split()))
s=[0]+list(accumulate(A))
s_cnt=Counter(s)
ans=0
for x in list(s_cnt.values()):
ans+=(x*(x-1))//2
print(ans)
| p03363 |
import math
n = int(eval(input()))
a = [int(i) for i in input().split()]
zero = 0
total_list = [0]
total = 0
for i in a:
total += i
zero += total_list.count(total)
total_list.append(total)
print(zero)
| import math
n = int(eval(input()))
zero = 0
total_dictionary = {0: 1}
total = 0
for i in input().split():
total += int(i)
zero += total_dictionary.get(total,0)
if total in total_dictionary:
total_dictionary[total] += 1
else:
total_dictionary[total] = 1
print(zero)
| p03363 |
from itertools import accumulate
from collections import defaultdict
N = int(eval(input()))
As = [0]+list(map(int, input().split()))
Acc = list(accumulate(As))
d = defaultdict(int)
for a in Acc:
d[a] += 1
ans = 0
for k in list(d.keys()):
n = d[k]
ans += n * (n-1)//2
print(ans) | from itertools import accumulate
from collections import defaultdict
n = int(eval(input()))
As = list(map(int, input().split()))
acc = [0]+list(accumulate(As))
d = defaultdict(int)
for a in acc:
d[a] += 1
ans = 0
for k in list(d.keys()):
n = d[k]
ans += n*(n-1)//2
print(ans) | p03363 |
N = int(eval(input()))
A = list(map(int,input().split()))
S = []
s = 0
for i in range(N):
s += A[i]
S.append(s)
ans = 0
for i in range(N):
x = S.pop(0)
if x == 0:
ans += 1
ans += S.count(x)
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
S = []
s = 0
for i in range(N):
s += A[i]
S.append(s)
ans = 0
S.sort()
x = S[0]
j = 1
if x == 0:
ans += 1
for i in range(1,N):
y = S[i]
if y == 0:
ans += 1
if x == y:
ans += j
j += 1
else:
x = y
j = 1
print(ans) | p03363 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0 for i in range(N+1)]
for i in range(N):
S[i+1]=S[i]+A[i]
S.sort()
L=[]
k=0
p=0
for i in range(N+2):
if i==N+1:
L.append(p)
continue
if S[i]==k:
p+=1
else:
L.append(p)
p=1
k=S[i]
ans=0
for x in L:
ans+=(x*(x-1))//2
print(ans)
| n=int(eval(input()));d={0:1};r=s=0
for i in input().split():s+=int(i);x=d.get(s,0);r+=x;d[s]=x+1
print(r) | p03363 |
def comb(n, r):
ret = 1
if (n == r) or (n == 0) or (r == 0):
ret = 1
else:
for i in range(1, n + 1):
ret *= i
for i in range(1, r + 1):
ret //= i
for i in range(1, n - r + 1):
ret //= i
return ret
n = int(eval(input()))
a = list(map(int, input().split()))
s = [0, a[0]]
for i in range(1, n):
s.append(s[i]+a[i])
d = {}
for x in s:
if x in list(d.keys()):
d[x] += 1
else:
d[x] = 1
ans = 0
for k, v in list(d.items()):
if v >= 2:
ans += comb(v, 2)
print(ans) | '''
https://beta.atcoder.jp/contests/agc023/submissions/2426081
'''
n = int(eval(input()))
A = list(map(int, input().split()))
B = {0:1}
s = 0
ans = 0
for a in A:
s += a
B_s = B.get(s, 0)
ans += B_s
B[s] = B_s + 1
print(ans) | p03363 |
from collections import Counter
N=int(eval(input()))
A=list(map(int,input().split()))
cumulative_sum=0
count=0
counter=Counter([0])
for a in A:
cumulative_sum+=a
count+=counter[cumulative_sum]
counter[cumulative_sum]+=1
print(count) | N=int(eval(input()))
A=list(map(int,input().split()))
cumulative_sum=0
count=0
counter={0:1}
for a in A:
cumulative_sum+=a
if cumulative_sum not in counter:
counter[cumulative_sum]=0
count+=counter[cumulative_sum]
counter[cumulative_sum]+=1
print(count) | p03363 |
N = int(eval(input()))
A = [0] + [n for n in map(int, input().split())]
for i in range(N):
A[i+1] += A[i]
A.sort()
ans = 0
cnt_list = []
temp = A[0]
cnt = 0
for i in range(N+1):
if temp == A[i]:
cnt += 1
else:
cnt_list.append(cnt)
cnt = 1
temp = A[i]
else:
cnt_list.append(cnt)
for x in cnt_list:
if x > 1:
ans += x*(x-1) / 2
print((int(ans)))
| N = int(eval(input()))
A = [0] + [a for a in map(int, input().split())]
for i in range(N):
A[i+1] += A[i]
A.sort()
temp = A[0]
cnt = 0
ans = 0
for a in A:
if temp == a:
cnt += 1
else:
ans += cnt *(cnt-1) // 2
cnt = 1
temp = a
ans += cnt * (cnt-1) // 2
print((int(ans)))
| p03363 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(eval(input()))
def MAP() : return list(map(int,input().split()))
def LIST() : return list(MAP())
n = INT()
a = LIST()
s = accumulate(a)
d = defaultdict(int)
for x in s:
d[x] += 1
ans = d[0]
for x in d:
ans += d[x]*(d[x]-1)//2
print(ans) | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(eval(input()))
def MAP() : return list(map(int,input().split()))
def LIST() : return list(MAP())
n = INT()
a = LIST()
b = Counter(list(accumulate(a))+[0])
ans = 0
for x in b:
ans += b[x] * ( b[x] - 1 ) // 2
print(ans) | p03363 |
from collections import defaultdict
N = int(eval(input()))
A = [int(a) for a in input().split()]
series = [0] * (N + 1)
for i in range(1, N+1):
series[i] = series[i-1] + i
sumDict = defaultdict(int)
sumDict[0] = 1
sum = 0
for a in A:
sum += a
sumDict[sum] += 1
total = 0
for key in sumDict:
total += series[sumDict[key] - 1]
print(total) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
sumDict = dict()
sumA = 0
sumDict[0] = 1
for i, a in enumerate(A):
sumA += a
if sumA in sumDict: sumDict[sumA] += 1
else: sumDict[sumA] = 1
ans = 0
for key in sumDict: ans += sumDict[key] * (sumDict[key] - 1) // 2
print(ans)
return 0
if __name__ == "__main__":
solve() | p03363 |
import itertools
N = int(eval(input()))
A = list(map(int, input().split()))
c = [0] * (N+1)
for i in range(N):
c[i+1] = c[i] + A[i]
cnt = 0
for i in range(N+1):
for j in range(i+1, N+1):
if c[j] - c[i] == 0:
cnt += 1
print(cnt)
| N = int(eval(input()))
A = list(map(int, input().split()))
c = [0] * (N+1)
for i in range(N):
c[i+1] = c[i] + A[i]
cnt = {}
for i in range(0,N+1):
if c[i] not in cnt:
cnt[c[i]] = 1
else:
cnt[c[i]] += 1
count = 0
for v in list(cnt.values()):
count += v * (v-1) // 2
print(count)
| p03363 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
A_sum = [A[0]]
for i in range(1,N):
A_sum.append(A_sum[i-1]+A[i])
a_cnt = Counter(A_sum)
ans = 0
for k,v in list(a_cnt.items()):
ans += v*(v-1)//2
if k==0:
ans += v
print(ans) | from collections import Counter
from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
B = [0] + list(accumulate(A))
cnt = Counter(B)
ans = 0
for v in list(cnt.values()):
ans += v*(v-1)//2
print(ans) | p03363 |
from collections import Counter
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
a_cum = list(accumulate(a))
cnt = Counter(a_cum)
ans = 0
for k, v in list(cnt.items()):
if k == 0:
ans += v + v*(v-1) // 2
elif v > 0:
ans += v*(v-1) // 2
print(ans) | from collections import Counter
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = Counter(list(accumulate(a)))
ans = 0
for k,v in list(cnt.items()):
if k == 0:
ans += v
ans += v*(v-1)//2
print(ans) | p03363 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
import itertools as it
from collections import Counter
#======================================================#
def main():
n = II()
aa = MII()
cum = list(it.accumulate([0]+aa))
c = Counter(cum)
print((sum([(n*(n-1))//2 for n in list(c.values())])))
if __name__ == '__main__':
main() | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
import itertools as it
from collections import Counter
#======================================================#
def main():
n = II()
aa = MII()
cum = list(it.accumulate([0]+aa))
c = Counter(cum)
print((sum([(n*(n-1))//2 for n in list(c.values()) if n>1])))
if __name__ == '__main__':
main() | p03363 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
import itertools as it
from collections import Counter
#======================================================#
def main():
n = II()
aa = MII()
cum = list(it.accumulate([0]+aa))
c = Counter(cum)
print((sum([(n*(n-1))//2 for n in list(c.values()) if n>1])))
if __name__ == '__main__':
main() | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
from itertools import accumulate
from collections import Counter
#======================================================#
def main():
n = II()
cum = list(accumulate([0]+MII()))
cnt = [n for n in list(Counter(cum).values()) if n > 1]
ans = sum([(n*(n-1))//2 for n in cnt])
print(ans)
if __name__ == '__main__':
main() | p03363 |
N = int(eval(input()))
A = list(map(int, input().split()))
S = [0]
for a in A:
S.append(S[len(S) - 1] + a)
S = sorted(S)
ret = 0
for s in set(S):
cnt = S.count(s)
ret += cnt * (cnt - 1) / 2
print((int(ret)))
| N = int(eval(input()))
A = list(map(int, input().split()))
S = [0]
for a in A:
S.append(S[len(S) - 1] + a)
S = sorted(S) + [None]
ret = 0
cnt = 1
for i in range(1, N + 2):
if S[i] != S[i - 1]:
ret += cnt * (cnt - 1) // 2
cnt = 1
else:
cnt += 1
print(ret)
| p03363 |
#zero_sum slow
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
res = 0
s = 0
s_list = [[0,0]]
i = 0
while i < N:
s += A[i]
inside = True
j = 0
while j < len(s_list):
if s == s_list[j][1]:
temp = s_list[j][0]
s_list[j][0] += 1
res -= temp * (temp + 1) / 2.
res += (temp + 1) * (temp + 2) / 2.
inside = False
j = len(s_list) + 1
j += 1
if inside:
s_list.append([0,s])
i += 1
print((int(res))) | #zero_sum slow
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
res = 0
s = 0
s_list = {}
s_list.update({0:0})
i = 0
while i < N:
s += A[i]
try:
s_temp = s_list[s]
s_list[s] += 1
res -= s_temp * (s_temp + 1) / 2.
res += (s_temp + 1) * (s_temp + 2) / 2.
except:
s_list.update({s:0})
i += 1
print((int(res))) | p03363 |
N = int(eval(input()))
AAA = [int(i) for i in input().split()]
BBB = [0]
for a in AAA:
BBB.append(a+BBB[-1])
ans=0
for i in range(N+1):
for j in range(i+1,N+1):
if BBB[i]==BBB[j]:
ans+=1
print(ans) | N = int(eval(input()))
AAA = [int(i) for i in input().split()]
BBB = [0]
for a in AAA:
BBB.append(a+BBB[-1])
ans=[]
#print(BBB)
BBB=sorted(BBB)
#print(BBB)
prev = float("inf")
buff=BBB[0]
ans=[]
for i,b in enumerate(BBB):
#print(b,prev,buff)
if b==prev:
buff+=1
else:
if buff>=2:
#print("append!")
ans.append(buff)
buff=1
prev=b
if buff!=1:
ans.append(buff)
#print(ans)
print((sum([(i-1)*i//2 for i in ans]))) | p03363 |
n = int(eval(input()))
ary = list(map(int, input().split()))
#print(n,ary)
ary_2 = [ary[0]]
for i in range(1, n):
ary_2.append(ary[i] + ary_2[i-1])
ary_2 = [0] + ary_2
#print(ary_2)
from collections import Counter
c = Counter(ary_2)
v = (list(c.values()))
#print(v)
from math import factorial
def combinations_count(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
ans = 0
for j in v:
if j >1:
ans += combinations_count(j,2)
print(ans) | n = int(eval(input()))
ary = list(map(int, input().split()))
#print(n,ary)
ary_2 = [ary[0]]
for i in range(1, n):
ary_2.append(ary[i] + ary_2[i-1])
ary_2 = [0] + ary_2
#print(ary_2)
from collections import Counter
c = Counter(ary_2)
v = (list(c.values()))
#print(v)
ans = 0
for j in v:
if j >1:
ans += j * (j-1) // 2
print(ans)
| p03363 |
import math
N=int(eval(input()))
A=list(map(int,input().split()))
count=0
score=0
SUM=[0]
for i in range(N):
SUM=SUM+[SUM[i]+A[i]]
SUM.sort()
for i in range(1,len(SUM)):
if SUM[i]==SUM[i-1]:
count=count+1
else:
if count!=0:
score=score+math.factorial(count)
count=0
if count!=0:
score=score+math.factorial(count)
print(score)
| N=int(eval(input()))
A=list(map(int,input().split()))
count=0
score=0
SUM=[0 for i in range(N+1)]
SUM[0]=0
for i in range(1,N+1):
SUM[i]=SUM[i-1]+A[i-1]
SUM.sort()
for i in range(1,N+1):
if SUM[i]==SUM[i-1]:
count=count+1
else:
if count!=0:
score=score+count*(count+1)//2
count=0
if count!=0:
score=score+count*(count+1)//2
print(score) | p03363 |
import sys,math,collections,itertools
input = sys.stdin.readline
N=int(eval(input()))
a=list(map(int,input().split()))
A =[0]
for i in range(N):
A.append(A[-1]+a[i])
Ac = collections.Counter(A)
cnt = 0
for val in list(Ac.values()):
cnt += val*(val-1)//2
print(cnt)
| import sys,collections,itertools
input = sys.stdin.readline
N=int(eval(input()))
a=list(map(int,input().split()))
A =[0]+list(itertools.accumulate(a))
Ac = collections.Counter(A)
cnt = 0
for val in list(Ac.values()):
cnt += val*(val-1)//2
print(cnt) | p03363 |
import math
N = int(eval(input()))
l = [int(x) for x in input().split()]
s = [0] * (N+1)
for i in range(N):
s[i+1] = s[i] + l[i]
s.sort()
ans = 0
owari = False
for i in range(N+1):
if owari:
break
x = s.pop(0)
count = 1
for j in range(N+1):
if not s:
owari = True
if count != 1:
ans += math.factorial(count) // (math.factorial(count-2)*2)
break
elif x == s[0]:
s.pop(0)
count += 1
elif count != 1:
ans += math.factorial(count) // (math.factorial(count-2)*2)
break
else:
break
print(ans) | N = int(eval(input()))
l = [int(x) for x in input().split()]
s = [0] * (N+1)
for i in range(N):
s[i+1] = s[i] + l[i]
s.sort()
#count
table= {}
for i in range(N+1):
if s[i] in table:
table[s[i]] += 1
else:
table[s[i]] = 1
ans = 0
for key,val in list(table.items()):
if val >= 2:
ans += val*(val-1)//2
print(ans) | p03363 |
from collections import Counter
N = int(eval(input())) # 長さN
A = list(map(int, input().split())) # 整数列A
S = [0]
for i in range(len(A)):
S.append(S[-1] + A[i])
c = Counter(S)
ans = 0
for v in list(c.values()):
ans += v*(v-1)//2
print(ans)
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
s = [0]
for a in A:
s.append(s[-1]+a)
c = Counter(s)
ans = 0
for k, v in list(c.items()):
ans += v*(v-1)//2
print(ans)
| p03363 |
n = int(eval(input()))
a = list(map(int, input().split()))
from math import factorial
from collections import Counter
def comb(r):
return int(factorial(r)/factorial(r-2)/factorial(2))
cum = [a[0]]
for i in range(1,n):
cum.append(cum[-1] + a[i])
cnt = Counter(cum)
ans = 0
for v in list(cnt.values()):
if v >= 2:
ans += comb(v)
print((ans+cum.count(0))) | n = int(eval(input()))
a = list(map(int,input().split()))
from itertools import accumulate
from collections import Counter
import math
a = list(accumulate(a))
b = Counter(a)
def comb(n):
return math.factorial(n)/math.factorial(n-2)/math.factorial(2)
cnt = 0
for v in list(b.values()):
if v >= 2:
cnt += comb(v)
print((int(cnt+a.count(0)))) | p03363 |
def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
t = 0
tl = [0]
for v in a:
t += v
tl.append(t)
tl = collections.Counter(tl)
s = 0
for k, v in list(tl.items()):
s += (v * (v - 1) // 2)
print(s)
if __name__ == '__main__':
slove()
| def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
ans = [0]
t = 0
for i in range(n):
t += a[i]
ans.append(t)
ans = collections.Counter(ans)
t = 0
for k, v in list(ans.items()):
t += (v * (v - 1) // 2)
print(t)
if __name__ == '__main__':
slove()
| p03363 |
def resolve():
import math as m
from collections import defaultdict
N = int(eval(input()))
A = [int(i) for i in input().split()]
preSum = [0] * (N + 1)
dd = defaultdict(int)
dd[0] = 1
for i in range(N):
preSum[i + 1] = preSum[i] + A[i]
dd[preSum[i] + A[i]] += 1
sumA = 0
for key in list(dd.keys()):
if dd[key] > 1:
sumA += m.factorial(dd[key]) // (m.factorial(dd[key] - 2) * 2)
print(sumA)
resolve()
| def resolve():
from collections import defaultdict
N = int(eval(input()))
A = [int(i) for i in input().split()]
preSum = [0] * (N + 1)
dd = defaultdict(int)
dd[0] = 1
for i in range(N):
preSum[i + 1] = preSum[i] + A[i]
dd[preSum[i] + A[i]] += 1
sumA = 0
for key in list(dd.keys()):
if dd[key] > 1:
sumA += dd[key] * (dd[key] - 1) // 2
print(sumA)
resolve()
| p03363 |
from collections import Counter
import math
def nCr(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n = int(eval(input()))
a = list(map(int, input().split()))
a_t = [0]
for i in range(n):
a_t.append(a[i] + a_t[i])
ac = Counter(a_t[1:])
ans = 0
for i in ac:
if i == 0:
ans += ac[i]
if ac[i] > 1:
ans += nCr(ac[i], 2)
print(ans) | import collections
n = int(eval(input()))
a = list(map(int, input().split()))
a_t = [0]
for i in range(n):
a_t.append(a[i] + a_t[i])
a_t = collections.Counter(sorted(a_t))
ans = 0
for i in list(a_t.values()):
ans += i * (i - 1) // 2
print(ans)
| p03363 |
#AGC023 A: 部分和は先頭からの
#AGC023 A
'''
問題
長さNの整数列Aがある
Nは1以上20000以下
Aiは-10**9以上10**9以下
Aの空でない連続する部分列であって，その総和が0であるものの個数は？
考察1
区間[i,j]を取り出して0になるかどうかを試す
これを0<=i<=j<=20000について繰り返す
計算時間はO(N**2)
つまりループ回数が10**10になる->大丈夫?
-> 大丈夫ではない。予想通りTLEになった
考察2
思いつかない...
解説を読んでやり直し
S0 = 0
S1 = A1
S2 = A1 + A2
...
Si = A1 + ... + Ai
とすると, 0<=p<q<=Nとなる(p,q)を選んでSq-Spを計算することによって任意の部分和を構成できる
Sq-Sp=0であればA_(p+1) + ... + Aqの部分和が0である
したがって0<=p<q<=Nとなる(p,q)に対してSp=Sqとなる(p,q)の組を数えればよい
このためにはS0,S1,...をソートして
Siをソートするところがボトルネックとなり, 計算量はO(NlogN)
'''
'''
#考察1は失敗
N = int(input())
A = list(map(int,input().split(' ')))
ans = 0
for i in range(N):
for j in range(i,N):
if sum(A[i:(j+1)]) == 0:
ans += 1
else:
continue
print(ans)
'''
N = int(eval(input()))
A = list(map(int,input().split(' ')))
S = [0]
Scount = []
ans = 0
for i in range(N):
#print(A[0:i+1])
#S.append(sum(A[0:i+1])) <- これは遅くなるのでNG
S.append(S[-1]+A[i])
#print(S)
S = sorted(S)
for s in list(dict.fromkeys(S)):
Scount.append(S.count(s))
for n in Scount:
ans += (n*(n-1)/2)
print((int(ans))) | #AGC023 A: 部分和は先頭からの
#AGC023 A
'''
問題
長さNの整数列Aがある
Nは1以上20000以下
Aiは-10**9以上10**9以下
Aの空でない連続する部分列であって，その総和が0であるものの個数は？
考察1
区間[i,j]を取り出して0になるかどうかを試す
これを0<=i<=j<=20000について繰り返す
計算時間はO(N**2)
つまりループ回数が10**10になる->大丈夫?
-> 大丈夫ではない。予想通りTLEになった
考察2
思いつかない...
解説を読んでやり直し
S0 = 0
S1 = A1
S2 = A1 + A2
...
Si = A1 + ... + Ai
とすると, 0<=p<q<=Nとなる(p,q)を選んでSq-Spを計算することによって任意の部分和を構成できる
Sq-Sp=0であればA_(p+1) + ... + Aqの部分和が0である
したがって0<=p<q<=Nとなる(p,q)に対してSp=Sqとなる(p,q)の組を数えればよい
このためにはS0,S1,...をソートして
Siをソートするところがボトルネックとなり, 計算量はO(NlogN)
'''
'''
#考察1は失敗
N = int(input())
A = list(map(int,input().split(' ')))
ans = 0
for i in range(N):
for j in range(i,N):
if sum(A[i:(j+1)]) == 0:
ans += 1
else:
continue
print(ans)
'''
N = int(eval(input()))
A = list(map(int,input().split(' ')))
S = [0]
Scount = [1]
ans = 0
for i in range(N):
#print(A[0:i+1])
#S.append(sum(A[0:i+1])) <- これは遅くなるのでNG
S.append(S[-1]+A[i])
#print(S)
S = sorted(S)
#for s in list(dict.fromkeys(S)):
#Scount.append(S.count(s)) <- これも遅くなるのでNG
for i in range(N+1):
if i==0:
continue
elif S[i]==S[i-1]:
Scount[-1] += 1
else:
Scount.append(1)
for n in Scount:
ans += (n*(n-1)/2)
print((int(ans))) | p03363 |
n = int,eval(input())
a = list(map(int, input().split()))
wa = []
ans = 0
wa.append(a[0])
for i in range(1,len(a)):
wa.append(wa[i-1] + a[i])
ans += wa.count(0)
for i in range(0,len(a)):
wa2 = []
wa2 = list([x-wa[i] for x in wa])
wa3 = wa2[i+1:]
ans += wa3.count(0)
print(ans)
| n = int,eval(input())
a = list(map(int, input().split()))
total = []
ans = 0
dic = {0:1}
for i in range(0,len(a)):
if(i == 0):
total.append(a[0])
else:
total.append(total[i-1] + a[i])
ans += dic.get(total[i],0)
if total[i] in dic:
dic[total[i]] += 1
else:
dic[total[i]] = 1
print(ans)
| p03363 |
from collections import Counter
from itertools import accumulate
N = int(eval(input()))
inputs = [int(i) for i in input().split()]
ans = 0
ruisekiwa = list(accumulate(inputs))
ruisekiwa.sort()
counter_ruiseki = Counter(ruisekiwa)
for key, value in list(counter_ruiseki.items()):
if key == 0 and value == 1:
ans += value
continue
elif key == 0 and value > 1:
ans += value
if value > 1:
ans += sum(list(range(value)))
print(ans)
| from collections import Counter
from itertools import accumulate
N = int(eval(input()))
inputs = [int(i) for i in input().split()]
ans = 0
ruisekiwa = list(accumulate(inputs))
for key, value in list(Counter(ruisekiwa).items()):
if key == 0 and value == 1:
ans += value
continue
elif key == 0 and value > 1:
ans += value
if value > 1:
ans += value * (value - 1) // 2
print(ans)
| p03363 |
from collections import defaultdict
n = int(eval(input()))
A = list(map(int, input().split()))
dd = defaultdict(int)
dd[0] += 1
S = [0]*(n+1)
for i in range(n):
S[i+1] = S[i]+A[i]
dd[S[i+1]] += 1
print((sum(v*(v-1)//2 for v in list(dd.values()))))
| from collections import defaultdict
from itertools import accumulate
n = int(eval(input()))
A = accumulate(list(map(int, input().split())))
cnt = defaultdict(int)
cnt[0] += 1
for a in A:
cnt[a] += 1
print((sum(v*(v-1)//2 for v in list(cnt.values())))) | p03363 |
n = int(eval(input()))
a = list(map(int,input().split(" ")))
b = [0 for a in range(n)]
b[0] = a[0]
answer = 0
for i in range(n-1):
b[i+1] = b[i] + a[i+1]
# print(b)
for i in b:
if i == 0:
answer += 1;
minimum = min(b)
for i in range(n):
b[i] -= minimum
# print(b)
c = [0 for a in range(max(b)+1)]
for i in range(n):
c[b[i]] += 1
for i in c:
if i > 1:
answer += i * (i-1) // 2
# print(c)
# print(sum(c))
print(answer) | n = int(eval(input()))
a = list(map(int,input().split(" ")))
b = [0 for a in range(n)]
b[0] = a[0]
answer = 0
for i in range(n-1):
b[i+1] = b[i] + a[i+1]
# print(b)
for i in b:
if i == 0:
answer += 1;
minimum = min(b)
for i in range(n):
b[i] -= minimum
# print(b)
# c = [0 for a in range(max(b)+1)]
setb = set(b)
# print(setb)
c = {}
for key in setb:
c[str(key)] = 0
for i in range(n):
c[str(b[i])] += 1
for v in list(c.values()):
if v > 1:
answer += v * (v-1) // 2
# print(c)
# print(sum(c))
print(answer) | p03363 |
from collections import Counter
import math
def combi(n, r):
if n >= 2:
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
else:
return 0
n = int(eval(input()))
a = list(map(int, input().split()))
s = [0]
for i in range(n):
s.append(s[i] + a[i])
cs = Counter(s)
ans = 0
for i in list(cs.values()):
ans += combi(i, 2)
print(ans) | from collections import defaultdict
n = int(eval(input()))
A = list(map(int, input().split()))
accum = [0] * (n + 1)
for i in range(n):
accum[i + 1] = accum[i] + A[i]
box = defaultdict(int)
for i in accum:
box[i] += 1
ans = 0
for k, v in list(box.items()):
ans += v * (v -1) // 2
print(ans) | p03363 |
# coding :utf-8
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(len(A)):
sum = A[i]
if sum == 0:
ans += 1
for j in range(i+1, len(A)):
sum += A[j]
if sum == 0:
ans += 1
print(ans) | # coding: utf-8
n = int(eval(input()))
a = list(map(int, input().split()))
# aの要素は1以上であるため、前方からの総和の数列sについて
# 同一の数値がでてきたとき、和が0になる連続する部分数列がある
# 例
# A = [1, 3, -4, 2, 2, -2]
# S = [1, 4, 0, 2, 4, 2]
# S_3:5 = S_5 - S_2 =(Sum(A_1:5) - Sum(A_1:2)) = 0
#
ans = 0
s = 0
# 総和順列の値について、値と個数の辞書を用意する
l ={0:1}
for i in a:
# 数列の現在位置までの総和をカウント
s += i
if s in l:
ans += l[s]
l[s] += 1
else:
l[s] = 1
print(ans) | p03363 |
n = int(eval(input()))
a = list(int(i) for i in input().split())
sa = [0] * (n+1)
num_cnt = {}
# 累積和
for i in range(n):
sa[i+1] = sa[i] + a[i]
nums = list(set(sa))
for num in nums:
num_cnt[num] = sa.count(num)
res = 0
for cnt in list(num_cnt.values()):
res += cnt*(cnt-1)//2
print(res) |
n = int(eval(input()))
a = list(int(i) for i in input().split())
sa = [0] * (n+1)
num_cnt = {}
# 累積和
for i in range(n):
sa[i + 1] = sa[i] + a[i]
for num in sa:
if num in num_cnt:
num_cnt[num] += 1
else:
num_cnt[num] = 1
res = 0
for cnt in list(num_cnt.values()):
res += cnt*(cnt-1)//2
print(res)
| p03363 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
sumA = [0]*(N+1)
table = collections.defaultdict(int)
table[0] += 1
for i in range(N):
sumA[i+1] = sumA[i]+A[i]
table[sumA[i+1]] += 1
ans = 0
table = list(table.values())
table = [x for x in table if x > 1]
for x in table:
ans += x*(x-1)//2
print(ans)
| import itertools
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
table = collections.defaultdict(int)
A = [0] + A
s = itertools.accumulate(A)
for x in s:
table[x] += 1
ans = 0
for x in table:
if table[x] > 1:
ans += (table[x] * (table[x]-1)) // 2
print(ans)
| p03363 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.