input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
b = 0
c = []
for i in range(n):
b += a[i]
c.append(b)
if b == 0:
cnt += 1
for j in range(i):
if b-c[j] == 0:
cnt += 1
print(cnt) |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
b = 0
c = [0]
for i in range(n):
b += a[i]
c.append(b)
c.sort()
i=0
ncm=0
m = 1
while True:
i += 1
if i == n+1:
ncm += m*(m-1)//2
break
if c[i] == c[i-1]:
m += 1
contin... | p03363 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
cumsum = [0]
for a in A:
cumsum += [cumsum[-1] + a]
ans = 0
for i in range(N):
for j in range(i + 1, N + 1):
ans += cumsum[j] - cumsum[i] == 0
print(ans)
| import heapq
N = int(eval(input()))
A = [int(_) for _ in input().split()]
cumsum = [0]
for a in A:
cumsum += [cumsum[-1] + a]
heapq.heapify(cumsum)
before = 10 ** 10
count = 0
ans = 0
while cumsum:
now = heapq.heappop(cumsum)
count += before == now
if not (before == now and cumsum):
... | p03363 |
import heapq
N = int(eval(input()))
A = [int(_) for _ in input().split()]
cumsum = [0]
for a in A:
cumsum += [cumsum[-1] + a]
heapq.heapify(cumsum)
before = 10 ** 10
count = 0
ans = 0
while cumsum:
now = heapq.heappop(cumsum)
count += before == now
if not (before == now and cumsum):
... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
cumsum = [0]
for a in A:
cumsum += [cumsum[-1] + a]
cumsum.sort()
ans = 0
count = 0
for i in range(N):
if cumsum[i] == cumsum[i + 1]:
count += 1
if cumsum[i] != cumsum[i + 1] or i == N - 1:
ans += count * (count + 1) //... | p03363 |
#import numpy as np
import itertools
N = int(input().strip())
A = list(map(int,input().strip().split(' ')))
#Z = np.zeros((N+1,N))
Z = [[0]*int(N+1) for i in range(N) ]
#Z[0,:] = np.array(A)
result = 0
for k in range(N):
Z[0][k] = A[k]
if A[k] == 0:
result = result+1
for ... | import itertools
N = int(input().strip())
A = list(map(int,input().strip().split(' ')))
Z = [[0 for m in range(N+1)] for n in range(N) ]
result = 0
for k in range(N):
Z[0][k] = A[k]
if A[k] == 0:
result = result+1
for i,j in itertools.combinations_with_replacement(list(range... | p03363 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [0]
for i in range(n):
b.append(a[i]+b[i])
ans = 0
for i in range(n+1):
ans += b.count(b[0])-1
b = b[1:]
print(ans)
|
n = int(eval(input()))
a = list(map(int,input().split()))
b = {0:0}
c = 0
for i in range(n):
c = c+a[i]
if c in b:
b[c] += 1
else:
b[c] = 0
d = list(b.values())
ans = 0
for i in d:
ans+= ((i+1)*i)//2
print(ans) | p03363 |
# coding: utf-8
# Your code here!
# coding: utf-8
import sys
sys.setrecursionlimit(200000000)
# my functions here!
#入力
def pin(type=int):
return list(map(type,input().rstrip().split()))
from collections import Counter
def resolve():
N,=pin()
A=list(pin())
S=[sum(A[:i])for i in r... | # coding: utf-8
# Your code here!
# coding: utf-8
import sys
sys.setrecursionlimit(200000000)
# my functions here!
#入力
def pin(type=int):
return list(map(type,input().rstrip().split()))
from collections import Counter
from itertools import accumulate as acm
def resolve():
N,=pin()
S=lis... | p03363 |
N = int(eval(input()))
A = [i for i in map(int, input().split())]
def search(arr):
if len(arr) == 1:
if arr[0] == 0:
return arr, 1
else:
return arr, 0
kouho, count = search(arr[1:])
next_arr = [i + arr[0] for i in kouho]
next_arr.append(arr[0])
co... | N = int(eval(input()))
A = [i for i in map(int, input().split())]
count = 0
numbers = []
for i in A:
numbers = [j + i for j in numbers]
numbers.append(i)
count += numbers.count(0)
print(count) | p03363 |
n = int(eval(input()))
a = list(map(int, input().split()))
s = [0]
s.extend([sum(a[0:i+1]) for i in range(n)])
s.sort()
result = 0
count = 1
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) //... | n = int(eval(input()))
a = list(map(int, input().split()))
s = [0]
for i in range(n):
s.append(s[-1] + a[i])
s.sort()
result = 0
count = 1
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)... | p03363 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_sum = [0] * (N + 1)
for i in range(1, N+1):
A_sum[i] = A_sum[i-1] + A[i-1]
dict = {}
for a in A_sum:
if a in list(dict.keys()):
dict[a] = dict[a] + 1
else:
dict[a] = 1
ans = 0
for num in list(dict.values()):
ans ... | N = int(eval(input()))
A = list(map(int, input().split()))
A_sum = [0] * (N + 1)
for i in range(1, N+1):
A_sum[i] = A_sum[i-1] + A[i-1]
A_sum.sort()
ans = 0
add = 0
a_cur = float('inf')
for a in A_sum:
if a != a_cur:
add = 0
a_cur = a
else:
add += 1
ans += ... | p03363 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [sum(A[:i]) for i in range(n+1)]
# num = [S.count(i) for i in set(S)]
from collections import Counter
def hello(bm):
dt = Counter()
for i in bm:
key = str(i)
dt[key] += 1
return dt
num = hello(S)
out = [i*(i-1)/... | from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0]*(n+1)
for i in range(n):
S[i+1] = S[i] + A[i]
def hello(data):
dt = Counter()
for i in data:
dt[str(i)] += 1
return dt
num = hello(S)
out = [i*(i-1)//2 for i in list(num.values()) if ... | p03363 |
from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0]*(n+1)
for i in range(n):
S[i+1] = S[i] + A[i]
def hello(data):
dt = Counter()
for i in data:
dt[str(i)] += 1
return dt
num = hello(S)
out = [i*(i-1)//2 for i in list(num.values()) if ... | n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0]*(n+1)
num={}
for i in range(n):
S[i+1] = S[i] + A[i]
for i in S:
if str(i) in list(num.keys()):
num[str(i)] += 1
else:
num[str(i)] = 1
out = [i*(i-1)//2 for i in list(num.values()) if i>1]
print((sum(out))) | p03363 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
S = [0]*(N+1)
dic = defaultdict(int)
dic[0] = 1
for i in range(1,N+1):
S[i] = S[i-1] + A[i-1]
dic[S[i]] += 1
ans = 0
for _,v in list(dic.items()):
if v > 0:
ans += v*(v-1)//2
print(ans)
| 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]
ans = 0
dic = defaultdict(int)
for i in range(N+1):
ans += dic[S[i]]
dic[S[i]] += 1
print(ans)
| p03363 |
N = int(eval(input()))
A = list(map(int,input().split()))
L = [A[0]]
for i in range(1,N):
L.append(L[i-1]+A[i])
k = 0
for i in range(N):
if (L[i] == 0):
k += 1
for j in range(i+1,N):
if (L[i] - L[j] == 0):
k += 1
print(k) | N = int(eval(input()))
L = list(map(int,input().split()))
S = [0]
c = 0
for i in range(N):
c = S[i] + L[i]
S.append(c)
S.sort()
S.append(S[N]+1)
k = 0
p = 1
ans = 0
while k <= N:
if S[k] == S[k+1]:
p += 1
k += 1
else:
ans += p*(p-1)//2
p = 1
k += 1
print(ans) | p03363 |
import collections
n = int(eval(input()))
lis = list(map(int,input().split()))
count = 0
countArray = [0]*n
calc=0
for i in range(n):
calc += lis[i]
countArray[i] = calc
if calc == 0:
count +=1
c = collections.Counter(countArray)
for i in range(len(c.most_common())):
counts = ... | import collections
n = int(eval(input()))
lis = list(map(int,input().split()))
count = 0
countArray = [0]*n
calc=0
for i in range(n):
calc += lis[i]
countArray[i] = calc
if calc == 0:
count +=1
c = collections.Counter(countArray)
a = c.most_common()
for i in range(len(c.most_commo... | p03363 |
from collections import Counter
from operator import mul
from functools import reduce
def main():
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
n = int... | from itertools import accumulate
from collections import Counter
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
B = [0, ] + list(accumulate(A))
c = Counter(B)
ans = 0
for k, v in list(c.items()):
ans += v * (v - 1) // 2
print(ans)
if __name__ ... | p03363 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) f... | p03363 |
c=0
N=int(eval(input()))
A=list(map(int,input().split()))
for i in range(N):
for j in range(i+1,N):
if sum(A[i:j+1])==0:
c=c+1
for i in range(N):
if A[i]==0:
c=c+1
print(c) | N=int(eval(input()))
L=list(map(int,input().split()))
R={}
sums=0
for i in range(N):
sums+=L[i]
if sums in R:
R[sums]+=1
else:
R[sums]=1
k=0
if 0 in R:
k=R[0]
print((sum([i*(i-1)//2 for i in list(R.values())])+k)) | p03363 |
# A - Zero-Sum Ranges
from itertools import accumulate
from collections import defaultdict as dd
n=int(eval(input()))
a=[0]+list(map(int,input().split()))
acc=accumulate(a)
acc=list(acc)
acc.sort()
# print(acc)
d=dd(int)
for aa in acc:
d[aa]+=1
ans=0
for k,v in list(d.items()):
if v>=2:
... | n=int(eval(input()))
a=[0]+list(map(int,input().split()))
from itertools import accumulate
a=accumulate(a)
a=list(a)
a.sort()
from collections import Counter
c=Counter(a)
ans=0
for k,v in list(c.items()):
if v>=2:
ans+=v*(v-1)//2
print(ans)
| p03363 |
n=int(eval(input()))
a=[0]+list(map(int,input().split()))
from itertools import accumulate
a=accumulate(a)
a=list(a)
a.sort()
from collections import Counter
c=Counter(a)
ans=0
for k,v in list(c.items()):
if v>=2:
ans+=v*(v-1)//2
print(ans)
| N = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
from collections import Counter
from itertools import accumulate
s = list(accumulate(a))
c = Counter(s)
ans = 0
for v in list(c.values()):
ans += v*(v-1)//2
print(ans)
| p03363 |
n=int(eval(input()))
A=list(map(int,input().split()))
s=[0]
for i in range(n):
s.append(s[-1]+A[i])
cnt=[]
S=set(s)
for i in S:
cnt.append(s.count(i))
ans=0
for i in cnt:
if 1<i:
ans+=i*(i-1)//2
print(ans)
| n=int(eval(input()))
A=list(map(int,input().split()))
s=[0]
for i in range(n):
s.append(s[-1]+A[i])
s.sort()
ans=0
cnt=1
for i in range(1,n+1):
if s[i-1]==s[i]:
cnt+=1
else:
if 2<=cnt:
ans+=(cnt*(cnt-1))//2
cnt=1
else:
cnt=1
if 2<=... | p03363 |
from collections import Counter
def comb(n, k):
k = min(k, n - k)
result = 1
for i in range(n, n - k, -1):
result *= i
for i in range(1, k + 1):
result //= i
return result
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0] * (n + 1)
for i in range... | from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
S = [0] * (n + 1)
for i in range(1, n + 1):
S[i] = S[i - 1] + A[i - 1]
S = Counter(S)
ans = 0
for v in list(S.values()):
ans += v * (v - 1) // 2
print(ans) | p03363 |
# -*- coding: utf-8 -*-
import collections
n = int(eval(input()))
a = [int(i) for i in input().split()]
#累積和を求める
sum_a = [0 for _ in range(n+1)]
for i in range(1, n+1):
sum_a[i] = sum_a[i-1] + a[i-1]
#print(sum_a)
ans = 0
c = collections.Counter(sum_a)
for i in range(min(sum_a), max(sum_a)+1):
t... | # -*- coding: utf-8 -*-
import collections
n = int(eval(input()))
a = [int(i) for i in input().split()]
#累積和を求める
sum_a = [0 for _ in range(n+1)]
for i in range(1, n+1):
sum_a[i] = sum_a[i-1] + a[i-1]
#print(sum_a)
ans = 0
c = collections.Counter(sum_a)
for i in set(sum_a):
tmp = c[i]
if tmp... | p03363 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
cum = [0] * (n + 1)
for i in range(n):
cum[i + 1] = cum[i] + a[i]
c = Counter(cum)
ans = 0
for v in list(c.values()):
ans += v * (v - 1) // 2
print(ans) | from itertools import accumulate
from collections import Counter
N = int(eval(input()))
A = [0]+list(map(int, input().split()))
Acum = list(accumulate(A))
C = Counter(Acum)
ans = 0
for _, v in list(C.items()):
ans += (v - 1) * v // 2
print(ans)
| p03363 |
A, B = list(map(int, input().split()))
if A >= 13:
print(B)
elif A <=5:
print((0))
else:
print((int(B/2))) | a,b=list(map(int,input().split()))
print((b if a>=13 else b//2 if 6<=a<=12 else 0)) | p03035 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
A,B = MI()
if A <= 5:
print((0))
elif A >= 13:
print(B)
else:
print((B//2))
| p03035 |
a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif 12 >= a >= 6:
print((b//2))
else:
print((0)) | a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif 6<=a<=12:
print((b//2))
else:
print((0)) | p03035 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
if A <= 5:
print((0))
elif A <= 12:
print((int(B/2)))
else:
print(B)
| a, b = list(map(int, input().strip().split()))
if a >= 13:
print(b)
elif a >= 6:
print((b // 2))
else:
print((0))
| p03035 |
A, B = list(map(int, input().split()))
if A <= 5:
print((0))
elif A <= 12:
print((B//2))
else:
print(B)
| A, B = list(map(int, input().split()))
if A <= 5:
B = 0
elif A <= 12:
B //= 2
print(B)
| p03035 |
i=list(map(int,input().split()))
if i[0]>=13:
print((i[1]))
elif i[0]>=6:
print((int(i[1]/2)))
else:
print("0") | a,b=list(map(int,input().split()))
if a<6:
print((0))
elif a<13:
print((b//2))
else:
print(b) | p03035 |
#ABC127A - Ferris Wheel
A, B = list(map(int,input().split()))
if A >= 13:
print(B)
if 6 <= A <= 12:
print((B//2))
if A <= 5:
print((0)) | #ABC127A - Ferris Wheel
A, B = list(map(int,input().split()))
if A >= 13:
print(B)
elif 6 <= A <= 12:
print((B//2))
else:
print((0)) | p03035 |
a,b=list(map(int,input().split()))
print((b if a>=13 else b//2 if 12>=a>=6 else 0)) | a, b = list(map(int, input().split()))
ans = b
if 12 >= a >= 6:
ans = b // 2
if a <= 5:
ans = 0
print(ans)
| p03035 |
a, b = list(map(int,input().split()))
if a >= 13:
print(b)
elif a >= 6:
b //= 2
print(b)
else:
print((0))
| a, b = list(map(int,input().split()))
if a >= 13:
print(b)
exit()
if a >= 6:
b //= 2
print(b)
exit()
print((0))
| p03035 |
# -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif a >= 6 and a <= 12:
print((int(b/2)))
else:
print((0))
| # -*- coding: utf-8 -*-
def main():
a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif a <= 12 and a >= 6:
print((int(b / 2)))
else:
print((0))
if __name__ == "__main__":
main()
| p03035 |
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
def gcd(a, b):
a, b = max(a, b), min(a, b)
while a % b > 0: a, b = b, a % b
return b
def solve():
A, B = list(map(int, ... | import sys
def solve():
input = sys.stdin.readline
A, B = list(map(int, input().split()))
if A <= 5: B = 0
elif A <= 12: B //= 2
print(B)
return 0
if __name__ == "__main__":
solve() | p03035 |
A, B = list(map(int, input().split()))
if A <= 5:
print((0))
exit()
if A <= 12:
print((int(B/2)))
exit()
print(B)
| A, B = list(map(int, input().split()))
if 5 >= A:
print((0))
elif 12 >= A:
print((int(B/2)))
else:
print(B)
| p03035 |
a,b=list(map(int,input().split()))
if a>=13:
print(b)
if a>=6 and a<=12:
print((b//2))
if a<=5:
print((0)) | a,b=list(map(int,input().split()))
if a<=5:
print((0))
elif a<=12:
print((b//2))
else:
print(b) | p03035 |
a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif a <= 5:
print((0))
else:
print((b//2)) | a, b = list(map(int, input().split()))
if a <= 5:
print((0))
elif a <= 12:
print((b//2))
else:
print(b)
| p03035 |
a,b = list(map(int,input().split()))
print((0 if a<=5 else b if a >= 13 else b//2))
| a,b=list(map(int,input().split()))
if a<=5:
print((0))
exit()
elif 6<=a<=12:
print((b//2))
exit()
else:
print(b) | p03035 |
import os, sys, re, math
A,B = [int(s) for s in input().split(' ')]
if A < 6:
print((0))
elif 6 <= A and A <= 12:
print((int(B/2)))
else:
print(B)
| import os, sys, re, math
A,B = list(map(int,input().split(' ')))
if A >= 13:
print(B)
elif A >= 6:
print((B // 2))
else:
print((0)) | p03035 |
age, fee = list(map(int, input().split()))
if age >= 13:
print(fee)
elif 6 <= age and age <= 12:
print((fee // 2))
else:
print((0)) | a, b = list(map(int, input().split()))
if a >= 13:
print(b)
elif a <= 5:
print((0))
else:
print((int(b/2))) | p03035 |
A,B = list(map(int,input().split()))
if A >= 13:
print(B)
elif 6<=A<=12:
print((B//2))
else:
print("0") | #! python3
# solve127A.py
age,cost = list(map(int,input().split()))
if age <= 5:
cost = 0
elif 6 <= age <= 12:
cost = cost//2
elif 7 <= age:
cost = cost
print(cost) | p03035 |
A,B = list(map(int,input().split()))
if 13 <= A:
print(B)
elif (6 <= A) and (A<=12):
print((B//2))
else:
print((0))
| a,b = list(map(int,input().split()))
if a >= 13:
print(b)
elif (6 <=a<= 12):
print((b//2))
else:
print("0")
| p03035 |
N, W = list(map(int, input().split()))
if N >=13:
print(W)
elif N >=6:
print((W//2))
else:
print((0)) | A, B = list(map(int, input().split()))
if A >= 13:
print(B)
elif A >= 6:
print((B//2))
else:
print((0))
| p03035 |
A, B = list(map(int,input().split()))
if A < 6:
print((0))
elif A < 13:
print((int(B / 2)))
else:
print(B)
| A,B=list(map(int,input().split()))
if 13<=A:
print((int(B)))
if 6<=A and A<=12:
print((int(B/2)))
if A<=5:
print((int(0))) | p03035 |
a,b = list(map(int,input().split()))
if a<6:
print('0')
elif 6<=a<=12:
print((int(b/2)))
else:
print(b) | a,b = list(map(int,input().split()))
if a>=13:
print(b)
elif 6<=a<=12:
print((int(b/2)))
else:
print('0') | p03035 |
A,B = list(map(int,input().split()))
if A <= 5:
print((0))
elif 6 <= A <= 12:
print((B//2))
else:
print(B) | A,B = list(map(int,input().split()))
if A >= 13:
print(B)
elif A >= 6:
print((B//2))
else:
print((0)) | p03035 |
def bomb(x,y):
global M
s=M[y+2]
R=[-3,-2,-1,1,2,3]
if s[x+2]=="0":return
M[y+2]=s[:x+2]+"0"+s[x+3:]
for d in R:
bomb(x+d,y)
bomb(x,y+d)
return
A=list(range(14))
B=list(range(8))
M=["00000000000000" for i in A]
z="000"
n=eval(input())
for i in range(n):
... | def bomb(x,y):
global M
s=M[y+2]
R=[-3,-2,-1,1,2,3]
if s[x+2]=="0":return
M[y+2]=s[:x+2]+"0"+s[x+3:]
for d in R:
bomb(x+d,y)
bomb(x,y+d)
return
A=list(range(14))
B=list(range(3,11))
M=["00000000000000" for i in A]
z="000"
n=eval(input())
for i in range(n):
... | p00071 |
def bomb(x,y):
s=M[y]
if s[x]=="0":return
M[y]=s[:x]+"0"+s[x+1:]
R=[-3,-2,-1,1,2,3]
for e in R:
bomb(x+e,y)
bomb(x,y+e)
return
A=list(range(3,11))
M=["00000000000000" for i in range(14)]
z="000"
n=eval(input())
for i in range(n):
s=input()
for j in A:
... | def bomb(x,y):
s=M[y]
if s[x]=="0":return
M[y]=s[:x]+"0"+s[x+1:]
R=[-3,-2,-1,1,2,3]
for e in R:
bomb(x+e,y)
bomb(x,y+e)
return
A=list(range(14))
B=list(range(3,11))
M=["0"*14 for i in A]
z="000"
n=eval(input())
for i in range(n):
s=input()
for j in B:
... | p00071 |
a,b,c=list(map(int, input().split()))
d=0
for _ in range(60):
if c<=d+a:
print(c)
break
d+=a+b
while c<=d:c+=60
else: print((-1)) | a,b,c=list(map(int, input().split()))
d,e=0,60
for _ in range(e):
if c<=d+a:
print(c)
break
d+=a+b
c+=(d+e-c)//e*e
else: print((-1)) | p01751 |
def solve(a, b, c):
l = 0; r = a;
for t in range(114514):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a,b,c) | def solve(a, b, c):
l = 0; r = a;
for t in range(514):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a,b,c) | p01751 |
import sys
INF = (sys.maxsize)/3
def NumberofWindow(a_list, S):
i = 0
j = 0
tmpS = a_list[0]
res = 0
while j < len(a_list) :
while tmpS <= S and i <len(a_list)-1:
i += 1
tmpS += a_list[i]
if i == len(a_list)-1:
if tmpS > S:
res += i-j
else:
res += i-j+1
else:
res +=... | import sys
INF = (sys.maxsize)/3
def NumberofWindow(N, a_list, S):
i = 0
j = 0
tmpS = a_list[0]
res = 0
while j < N :
while tmpS <= S and i <N-1:
i += 1
tmpS += a_list[i]
if i == N-1:
if tmpS > S:
res += i-j
else:
res += i-j+1
else:
res += i-j
tmpS -=a_list[j]
... | p02356 |
import sys
INF = (sys.maxsize)/3
def NumberofWindow(N, a_list, S):
i = 0
j = 0
tmpS = a_list[0]
res = 0
while j < N :
while tmpS <= S and i <N-1:
i += 1
tmpS += a_list[i]
if i == N-1:
if tmpS > S:
res += i-j
else:
res += i-j+1
else:
res += i-j
tmpS -=a_list[j]
... | import sys
INF = (sys.maxsize)/3
def NumberofWindow(N, a_list, S):
i = 0
j = 0
tmpS = a_list[0]
res = 0
for j in range(N) :
while tmpS <= S and i <N-1:
i += 1
tmpS += a_list[i]
if i == N-1:
if tmpS > S:
res += i-j
else:
res += i-j+1
else:
res += i-j
tmpS -=a_list[... | p02356 |
from bisect import bisect
from itertools import accumulate
n, q = list(map(int, input().split()))
ac = list(accumulate(list(map(int, input().split()))))
anss = []
for x in map(int, input().split()):
ans = 0
prev = 0
for l, a in enumerate(ac):
r = bisect(ac, prev + x, l)
ans += r ... | n, q = list(map(int, input().split()))
aa = list(map(int, input().split()))
anss = []
for x in map(int, input().split()):
l = 0
ans = 0
_sum = 0
for r, a in enumerate(aa):
_sum += a
while _sum > x:
_sum -= aa[l]
l += 1
ans += r - l + 1
ans... | p02356 |
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
def LN(n):return [N() for i in range(n)]
def LL(n):return [L() for i in range(n)]
def YesNo(x):print("Yes")if x==True else print("No")
k=N()
s=input()
if len(s)<=k:
print(s)
else:
print(s[:k]+"...")
| import sys
def input():return sys.stdin.readline()[:-1]
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
def LN(n):return [N() for i in range(n)]
def LL(n):return [L() for i in range(n)]
def YesNo(x):print("Yes")if x==True else print("No")
k=N()
s=input()
if len(... | p02676 |
import bisect,collections,copy,heapq,itertools,math,string
import sys
sys.setrecursionlimit(1000000)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rst... | import sys
sys.setrecursionlimit(1000000)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
K = I()
S = S()
if len(S) <= K:
pri... | p02676 |
import sys
input = sys.stdin.readline
k = int(eval(input()))
s = list(input().rstrip())
n = len(s)
if n <= k:
print(("".join(s)))
else:
ans = "".join(s[:k]) + "..."
print(ans) | import sys
input = sys.stdin.readline
k = int(eval(input()))
s = input().rstrip()
ans = s if len(s) <= k else s[:k] + "..."
print(ans) | p02676 |
MOD = 10**9 + 7
N = int(eval(input()))
S = input().rstrip()
is_left = [(i%2 == 0) ^ (x == "W") for i, x in enumerate(S)]
answer = 1
left = 0
for bl in is_left:
if bl:
left += 1
else:
answer *= left
left -= 1
if left != 0:
answer = 0
for i in range(1, N+1... | MOD = 10**9 + 7
N = int(eval(input()))
S = input().rstrip()
is_left = [(i%2 == 0) ^ (x == "W") for i, x in enumerate(S)]
answer = 1
left = 0
for bl in is_left:
if bl:
left += 1
else:
answer *= left
left -= 1
answer %= MOD
if left != 0:
answer = 0
... | p02929 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float... | p02929 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float... | p02929 |
n,s=open(0)
n=int(n)
a=l=s[0]<'W'>s[-2]
r=f=0
for b,c in zip(s,s[1:-1]):f^=b==c;a=a*(max(1,n))*(l-r)**f%(10**9+7);n-=1;r+=f;l+=f^1
print((a*(l==r))) | n,s=open(0)
n=int(n)
a=l=s[0]<'W'>s[-2]
r=f=0
for b,c in zip(s,s[1:-1]):f^=b==c;a=a*(n<1or n)*(l-r)**f%(10**9+7);n-=1;r+=f;l+=f^1
print((a*(l==r))) | p02929 |
n,s=open(0)
a=i=1
l=0
for c in s:f=(c>'B')^i%2;l+=f;a=a*l**f*(i>int(n)or i)%(10**9+7);l-=f^1;i+=1
print((a*(l==1))) | n,s=open(0)
a=i=1
l=0
for c in s:f=(c>'B')^i%2;l+=f or-1;a=a*l**f*(i>int(n)or i)%(10**9+7);i+=1
print((a*(l==1))) | p02929 |
a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
s = {(0, 0, 0)}.union(*({(n // p, p, c), (-(-n // p), p, c)} for p, c in zip(a, b)))
m = min(f(x) + abs(x * p - n) * d + c for x, p, c in s)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input... | a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
m = d * n
for p, c in zip(a, b):
k, r = divmod(n, p);
m = min(m, f(k) + r * d + c, r and f(k + 1) + (p - r) * d + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input().s... | p02669 |
a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
m = d * n
for p, c in zip(a, b):
m = min(m, *(f(k) + abs(p * k - n) * d + c for k in (n // p, -(-n // p))))
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input().split()))
memo = {0:... | a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
m = d * n
for p, c in zip(a, b):
k, r = divmod(n, p);
m = min(m, f(k) + r * d + c, r and f(k + 1) + (p - r) * d + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input()... | p02669 |
a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
nd = m = n * d
for p, c in zip(a, b):
p *= d
k, r = divmod(nd, p);
m = min(m, f(k) + r + c, r and f(k + 1) + p - r + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, ... | a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
m = d * n
for p, c in zip(a, b):
k, r = divmod(n, p);
m = min(m, f(k) + r * d + c, r and f(k + 1) + (p - r) * d + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input()... | p02669 |
a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
nd = m = n * d
for p, c in zip(a, b):
p *= d
k, r = divmod(nd, p);
m = min(m, f(k) + r + c, r and f(k + 1) + p - r + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, ... | a = 2, 3, 5
def f(n):
m = memo.get(n)
if m is None:
m = d * n
for p, c in zip(a, b):
k, r = divmod(n, p);
m = min(m, f(k) + r * d + c, r and f(k + 1) + (p - r) * d + c or m)
memo[n] = m
return m
t = int(eval(input()))
for _ in range(t):
n, *b, d = list(map(int, input()... | p02669 |
import sys
divs = [2, 3, 5]
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
costs = [a, b, c]
dp = {}
def dfs(x):
if x in dp:
return dp[x]
# print(x, file=sys.stderr)
if x == 0:
dp[x] = 0
... | divs = [2, 3, 5]
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
costs = [a, b, c]
dp = {0: 0}
def dfs(x):
if x in dp:
return dp[x]
ret = x * d
for cost, div in zip(costs, divs):
lx = x // di... | p02669 |
t = int(eval(input()))
import sys
sys.setrecursionlimit(10 ** 6)
def calc(x):
if x in dp:
return dp[x]
divs = [5, 3, 2]
costs = [c, b, a]
res = d * x
for div, cost in zip(divs, costs):
dived = x//div
res = min(res, calc(dived) + cost + abs(x-dived*div) * ... | t = int(eval(input()))
def calc(x):
if x not in dp:
divs = [5, 3, 2]
costs = [c, b, a]
values = lambda div, cost: [calc(x // div) + cost + x % div * d, calc((x + div - 1) // div) + cost + (-x) % div * d]
dp[x] = min(x * d, *[value for div, cost in zip(divs, costs) for value i... | p02669 |
# coding: utf-8
from collections import defaultdict
def solve(*args: str) -> str:
t = int(args[0])
NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]
ret = []
for n, a, b, c, d in NABCD:
ABC = ((2, a), (3, b), (5, c))
dp = defaultdict(lambda: n*d)
stack... | # coding: utf-8
from collections import defaultdict
def solve(*args: str) -> str:
t = int(args[0])
NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]
ret = []
for n, a, b, c, d in NABCD:
ABC = ((2, a), (3, b), (5, c))
dp = defaultdict(lambda: n*d)
stack... | p02669 |
# coding: utf-8
from collections import defaultdict
def solve(*args: str) -> str:
t = int(args[0])
NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]
ret = []
for n, a, b, c, d in NABCD:
ABC = ((2, a), (3, b), (5, c))
dp = defaultdict(lambda: n*d)
stack... | # coding: utf-8
from collections import defaultdict
def solve(*args: str) -> str:
t = int(args[0])
NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]
ret = []
for n, a, b, c, d in NABCD:
ABC = ((2, a), (3, b), (5, c))
dp = defaultdict(lambda: n*d)
stack... | p02669 |
import sys
sys.setrecursionlimit(10**8)
T=int(eval(input()))
def solve(N):
if N==0:
return 0
if N==1:
return D
if N in dic:
return dic[N]
tmp=N*D
if N%2==0:
tmp=min(tmp,solve(N//2)+A)
else:
tmp=min(tmp,solve((N-1)//2)+A+D,solve((N+1)//2... | T=int(eval(input()))
from functools import lru_cache
for _ in range(T):
N,A,B,C,D=list(map(int,input().split()))
@lru_cache(maxsize=None)
def solve(N):
if N==0:
return 0
if N==1:
return D
tmp=N*D
if N%2==0:
tmp=min(tmp,s... | p02669 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect ... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect ... | p02669 |
import sys
sys.setrecursionlimit(10**6)
T = int(eval(input()))
for _ in range(T):
n, a, b, c, d = list(map(int, input().split()))
# ans = 10**20
# for i in range(61):
# for j in range(39):
# if pow(2, i) * pow(3, j) > 10**19:
# continue
# for k in range(27):
# if pow(2, i) * pow(3, j) * pow(5, k)... | import sys
from heapq import heappush, heappop
T = int(eval(input()))
for _ in range(T):
n, a, b, c, d = list(map(int, input().split()))
dp = dict()
dp[n] = 0
q = [(0, n)]
def add(x, v):
if x not in dp:
dp[x] = v
return True
elif dp[x] > v:
dp[x] = v
return True
else:
return Fa... | p02669 |
def f(k):
if k==1:return d
if k==0:return 0
if k in m:return m[k]
s=k*d
s=min(s,f(k//2)+a+k%2*d,f((k+1)//2)+a+-k%2*d,f(k//3)+b+k%3*d,f((k+2)//3)+b+-k%3*d,f(k//5)+c+k%5*d,f((k+4)//5)+c+-k%5*d)
m[k]=s
return s
for _ in range(int(eval(input()))):
m={}
n,a,b,c,d=list(map(int,in... | def f(k):
if k==1:return d
if k==0:return 0
if k in m:return m[k]
s=min(k*d,f(k//2)+a+k%2*d,f((k+1)//2)+a+-k%2*d,f(k//3)+b+k%3*d,f((k+2)//3)+b+-k%3*d,f(k//5)+c+k%5*d,f((k+4)//5)+c+-k%5*d)
m[k]=s
return s
for _ in range(int(eval(input()))):
m={}
n,a,b,c,d=list(map(int,input().spl... | p02669 |
def f(k):
if k==1:return d
if k==0:return 0
if k in m:return m[k]
s=min(k*d,f(k//2)+a+k%2*d,f((k+1)//2)+a+-k%2*d,f(k//3)+b+k%3*d,f((k+2)//3)+b+-k%3*d,f(k//5)+c+k%5*d,f((k+4)//5)+c+-k%5*d)
m[k]=s
return s
for _ in range(int(eval(input()))):
m={}
n,a,b,c,d=list(map(int,input().spl... | from functools import lru_cache
for _ in range(int(eval(input()))):
n,a,b,c,d=list(map(int,input().split()))
@lru_cache(None)
def f(k):
if k==0:return 0
if k==1:return d
return min(k*d,f(k//5)+c+k%5*d,f(k//3)+b+k%3*d,f(k//2)+a+k%2*d,f((k+4)//5)+c+-k%5*d,f((k+2)//3)+b+-k%3*d,f(... | p02669 |
def dfs(x):
m=x//2
if m not in dp or dp[m]>dp[x]+abs(2*m-x)*d+a:
dp[m]=dp[x]+abs(2*m-x)*d+a
dfs(m)
m=0--x//2
if m not in dp or dp[m]>dp[x]+abs(2*m-x)*d+a:
dp[m]=dp[x]+abs(2*m-x)*d+a
dfs(m)
m=x//3
if m not in dp or dp[m]>dp[x]+abs(3*m-x)*d+b:
dp[m]=dp[x]+abs(3*m-x)*d+b
dfs... | import sys
input=sys.stdin.readline
def main():
def dfs(x):
m=x//2
if m not in dp or dp[m]>dp[x]+abs(2*m-x)*d+a:
dp[m]=dp[x]+abs(2*m-x)*d+a
dfs(m)
m=0--x//2
if m not in dp or dp[m]>dp[x]+abs(2*m-x)*d+a:
dp[m]=dp[x]+abs(2*m-x)*d+a
dfs(m)
m=x//3
if m not in d... | p02669 |
#from collections import defaultdict
#from pprint import pprint
#from collections import deque
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
#import numpy as np
#import math
# = map(int,input().split())
# = list(map(int,in... |
#from collections import defaultdict
#from pprint import pprint
#from collections import deque
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
#import numpy as np
#import math
# = map(int,input().split())
# = list(map(int,in... | p02669 |
DP = {}
def solve(n, a, b, c, d):
if n <= 0:
return 0
if n == 1:
return d
if n in DP:
return DP[n]
ans = float('inf')
for i in range(-4, 5):
num = n + i
trash = abs(i)*d
if num < 0:
continue
if num%5 == 0 and num //... | DP = {}
def solve(n, a, b, c, d):
if n <= 0:
return 0
if n == 1:
return d
if n in DP:
return DP[n]
ans = float('inf')
for i in range(-3, 4):
num = n + i
trash = abs(i)*d
if num < 0:
continue
if num%5 == 0 and num //... | p02669 |
# -*- coding: utf-8 -*-
# import bisect
# import heapq
# import math
# import random
# from collections import Counter, defaultdict, deque
# from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache
# from itertools import combinations, combinations_with_replacement, product, per... | # -*- coding: utf-8 -*-
from functools import lru_cache
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return... | p02669 |
# -*- coding: utf-8 -*-
from functools import lru_cache
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return... | # -*- coding: utf-8 -*-
from functools import lru_cache
import sys
# sys.setrecursionlimit(10)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return li... | p02669 |
#!python3
iim = lambda: map(int, input().rstrip().split())
from heapq import heappush, heappop
def calc(N, A, B, C, D):
abc = [(3, B), (5, C), (2, A)]
ans = N * D
ans2 = min(2*D, D+A)
dq = []
heappush(dq, (0, N))
seen = set()
while dq:
cost, rest = heappop(dq)
... | #!python3
iim = lambda: map(int, input().rstrip().split())
from heapq import heappush, heappop
def calc(N, A, B, C, D):
abc = [(2, A), (3, B), (5, C),]
ans = N * D
ans2 = min(2*D, D+A)
dq = []
heappush(dq, (0, N))
seen = set()
while dq:
cost, rest = heappop(dq)
... | p02669 |
#!python3
iim = lambda: map(int, input().rstrip().split())
from heapq import heappush, heappop
def calc(N, A, B, C, D):
abc = [(2, A), (3, B), (5, C),]
ans = N * D
ans2 = min(2*D, D+A)
dq = []
heappush(dq, (0, N))
seen = set()
while dq:
cost, rest = heappop(dq)
... | #!python3
iim = lambda: map(int, input().rstrip().split())
from heapq import heappush, heappop
def calc(N, A, B, C, D):
abc = list(map(lambda x: (x[0], x[1], x[0]*x[1]/((x[0]-1)*D)) ,[(2, A), (3, B), (5, C),]))
ans = N * D
ans2 = min(2*D, D+A)
dq = []
heappush(dq, (0, N))
seen... | p02669 |
import sys
sys.setrecursionlimit(10**7)
def dfs(x):
if x == 0:
return 0
if x == 1:
return d
if x in dic:
return dic[x]
l2 = x//2
r2 = (x+1)//2
l3 = x//3
r3 = (x+2)//3
l5 = x//5
r5 = (x+4)//5
count = min(x*d,10**18)
count = min(count,abs... | import sys
from functools import lru_cache
sys.setrecursionlimit(10**7)
def solve(x,a,b,c,d):
@lru_cache(None)
def dfs(x):
if x == 0:
return 0
if x == 1:
return d
l2 = x//2
r2 = (x+1)//2
l3 = x//3
r3 = (x+2)//3
l5 = ... | p02669 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
T = int(eval(input()))
INF = 10**18
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
@lru_cache(maxsize=None)
def search(now):
if now == 0:
return 0
ret = INF
for... | from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
T = int(eval(input()))
INF = 10**18
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
@lru_cache(maxsize=None)
def search(now):
if now == 0:
return 0
ret = now * D
... | p02669 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
T = int(eval(input()))
INF = 10**18
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
@lru_cache(maxsize=None)
def search(now):
if now == 0:
return 0
ret = now * D
... | from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
T = int(eval(input()))
INF = 10**18
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
DC = tuple(zip((2, 3, 5), (A, B, C)))
@lru_cache(maxsize=None)
def search(now):
if now == 0:
... | p02669 |
import sys
sys.setrecursionlimit(10**9)
def solve(n, a, b, c, d):
return memo[0]
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
memo = {}
def dfs(m, cost):
if m not in memo or memo[m] > cost:
memo[m] = cost
... | import sys
sys.setrecursionlimit(10**9)
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
memo = {}
def dfs(m, cost):
if m not in memo or memo[m] > cost:
memo[m] = cost
if m > 0:
dfs(m // 2, cost + (m % 2... | p02669 |
import sys
sys.setrecursionlimit(10**9)
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
memo = {0: n * d}
def dfs(m, cost):
if m not in memo or memo[m] > cost:
memo[m] = cost
memo[0] = min(memo[0], cost + m * d)
... | # import sys
# sys.setrecursionlimit(10**9)
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
memo = {0: 0, 1: d}
def dfs(m):
if m in memo:
return memo[m]
else:
res1 = m * d
res2 = (m % 2) * d + a + ... | p02669 |
# https://atcoder.jp/contests/agc044/submissions/13542551
def main():
from heapq import heappush, heappop
T = int(eval(input()))
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
h = [(0, N)] # cost,value
checked = set()
ans = N * D + 1
... | # https://atcoder.jp/contests/agc044/submissions/13542551
def main():
from heapq import heappush, heappop
T = int(eval(input()))
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
h = [(0, N)] # cost,value
checked = set()
ans = N * D + 1
... | p02669 |
# heapq -> deque
def main():
from collections import defaultdict, deque
inf = 10 ** 27
T = int(eval(input()))
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
dq = deque()
dq.append((0, N)) # cost,value
checked = defaultdict(lambda: inf... | # heapq -> deque
def main():
from collections import defaultdict, deque
T = int(eval(input()))
for _ in range(T):
N, A, B, C, D = list(map(int, input().split()))
inf = N * D + 1
dq = deque()
dq.append((0, N)) # cost,value
checked = defaultdict(lamb... | p02669 |
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1)... | import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1)... | p02669 |
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1)... | import sys
from collections import defaultdict
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)]... | p02669 |
# coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# Nから0にする
T = ir()
@lru_cache(None)
def F(x, A, B, C, D):
if x == 1:
return D
elif x <=... | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# Nから0にする
T = ir()
@lru_cache(None)
def F(x, A, B, C, D):
if x == 1:
return D
elif x <=... | p02669 |
import math
from functools import lru_cache
T = int(eval(input()))
class Resolver:
def __init__(self, a, b, c, d):
self.a = a
self.b = b
self.c = c
self.d = d
@lru_cache(maxsize=None)
def resolve(self, n):
if n == 0:
return 0
e... | from functools import lru_cache
T = int(eval(input()))
def resolver(a, b, c, d):
@lru_cache(maxsize=None)
def _resolver(n):
if n == 0:
return 0
elif n == 1:
return d
else:
div5f = n // 5
div5c = (n + 4) // 5
di... | p02669 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
t = int(eval(input()))
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
memo = {0: 0, 1: d}
def cost(N):
if N in memo:
return memo[N]
ans = N * d
ks = [2, 3, 5]
abc = ... | #!/usr/bin/env python3
N = 0
A = 0
B = 0
C = 0
D = 0
cost_result = {} # ある数に達するために必要なコインの枚数
each_cost = {} # 与えられたコスト
def cost(target):
"""
Args:
target: 目標とする数字
Returns:
result: その数字に達するまでに必要なコスト
"""
if target in cost_result:
return cost_result[target]
... | p02669 |
import sys
input = sys.stdin.readline
from functools import lru_cache
T=int(eval(input()))
for tests in range(T):
N,A,B,C,D=list(map(int,input().split()))
DP=[N*D]*(10**5)
DP[0]=0
for i in range(10**5):
for k in range(i-10,i+10):
if 0<=k<10**5 and DP[k]>DP[i]+abs(i-k)... | import sys
input = sys.stdin.readline
from functools import lru_cache
T=int(eval(input()))
for tests in range(T):
N,A,B,C,D=list(map(int,input().split()))
@lru_cache(maxsize=None)
def calc(x):
if x==1:
return D
ANS=x*D
two=x//2*2
if two//2<x:
... | p02669 |
import sys
sys.setrecursionlimit(10**6)
# def dfs(t,ans):
# global a,b,c,d fin
# if t % 5 == 0:
# if c > 4*t//5 * d:
# fin = min(fin,ans+4*t//5*d)
# else:
# dfs(t//5,ans+c)
# if t % 3 == 0:
# if b > 2*t//3 * d:
# fin = min(fin,ans+2*... | import sys
sys.setrecursionlimit(10**6)
def solve(t,ans):
global a,b,c,d,fin,al,dic1
if t < 5:
if t==1:
fin = min(fin,ans+d)
elif t == 2:
fin = min(fin,ans+2*d,ans+a+d,)
elif t == 3:
fin = min(fin,ans+3*d,ans+b+d,ans+a+2*d)
else:
... | p02669 |
import sys
sys.setrecursionlimit(10**6)
def solve(t,ans):
global a,b,c,d,fin,al,dic1
if t < 5:
if t==1:
fin = min(fin,ans+d)
elif t == 2:
fin = min(fin,ans+2*d,ans+a+d,)
elif t == 3:
fin = min(fin,ans+3*d,ans+b+d,ans+a+2*d)
else:
... | import sys
sys.setrecursionlimit(10**6)
# def dfs(t,ans):
# global a,b,c,d fin
# if t % 5 == 0:
# if c > 4*t//5 * d:
# fin = min(fin,ans+4*t//5*d)
# else:
# dfs(t//5,ans+c)
# if t % 3 == 0:
# if b > 2*t//3 * d:
# fin = min(fin,ans+2*... | p02669 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10**9)
@lru_cache(None)
def f(n,a,b,c,d):
if n==0:return 0
if n==1:return d
if n==2:return min(d*2,a+d)
if n==3:return min(d*3,d+a+d,b+d)
if n==4:return min(d*4,a+a+d,d+b+d,d+c+d)
if n==5:return min(d*5,d+a+a+d,d+d+b+d,d+a+b+d,c+d)... | from functools import lru_cache
def solve(n,a,b,c,d):
@lru_cache(None)
def rec(cur):
if cur == 0: return 0
if cur == 1: return d
ret = cur * d
p,q = divmod(cur, 2)
if q == 0: ret = min(ret, rec(p) + a)
if q == 1: ret = min(ret, rec(p) + a + d, r... | p02669 |
from heapq import heappop, heappush
T = int(input())
ans = []
for _ in range(T):
N, A, B, C, D = map(int, input().split())
Q = [(0, N)]
# already processed
S = set()
an = D * N
while Q:
cost, num = heappop(Q)
if num in S:
continue
an = min(an,... | from heapq import heappop, heappush
T = int(input())
ans = []
for _ in range(T):
N, A, B, C, D = map(int, input().split())
Q = [(0, N)]
# already processed
S = set()
an = D * N
while Q:
cost, num = heappop(Q)
if num in S:
continue
an = min(an,... | p02669 |
T = int(eval(input()))
while(T > 0):
N, A, B, C, D = list(map(int, input().split()))
dp = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in dp:
return dp[n]
ret = min(
D * n,
D * abs(n... | T = int(eval(input()))
while(T > 0):
N, A, B, C, D = list(map(int, input().split()))
memo = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in memo:
return memo[n]
ret = n * D
if (n % 2 == 0):
... | p02669 |
from collections import deque
from heapq import heapify, heappush as hpush, heappop as hpop
def dijkstra(n, E, i0=0):
h = [[0, i0]]
D = [-1] * n
done = [0] * n
D[i0] = 0
while h:
d, i = hpop(h)
done[i] = 1
for j, w in E[i]:
nd = d + w
... | from functools import lru_cache
def calc(n):
@lru_cache(maxsize=None)
def rec(n):
if n <= 0: return 0
S = [2, 3, 5]
mi = D * n
for i, a in enumerate(S):
for j in range(-a//2, a//2 + 1):
if (n + j) % a == 0 and (n + j) // a < n:
... | p02669 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.