input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
x=int(eval(input()))
if x >= 1200:
print('ARC')
else:
print('ABC') | print(('ABC' if int(eval(input())) < 1200 else 'ARC')) | p03813 |
N, K = list(map(int, input().split()))
list_h = list(map(int, input().split()))
list_h.sort()
list_h.insert(0, 0)
list_h.append(500)
L, R = 0, N + 1
while R - L > 1:
C = (L + R) // 2
if list_h[C] >= K:
R = C
else:
L = C
print((len(list_h[R:-1])))
| N, K = list(map(int, input().split()))
list_h = list(map(int, input().split()))
count = 0
for i in list_h:
if i >= K:
count += 1
print(count)
| p02898 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = 0
for i in range(n):
if h[i]>=k:
ans += 1
print(ans)
| n,k=list(map(int,input().split()))
H=list(map(int,input().split()))
ans=0
for i in range(n):
if H[i]>=k:
ans+=1
print(ans) | p02898 |
n,k=list(map(int,input().split()))
h = list(map(int,input().split()))
ans=0
for i in range(n):
if(h[i] >=k):
ans += 1
print(ans)
| n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
cnt = 0
for i in h:
if i >= k:
cnt+=1
print(cnt) | p02898 |
N, K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
ans = 0
for h in H:
if h >= K:
ans += 1
print(ans)
| A, K = [int(x) for x in input().split()]
print((sum(int(x) >= K for x in input().split())))
| p02898 |
N, K=list(map(int, input().split()))
H = list(map(int, input().split()))
c = 0
for h in H:
if h >=K:
c += 1
print(c) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
print((len([i for i in h if i>=k]))) | p02898 |
_, k = list(map(int, input().split()))
l = list(map(int, input().split()))
print((len(list([h for h in l if h>=k])))) | f=lambda:list(map(int,input().split()))
_,k=f()
print((sum(i>=k for i in f()))) | p02898 |
from collections import deque
n, k = list(map(int, input().split()))
h = deque(list(input().split()))
ans = 0
while len(h) > 0:
if int(h.pop()) >= k:
ans += 1
print(ans) | def main():
N, K = list(map(int, input().split()))
h = list(int(x) for x in input().split())
ans = 0
for i in h:
if i >= K:
ans += 1
print(ans)
if __name__ == '__main__':
main() | p02898 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
print((sum(h[i] >= k for i in range(n))))
| n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = sum(h[i] >= k for i in range(n))
print(ans)
| p02898 |
c=0
a = list(map(int,input().split()))
b=list(map(int,input().split()))
for n in range(a[0]):
if b[n]>=a[1]:
c+=1
print(c) | n,k=list(map(int,input().split()))
h=[int(i) for i in input().split()]
h=[i for i in h if i>=k]
print((len(h))) | p02898 |
def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
ok = [1 if hi >= k else 0 for hi in h]
print((sum(ok)))
if __name__ == "__main__":
resolve()
| def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
oks = [1 for hi in h if hi >= k]
print((len(oks)))
if __name__ == "__main__":
resolve()
| p02898 |
N,K=list(map(int,input().split()))
h=input().split()
S=0
for i in range(N):
if int(h[i]) >= K:
S+=1
print(S)
| n,k=list(map(int,input().split()))
h=input().split()
S=0
for i in range(n):
if int(h[i])>=k:
S+=1
print(S) | p02898 |
n, k = list(map(int, input().split()))
ans = 0
for i in map(int, input().split()): ans+=(i>=k)
print(ans) | n,k=list(map(int,input().split()));print((sum([h>=k for h in map(int,input().split())]))) | p02898 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = 0
for i in h:
if i >= K:
ans = ans + 1
print(ans) | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in A:
if i>=K:
ans = ans + 1
print(ans) | p02898 |
import sys
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
sys.setrecursionlimit(1000000)
mod = 1000000007
# A
def A():
return
# B
def B():
n, k = LI()
h = LI()
ans = 0
for i in h:
if i >= k:
ans += 1
print(ans)
return
# C
def C():
return
# D
def D():
return
# E
def E():
return
# F
def F():
return
# Solve
if __name__ == "__main__":
B()
| import sys
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
sys.setrecursionlimit(1000000)
mod = 1000000007
# A
def A():
return
# B
def B():
n, k = LI()
h = LI()
ans = 0
for i in h:
if i >= k:
ans += 1
print(ans)
return
# C
def C():
return
# D
def D():
return
# E
def E():
return
# F
def F():
return
def resolve():
B()
return
# Solve
if __name__ == "__main__":
B() | p02898 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
l.sort(reverse=True)
count1=0
for i in l:
if(i<k):
break
count1=count1+1
print(count1)
| n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
count1=0
for i in l:
if(i>=k):
count1+=1
print(count1)
| p02898 |
a,b=list(map(int,input().split()))
i=list(map(int,input().split()))
j=[x for x in i if x>=b]
print((len(j))) | a,b=list(map(int,input().split()))
list_a=list(map(int,input().split()))
list_b=[x for x in list_a if x>=b]
print((len(list_b))) | p02898 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
H=list(map(int,input().split()))
ans=0
for h in H:
ans+=(h>=k)
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
print((sum(h>=k for h in map(int,input().split()))))
resolve() | p02898 |
[n, k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def able_ride_jet(const, heights):
""" ジェットコースターに乗れる人の身長のリストを返す関数
"""
return list([x for x in heights if x >= const])
print((len(able_ride_jet(k, h)))) | # -*- coding: utf-8 -*-
def main():
#入力
[n, k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
print((len(able_ride_jet(k, h))))
def able_ride_jet(const, heights):
""" ジェットコースターに乗れる人の身長のリストを返す関数
"""
return list([x for x in heights if x >= const])
if __name__ == '__main__':
main() | p02898 |
n,k = list(map(int,input().split()))
h_list = list(int(i) for i in input().split())
cnt = 0
for i in h_list:
if i >= k:
cnt += 1
print(cnt) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
res = 0
for i in range(n):
if H[i] >= k:
res += 1
print(res)
if __name__ == '__main__':
resolve()
| p02898 |
n , k = list(map(int, input().split()))
h = list(map(int,input().split()))
count = 0
for i in range(n):
if k <= h[i]:
count += 1
print(count) | #別回答
n , k = list(map(int, input().split()))
h = list(map(int,input().split()))
count = 0
for i in h:
#print(i)
if i >= k:
count += 1
print(count) | p02898 |
n,k=list(map(int,input().split()))
l=0
ll=list(map(int,input().split()))
for i in range(n):
if ll[i]>=k:
l+=1
print(l) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0
for h in H:
if h >= K:
count += 1
print(count) | p02898 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
ans = len(list([x for x in h if x>=K]))
print(ans)
| N, K = list(map(int, input().split()))
print((len(list([x for x in input().split() if int(x)>=K]))))
| p02898 |
a,b=list(map(int,input().split()))
height=list(map(int,input().split()))
count=0
for i in range (a):
if int(height[i])>=b:
count+=1
print(count) | a,b=list(map(int,input().split()))
height=list(map(int,input().split()))
count=0
for i in range (a):
if int(height[i])>=b:
count+=1
print((str(count))) | p02898 |
n,k=list(map(int,input().split()))
L=list(map(int,input().split()))
L.sort()
for i in range(n):
if L[i]>=k:
print((n-i))
exit()
print((0)) | n,k=list(map(int,input().split()))
L=list(map(int,input().split()))
print((sum(x>=k for x in L))) | p02898 |
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
print((sum(h>=K for h in H))) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
print((sum(1 for h in H if h>=K))) | p02898 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0
for h in H:
if h >= K:
count += 1
print(count) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0
for h in H:
if h >= K:
count = count+1
print(count) | p02898 |
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
print((sum([0 if i<K else 1 for i in h]))) | N, K = list(map(int, input().split(" ")))
print((sum([0 if int(x)<K else 1 for x in input().split(" ")]))) | p02898 |
n, k = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
ans = 0
for i in h:
if i >= k:
ans += 1
print(ans)
| n, k = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
print((sum(i >= k for i in h)))
| p02898 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
h_=[i for i in h if i >= k]
print((len(h_))) | n, k = list(map(int,input().split()))
H = list(map(int,input().split()))
ans = 0
for h in H:
if h >= k:
ans += 1
print(ans) | p02898 |
N, K = list(map(int,input().split( )))
H = [int(i) for i in input().split( )]
H = sorted(H)
def binary_search(arr, s, e, x):
end=e
start=s
if end >= start:
mid = int(s + (end-start)/2)
if x > arr[mid]:
binary_search(arr, mid+1, end, x)
elif x < arr[mid]:
binary_search(arr, start, mid-1, x)
else:
for i in range(mid-start):
if arr[mid-i-1] < x:
start = mid - i
break
print((len(arr)-start))
else:
print((len(arr)-start))
binary_search(H,0,N-1,K) | N, K = list(map(int,input().split( )))
H = [int(i) for i in input().split( )]
H = sorted(H)
def binary_search(arr, x):
start = 0
end = len(arr)-1
while(end >= start):
mid = int(start + (end-start)/2)
if x > arr[mid]:
start = mid+1
elif x < arr[mid]:
end = mid -1
else:
for i in range(mid-start):
if arr[mid-i-1] < x:
start = mid - i
break
break
return start
print((N - binary_search(H, K))) | p02898 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
h = sorted(h)
line = 0
bool1 = False
for i in range(N):
if h[i] >= K:
line = i
bool1 = True
break
if bool1:
print((N-i))
else:
print((0)) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = 0
for i in h:
if i >= K:
ans += 1
print(ans) | p02898 |
import bisect
N,K =list(map(int,input().split()))
H =sorted(list(map(int,input().split())))
i = bisect.bisect(H,K-1)
print((N-i)) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
counter = 0
for h in H:
if h >= K:
counter += 1
print(counter)
| p02898 |
N, K = list(map(int, input().split()))
print((len(list([x for x in list(map(int, input().split())) if x >= K]))))
| N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
ans = 0
for h in H:
if h >= K: ans += 1
print(ans) | p02898 |
N, K = list(map(int, input().split()))
lst = list(map(int, input().split()))
i = 0
for h_i in lst:
if h_i < K:
continue
else:
i += 1
print(i) | N, K = list(map(int, input().split()))
lst = list(map(int, input().split()))
i = 0
for h_i in lst:
if h_i < K:
continue
i += 1
print(i) | p02898 |
def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
h = list(map(int, input().rstrip('\n').split()))
cnt = 0
for i in range(n):
cnt += 1 if h[i] >= k else 0
print(cnt)
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
h = list(map(int, input().rstrip('\n').split()))
cnt = 0
for i in range(n):
if h[i] >= k:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| p02898 |
def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
h = list(map(int, input().rstrip('\n').split()))
cnt = 0
for i in range(n):
if h[i] >= k:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, k = list(map(int, readline().split()))
h = list(map(int, readline().split()))
cnt = 0
for i in range(n):
if h[i] >= k:
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| p02898 |
N,K = list(map(int,input().split()))
h = [int(i) for i in input().split()]
count =0
for i in range(N):
if h[i] >= K:
count += 1
print(count)
| N,K=list(map(int,input().split()))
h=[int(i) for i in input().split()]
ans =0
for i in range(N):
if h[i] >=K:
ans +=1
print(ans) | p02898 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
print((sum(j >= k for j in h))) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
cnt = 0
for i in h:
if i >= K:
cnt += 1
print(cnt) | p02898 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
cnt = 0
for i in h:
if i >= K:
cnt += 1
print(cnt) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
rst = sum(i >= K for i in h)
print(rst) | p02898 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0
for h in H:
if h >= K:
count += 1
print(count) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
count = 0
for a in h:
if a >= K:
count += 1
print(count) | p02898 |
N, K, *h = list(map(int, open(0).read().split()))
print((sum([1 for i in h if K <= i])))
| N, K, *h = list(map(int, open(0).read().split()))
print((len([1 for i in h if K <= i])))
| p02898 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
res = 0
for i in a:
res += int(i >= k)
print(res) | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
print((sum(i >= k for i in a)))
| p02898 |
n, k = [ int(_) for _ in input().split() ]
h = [ int(_) for _ in input().split() ]
h.sort()
for i in range(len(h)):
if max(h) < k:
ans = 0
break
elif h[i] >= k:
ans = len(h[i:])
break
print(ans) | n, k = [ int(_) for _ in input().split() ]
h = [ int(_) for _ in input().split() ]
h.sort(reverse=True)
flag = True
if h[n-1]>k:
ans = n
flag = False
elif h[0] < k:
ans = 0
flag = False
#k==max(h)とk==min(h)と合致する場合の分岐がなく、ans=0になっていた
elif h[n-1]==k:
ans = n
elif h[0]==k:
ans = h.count(h[0])
if flag == True:
for i in range(0,n):
if h[i] < k:
ans = len(h[0:i])
break
print(ans) | p02898 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
count = 0
for i in h:
if i >= k:
count += 1
print(count) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
print((len([i for i in h if i >= k]))) | p02898 |
n,k = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
print((len([i for i in l if i>=k]))) | n,m = list(map(int,input().split()))
l = [ i for i in input().split() if int(i)>=m]
print((len(l))) | p02898 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))[::-1]
ans = 0
for i in range(n) :
if (h[i] >= k) :
ans += 1
print(ans)
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
ans = 0
for i in range(n) :
if (h[i] >= k) :
ans += 1
print(ans)
| p02898 |
def main():
n, k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
count = 0
for i in range(n):
if h[i] >= k:
count += 1
print(count)
if __name__ == '__main__':
main()
| def main():
n,k = list(map(int,input().split()))
H = list(map(int,input().split()))
count = 0
for h in H:
if h >= k:
count += 1
print(count)
if __name__ == '__main__':
main()
| p02898 |
N,K=list(map(int, input().split()))
height=[int(x) for x in input().split()]
count=0
for h in height:
if h>=K:
count+=1
print(count) | n,k=list(map(int,input().split()))
h=[int(x) for x in input().split()]
ans=0
for hh in h:
if hh>=k:
ans+=1
print(ans)
| p02898 |
import sys
def primegen():
l = [2]
while True:
yield max(l)
n = max(l)
while True:
n += 1
flag = 1
for i in l:
if n % i == 0:
flag = 0
break
if flag:
l.append(n)
break
for line in sys.stdin:
n = int(line)
seq = primegen()
i1 = 0
i2 = 0
while i2 < n:
i1 = i2
i2 = seq.__next__()
if i2 == n:
i2 = seq.__next__()
print((str(i1) + " " + str(i2))) | import sys
def furui(n):
l = [1 for i in range(n+1)]
l[0] = 0
l[1] = 0
for i in range(2,n+1):
if l[i] == 1:
for j in range(2,n//i+1):
l[i*j] = 0
l2 = []
for i in range (len(l)):
if l[i] == 1:
l2.append(i)
return l2
for line in sys.stdin:
n = int(line)
l = furui(n)
if max(l) == n:
i1 = l[len(l)-2]
else:
i1 = max(l)
i2 = n
while True:
i2 += 1
flag = 1
for i in l:
if i2 % i == 0:
flag = 0
break
if flag:
break
print((str(i1) + " " + str(i2))) | p00044 |
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
ans=0
lis=[I() for i in range(n)]
ind =[0 for i in range(n)]
for i in range(n):
if lis[i]==0:
ind[i]=-1
ans+=lis[i]//2
lis[i]=lis[i]%2
points=[]
for i in range(n):
if lis[i]==1:
points.append(i)
for i in range(len(points)-1):
x=points[i]
y=points[i+1]
count=0
#print(y)
#print(x)
for j in range(x,y+1):
if ind[j]==0:
count+=1
if count==y-x+1:
points[i+1]=-1
ans+=1
print(ans)
| #float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
ans=0
lis=[I() for i in range(n)]
ind =[0 for i in range(n)]
for i in range(n):
if lis[i]==0:
ind[i]=-1
ans+=lis[i]//2
lis[i]=lis[i]%2
points=[]
for i in range(n):
if lis[i]==1:
points.append(i)
#print(points)
#for i in range(len(points)-1):
z=0
while z<len(points)-1:
x=points[z]
y=points[z+1]
count=0
#print(y)
#print(x)
for j in range(x,y+1):
if ind[j]==0:
count+=1
if count==y-x+1:
z+=1
ans+=1
z+=1
print(ans)
| p04020 |
N = int(eval(input()))
ans = 0
tmp = 0
for _ in range(N):
a = int(eval(input()))
if a != 0:
tmp += a
else:
ans += tmp // 2
tmp = 0
ans += tmp//2
print(ans) | N = int(eval(input()))
tmp = 0
ans = 0
for _ in range(N):
a = int(eval(input()))
if a != 0:
tmp += a
else:
ans += tmp // 2
tmp = 0
ans += tmp // 2
print(ans)
| p04020 |
from collections import OrderedDict, deque
N = int(eval(input()))
A = OrderedDict({i: int(eval(input())) for i in range(1, N+1)})
ans = 0
for key in range(1, N):
ans += A[key] // 2
A[key] %= 2
if (A[key] == 1) & (A[key+1] > 0):
ans += 1
A[key+1] -= 1
print((ans + A[N]//2)) | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
ans = 0
for i in range(N-1):
ans += A[i] // 2
if A[i] % 2 and A[i+1]:
ans += 1
A[i+1] -= 1
print((ans + A[-1]//2)) | p04020 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
carry = 0
ans = 0
for i in range(N):
x = int(eval(input()))
if carry and x > 0:
ans += 1 # carry を優先して処理
d, m = divmod(x - 1, 2)
ans += d
carry = m
else:
d, m = divmod(x, 2)
ans += d
carry = m
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
# 解説AC
def main():
N = int(eval(input()))
ans = 0
x = 0
for i in range(N):
a = int(eval(input()))
if a == 0:
ans += x//2
x = 0
else:
x += a
ans += x//2
print(ans)
if __name__ == '__main__':
main()
| p04020 |
# AGC003B - Simplified mahjong
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, [eval(input()) for _ in range(N)])) + [0]
ans = 0
for i in range(N): # make pairs greedily
ans += A[i] // 2 # pairs with same cards
if A[i] % 2 and A[i + 1]: # pairs with a neighbor
ans += 1
A[i + 1] -= 1
print(ans)
if __name__ == "__main__":
main() | # AGC003B - Simplified mahjong
import sys
input = sys.stdin.readline
def main():
# split in subsequences when 0 appears -> sum up cur // 2
N = int(eval(input()))
A = list(map(int, [eval(input()) for _ in range(N)])) + [0]
ans, cur = 0, 0
for i in A:
if i:
cur += i
else:
ans += cur // 2
cur = 0
print(ans)
if __name__ == "__main__":
main() | p04020 |
from sys import stdin
def main():
N = int(stdin.readline().strip())
value = [int(x) for x in range(N)]
i,card = 0,[-1 for x in range(N)]
while i < N:
x = int(stdin.readline().strip())
card[i] = x
i+=1
i,ans = 0,0
while i < N:
if card[i]>=2:
ans+=1
card[i]-=2
elif i+1 < N:
if card[i] == 1 and card[i+1]>=1:
ans+=1
card[i]-=1
card[i+1]-=1
else:
i+=1
else:
i+=1
print(ans)
main() | from sys import stdin
def main():
N = int(stdin.readline().strip())
i,card = 0,[-1 for x in range(N)]
while i < N:
x = int(stdin.readline().strip())
card[i] = x
i+=1
i,ans = 0,0
while i < N:
if card[i]%2==0:
ans+= card[i]//2
card[i] = 0
else:
ans+=(card[i]-1)//2
card[i] = 1
if i+1 < N and card[i+1] >=1:
ans+=1
card[i],card[i+1] = 0, card[i+1]-1
i+=1
print(ans)
main() | p04020 |
from sys import stdin
def main():
N = int(stdin.readline().strip())
i,card = 0,[-1 for x in range(N)]
while i < N:
x = int(stdin.readline().strip())
card[i] = x
i+=1
i,ans = 0,0
while i < N:
if card[i]%2==0:
ans+= card[i]//2
card[i] = 0
else:
ans+=(card[i]-1)//2
card[i] = 1
if i+1 < N and card[i+1] >=1:
ans+=1
card[i],card[i+1] = 0, card[i+1]-1
i+=1
print(ans)
main() | from sys import stdin
def main():
nums = int(stdin.readline())
l = []
actual = int(stdin.readline())
total = 0
for x in range(nums-1):
total += actual//2
temp = int(stdin.readline())
if temp != 0:
actual = actual%2 + temp
else:
actual = temp
print((total+actual//2))
main()
| p04020 |
#y,m,d=map(int,input().split())
#a,b=map(int,input().split())
n=int(eval(input()))
#a=int(input())
#b=int(input())
#s=list(input())
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#b=list(map(int,input().split()))
#b=list(map(int,input().split()))
#a=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#a=[list(input().split())for _ in range(n)]
a=[int(eval(input()))for _ in range(n)]
ans=0
total=0
judge=False
for i in range(n):
total+=a[i]
if a[i]==0:
ans+=total//2
total=0
judge=True
if judge:
print((ans+total//2))
else:
print((sum(a)//2))
| #y,m,d=map(int,input().split())
#a,b=map(int,input().split())
n=int(eval(input()))
#a=int(input())
#b=int(input())
#s=list(input())
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#b=list(map(int,input().split()))
#b=list(map(int,input().split()))
#a=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#a=[list(input().split())for _ in range(n)]
a=[int(eval(input()))for _ in range(n)]
ans=0
total=0
noncardin_judge=False#カードが0枚のものがないかを記録する
for i in range(n):
total+=a[i]
if a[i]==0:
ans+=total//2
total=0
noncardin_judge=True
if noncardin_judge:
print((ans+total//2))
else:
print((sum(a)//2))
| p04020 |
# 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない?
n = int(eval(input()))
nums = [int(eval(input())) for _ in range(n)]
ans = 0
for idx, m in enumerate(nums):
if m > 0:
ans += m // 2
# m -= (m // 2) * 2
m = m & 1
if m == 1 and idx != n-1 and nums[idx+1] >= 1:
ans += 1
m -= 1
nums[idx+1] -= 1
print(ans)
| # 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない?
# 貪欲で取っていくのを考えると、非ゼロの区間が連続する場合、その連続に対して下からペアを作って、最後に0か1だけ残ることがわかり、
# 単純に書ける。こんなふうに。
n = int(eval(input()))
nums = [int(eval(input())) for _ in range(n)]
ans = 0
temp = 0
for m in nums:
if m == 0:
ans += temp // 2
temp = 0
else:
temp += m
ans += temp // 2
print(ans)
| p04020 |
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
ans = 0
for i in range(N):
tmp = A[i]
while tmp > 1:
ans += 1
tmp -= 2
if i < N - 1 and tmp == 1 and A[i + 1] > 0:
ans += 1
A[i + 1] -= 1
print(ans) | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
ans = 0
for i in range(N):
tmp = A[i]
ans += (tmp // 2)
if i < N -1 and tmp % 2 and A[i + 1] > 0:
ans += 1
A[i + 1] -= 1
print(ans) | p04020 |
import sys
N = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for _ in range(N)]
ans = 0
for i in range(1, N):
ans += (A[i - 1] + A[i]) // 2
if A[i]:
A[i] = (A[i - 1] + A[i]) % 2
print((A[0] // 2 if N == 1 else ans)) | import sys
N = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for _ in range(N)]
ans = 0
for i in range(1, N):
ans += (A[i - 1] + A[i]) >> 1
if A[i]:
A[i] = (A[i - 1] + A[i]) & 1
print((A[0] >> 1 if N == 1 else ans)) | p04020 |
import sys
N = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for _ in range(N)]
ans = 0
for i in range(1, N):
ans += (A[i - 1] + A[i]) >> 1
if A[i]:
A[i] = (A[i - 1] + A[i]) & 1
print((A[0] >> 1 if N == 1 else ans)) | from sys import stdin
def main():
N = int(stdin.readline())
ans = c = 0
for _ in range(N):
a = int(stdin.readline())
if a:
c += a
else:
ans += c >> 1
c = 0
print((ans + (c >> 1)))
if __name__ == "__main__":
main() | p04020 |
n = int(eval(input()))
A = list(int(eval(input())) for _ in range(n))
ans = 0
for i in range(n):
tmp = A[i]
ans += (tmp//2)
if i < n-1 and tmp %2 and A[i+1] > 0:
ans += 1
A[i+1] -= 1
print(ans) | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
ans = 0
for i in range(n-1):
x,y = A[i], A[i+1]
ans += x//2
if x%2!=0 and y > 0:
ans += 1
A[i+1] -= 1
ans += A[-1]//2
print(ans) | p04020 |
n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
ans = A[0] // 2
A[0] %= 2
for i in range(1, n):
ans += (A[i-1] + A[i]) // 2
if A[i] == 0:
pass
elif A[i-1] == 1:
if A[i] % 2 == 0:
A[i] = 1
else:
A[i] = 0
else:
A[i] %= 2
print(ans) | n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
ans = 0
s = 0
for a in A:
s += a
if a == 0:
ans += s//2
s = 0
print((ans + s//2)) | p04020 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)] + [0]
ans = 0
for i in range(N):
if a[i] != 0:
add, mod = divmod(a[i], 2)
ans += add
if a[i + 1] != 0:
a[i + 1] += mod
print(ans) | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
ans = 0
for i in range(N):
cnt, mod = divmod(a[i], 2)
ans += cnt
if i < N - 1 and a[i + 1] != 0:
a[i + 1] += mod
print(ans) | p04020 |
n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
prev_mod = 0
ans = 0
for a in A:
if prev_mod == 1 and a > 0:
a += 1
prev_mod = 0
ans += a // 2
mod = a % 2
if mod+prev_mod == 2:
ans += 1
mod = 0
prev_mod = mod
print(ans) | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
mod = 0
ans = 0
for a in A:
if mod == 1 and a > 0:
a += 1
mod = 0
ans += a // 2
mod = a % 2
print(ans) | p04020 |
#貪欲の手順がおかしかった
#同一ペアを組むのはそれ以下の数を除いた後
#editorial参照、さらに単純に0で区切ってn//2になる
n = int(eval(input()))
a = []
for _ in range(n):
a_ = int(eval(input()))
a.append(a_)
#print(a)
ans = 0
"""
for i in range(n-1):
if a[i]&1:
ans += a[i]//2
a[i] = 1
elif a[i] ==0:
pass
else:
ans += a[i]//2-1
a[i] = 2
print(a)
print(ans)
"""
for i in range(n-1):
ans += a[i]//2
a[i] -= (a[i]//2)*2
ad = min(a[i],a[i+1])
ans += ad
a[i+1] -= ad
##この時点で最後まだ残っている
ans += a[n-1]//2
print(ans) | #旧版のa[n-1]分を訂正してテスト
n = int(eval(input()))
a = []
for _ in range(n):
a_ = int(eval(input()))
a.append(a_)
ans = 0
for i in range(n-1):
if a[i]&1:
ans += a[i]//2
a[i] = 1
elif a[i] ==0:
pass
else:
ans += a[i]//2-1
a[i] = 2
for i in range(n-1):
if a[i] == 2:
ans += 1
a[i] = 0
else:
ad = min(a[i],a[i+1])
ans += ad
a[i+1] -= ad
ans += a[n-1]//2
print(ans)
| p04020 |
N = int(eval(input()))
A = []
a = []
for i in range(N):
x = int(eval(input()))
if x==0:
b = a[:]
A.append(b)
a = []
else:
a.append(x)
A.append(a)
cnt = 0
for a in A:
c = sum(a)
cnt += c//2
print(cnt) | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
cnt = 0
for i in range(N):
if A[i]%2==1:
cnt += A[i]//2
A[i] = 1
else:
a = A[i]//2
if a>0:
cnt += a-1
A[i] = 2
for i in range(1,N):
if A[i-1]!=1:
cnt += A[i-1]//2+A[i]//2
A[i-1]=0
A[i]=A[i]%2
elif A[i-1]==1 and A[i]>=1:
cnt += 1
A[i-1]=0
A[i] -= 1
if N==1:
cnt = A[0]//2
print(cnt) | p04020 |
n = int(eval(input()))
a = []
for i in range(n):
ai = int(eval(input()))
a.append(ai)
cnt = 0
i = 0
while True:
if a[i] >= 2:
cnt += 1
a[i] -= 2
elif a[i] == 1:
if i + 1 >= n:
break
if a[i + 1] > 0:
cnt += 1
a[i] -= 1
a[i + 1] -= 1
else:
i += 1
else:
i += 1
print(cnt) | #B
n = int(eval(input()))
a = []
for i in range(n):
ai = int(eval(input()))
a.append(ai)
cnt = 0
i = 0
while i < n:
if a[i] >= 2:
pairs = a[i] // 2
cnt += pairs
a[i] -= (pairs * 2)
elif a[i] == 1:
if i + 1 >= n:
break
if a[i + 1] > 0:
cnt += 1
a[i] -= 1
a[i + 1] -= 1
else:
i += 1
else:
i += 1
print(cnt) | p04020 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
ans = 0
prev = 0
for i in range(N):
if prev == 1 and A[i] > 0:
A[i] -= 1
ans += 1
q, mod = divmod(A[i], 2)
ans += q
prev = mod
print(ans) | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n = II()
A = [II() for _ in range(n)]
res = 0
mod = 0
for a in A:
if not a:
mod = 0
continue
q, mod = divmod(a + mod, 2)
res += q
return res
print((main()))
| p04020 |
def slove():
import sys
input = sys.stdin.readline
N = int(input().rstrip('\n'))
A = [int(input().rstrip('\n')) for _ in range(N)]
t = 0
cnt = 0
for a in A:
t += a
if a == 0:
cnt += (t // 2)
t = 0
cnt += (t // 2)
print(cnt)
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [int(input().rstrip('\n')) for _ in range(n)]
cnt = 0
t = 0
for v in a:
if v == 0:
cnt += (t // 2)
t = 0
else:
t += v
cnt += (t // 2)
print(cnt)
if __name__ == '__main__':
slove()
| p04020 |
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
ans = rem = 0
for a in A:
if a == 0:
rem = 0
continue
a += rem
ans += a//2
rem = a%2
print(ans) | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
rem = 0
ans = 0
for a in A:
ans += (rem+a)//2
rem = 0 if a==0 else (rem+a)%2
print(ans) | p04020 |
from collections import defaultdict
def main():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)] + [0]
ans = 0
for i in range(N):
ans += A[i] // 2
if A[i] % 2 == 1:
if A[i+1] >= 1:
ans += 1
A[i+1] -= 1
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
A = list(int(eval(input())) for _ in range(N))
cnt = 0
for i in range(N):
if i == N-1:
cnt += A[i] // 2
break
cnt += A[i] // 2
mod = A[i] % 2
if A[i+1] >= mod:
cnt += mod
A[i+1] -= mod
print(cnt)
if __name__ == "__main__":
main() | p04020 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
ans = 0
for i in range(N-1):
d, m = divmod(A[i], 2)
if m and A[i+1]>0:
d += 1
A[i+1] -= 1
ans += d
ans += A[-1]//2
print(ans) | def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)] + [0]
ans = 0
for k in range(N):
c = C[k]
ans += c//2
if c%2 and C[k+1]:
ans += 1
C[k+1] -= 1
print(ans) | p04020 |
N = int(eval(input()))
ans = 0
B = 0
for i in range(N):
A = int(eval(input()))
C = A+B
ans += C//2
if B == 1 and C == 1:
B = 0
continue
B = C % 2
print(ans)
| N = int(eval(input()))
A = int(eval(input()))
ans = A//2
amari = A % 2
for _ in range(N-1):
A = int(eval(input()))
ans += (amari+A)//2
if A == 0:
amari = 0
else:
amari = (amari+A) % 2
print(ans)
| p04020 |
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
res = 0
for i in range(n):
res += a[i] // 2
a[i] %= 2
if i!=n-1:
if a[i] and a[i+1]:
res += 1
a[i] -= 1
a[i+1] -= 1
print(res)
| n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.append(0)
res = 0
for i in range(n):
# a[i] と a[i+1]
res += a[i] // 2
a[i] %= 2
if a[i]==1 and a[i+1]!=0:
res += 1
a[i] -= 1
a[i+1] -= 1
print(res)
| p04020 |
N=int(eval(input()))
pre=int(eval(input()))
ans=pre//2
pre=pre&1
for i in range(2,N+1):
Ai=int(eval(input()))
if pre and Ai>=1:
ans+=1
Ai-=1
ans+=Ai//2
pre=Ai&1
print(ans) | N=int(eval(input()))
ans=0
s=0
for i in range(1,N+1):
Ai=int(eval(input()))
if Ai==0:
ans+=s//2
s=0
else:
s+=Ai
ans+=s//2
print(ans) | p04020 |
n=int(eval(input()))
a=[int(eval(input())) for _ in range(n)]+[0]
ans=0
cnt=0
for aa in a:
if aa==0:
ans+=cnt//2
cnt=0
else:
cnt+=aa
print(ans) | n=int(eval(input()))
cnt=0
ans=0
for _ in range(n):
a=int(eval(input()))
if a>0:
cnt+=a
else:
ans+=cnt//2
cnt=0
print((ans+cnt//2)) | p04020 |
N, *A = list(map(int, open(0).read().split()))
ans = 0
for i in range(N):
q, r = divmod(A[i], 2)
ans += q
if r == 0 or i == N - 1:
continue
elif A[i + 1] != 0:
A[i + 1] += 1
print(ans)
| N, *A = list(map(int, open(0).read().split()))
r = 0
ans = 0
for a in A:
if a == 0:
r = 0
continue
q, r = divmod(a + r, 2)
ans += q
print(ans)
| p04020 |
n = int(eval(input()))
a = [0]
for _ in range(n):
a.append(int(eval(input())))
ans = 0
for i in range(n):
# (x,x)のペア
ans += a[i] // 2
a[i] -= a[i] // 2 * 2
# (x,x+1)のペア
ans += min(a[i], a[i + 1])
a[i + 1] -= min(a[i], a[i + 1])
else: # 最後にa[-1]でできるだけペアを作る
ans += a[-1] // 2
print(ans)
| import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)] + [0]
ans = 0
for i in range(N):
# できるだけ左でペアを作る
Lpair = A[i] // 2
ans += Lpair
A[i] -= 2 * Lpair
if A[i] > 0 and A[i + 1] > 0:
ans += 1
A[i] -= 1
A[i + 1] -= 1
print(ans)
| p04020 |
def gcd(a,b):
return gcd(b,a%b) if b else a
def merge(a,us,vs):
i,j,res=0,0,[]
while i<len(us) and j<len(vs):
if a[us[i]]>=a[vs[j]]:
res.append(us[i])
i+=1
else:
res.append(vs[j])
j+=1
return res+us[i:]+vs[j:]
def dfs(g,a,u,vis):
vis[u]=True
res=[]
for v in g[u]:
if not vis[v]:
res=merge(a,res,dfs(g,a,v,vis))
return [u]+res
while 1:
try:
n=int(eval(input()))
a=sorted(map(int,input().split()))
except: break
g=[[j for j in range(n) if i!=j and gcd(a[i],a[j])!=1] for i in range(n)]
vis=[False]*n
res=[]
for u in range(n):
if not vis[u]:
res=merge(a,res,dfs(g,a,u,vis))
print((' '.join(str(a[u]) for u in res)))
| import sys
sys.setrecursionlimit(1000000000)
def gcd(a: int, b:int):
while b:
a,b=b,a%b
return a
def merge(a,us,vs):
i,j,res=0,0,[]
while i<len(us) and j<len(vs):
if a[us[i]]>=a[vs[j]]:
res.append(us[i])
i+=1
else:
res.append(vs[j])
j+=1
return res+us[i:]+vs[j:]
def dfs(g,a,u,vis):
vis[u]=True
res=[]
for v in g[u]:
if not vis[v]:
res=merge(a,res,dfs(g,a,v,vis))
return [u]+res
while 1:
try:
n=int(eval(input()))
a=sorted(map(int,input().split()))
except: break
g=[[] for _ in range(n)]
for i in range(n):
for j in range(i+1,n):
if gcd(a[i],a[j])!=1:
g[i].append(j)
g[j].append(i)
vis=[False]*n
res=[]
for u in range(n):
if not vis[u]:
res=merge(a,res,dfs(g,a,u,vis))
print((' '.join(str(a[u]) for u in res)))
| p03811 |
def slove():
import sys
input = sys.stdin.readline
s = str(input().rstrip('\n'))
print((s[:4] + " " + s[4:]))
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
s = list(str(input().rstrip('\n')))
s.insert(4, " ")
print(("".join(s)))
if __name__ == '__main__':
slove()
| p03992 |
def solve1(m,n):
div=[]
rem=[]
r=m
rem = [-1 for _ in range(n)]
digit=0
while True:
(d,r) = divmod(r,n)
div.append(d)
if r==0:
return(''.join(map(str, div))[1:],'')
elif rem[r] != -1:
le = digit - rem[r]
s = ''.join(map(str,div[1:]))
t = (' '*100 + '^'*le)[-len(s):]
return(s,t)
else:
rem[r] = digit
r *= 10
digit += 1
while True:
try:
m,n = list(map(int, input().strip().split()))
s,t = solve1(m, n)
print(s)
if t!='':
print(t)
except EOFError:
break | from decimal import *
import re
def solve2(m, n):
maxreplen = 160
PREC=200
getcontext().prec = PREC
x = Decimal(m) / Decimal(n)
s = x.to_eng_string()
if len(s) < PREC:
return(s[2:],'')
rep = 1
while True:
r = r'(.{%d})\1{%d,}' % (rep, int(maxreplen/rep)-1)
#r = r'(.{%d})\1{%d,}' % (rep, 20)
#ex. '(.{6})\\1{12,}'
a=re.search(r, s)
if a:
break
rep += 1
if rep > maxreplen:
raise ValueError('This cannot happen.')
u = s[2:a.start()+len(a.group(1))]
v = (' '*PREC + '^'*len(a.group(1)))[-len(u):]
return(u,v)
while True:
try:
m,n = list(map(int, input().strip().split()))
s,t = solve2(m, n)
print(s)
if t!='':
print(t)
except EOFError:
break | p00113 |
from collections import defaultdict
import sys
class BIT():
def __init__(self, number):
self.n = number
self.list = [0] * (number + 1)
def add(self, i, x): # ith added x 1indexed
while i <= self.n:
self.list[i] += x
i += i & -i
def search(self, i): # 1-i sum
s = 0
while i > 0:
s += self.list[i]
i -= i & -i
return s
def suma(self, i, j): # i,i+1,..j sum
return self.search(j) - self.search(i - 1)
N=int(eval(input()))
A=[int(i) for i in input().split()]
C=sorted(set(A))
ndd=defaultdict(int)
for i in range(len(C)):
ndd[i+1]=C[i]
dd=defaultdict(int)
for i in range(len(C)):
dd[C[i]]=i+1
#print(ndd,dd)
visit=[0]*N
visit[0]=1
s=A[0]
H=[]
H.append(s)
for i in range(1,N):
if s<A[i]:
s=A[i]
H.append(s)
visit[i]=1
BITI=BIT(N+1)
BITI2=BIT(N+1)
j=len(H)-1
l=dd[H[j]]
num=sum(A)
T=[0]*N
ans=0
for i in range(N-1,-1,-1):
if l==dd[A[0]]:
break
BITI.add(dd[A[i]],A[i])
BITI2.add(dd[A[i]],1)
if dd[A[i]]==l and visit[i]==1:
T[i]=BITI.suma(dd[H[j-1]],N+1)-BITI2.suma(dd[H[j-1]],N+1)*H[j-1]-ans
ans+=T[i]
#print(i,j,l,T[i],ans)
j-=1
l=dd[H[j]]
x=num-sum(T)
T[0]=x
#print(visit,T)
for t in T:
print(t)
| from operator import itemgetter
import sys
N=int(eval(input()))
A=[int(i) for i in input().split()]
B=[(A[i],i) for i in range(N)]
B=sorted(B,key=itemgetter(1))
B=sorted(B,key=itemgetter(0))
T=[0]*N
cos,pt=B.pop()
for i in range(1,N):
cos2,pt2=B.pop()
T[pt]+=(cos-cos2)*i
pt=min(pt,pt2)
cos=cos2
T[pt]+=cos*N
for i in T:
print(i)
| p03801 |
from collections import deque, defaultdict
N = int(input())
A = list(map(int, input().split()))
# 現在末尾に追加される山より若い山で，最も個数の大きいものが次の山になる
# 他の山を次の山の個数以下まで減らす
nextNumIndex = deque([0])
for i, a in enumerate(A[1:], start=1):
if a > A[nextNumIndex[-1]]:
nextNumIndex.append(i)
V = set() # 大きい山
W = set(range(N)) # 小さい山
ansList = defaultdict(int)
while len(nextNumIndex) > 1:
nowIndex = nextNumIndex.pop()
nextIndex = nextNumIndex[-1]
newW = set()
cnt = len(V) * (A[nowIndex] - A[nextIndex])
for w in W:
if A[w] >= A[nextIndex]:
V.add(w)
cnt += A[w] - A[nextIndex]
else:
newW.add(w)
W = newW
ansList[nowIndex] = cnt
if len(nextNumIndex) == 1:
for i in range(N):
A[i] = min(A[i], A[nextIndex])
ansList[0] = sum(A)
ans = []
for i in range(N):
ans.append(ansList[i])
print(*ans, sep='\n')
| N = int(input())
A = list(map(int, input().split()))
# 現在末尾に追加される山より若い山で，最も個数の大きいものが次の山になる
# 他の山を次の山の個数以下まで減らす
ans = [0] * N
numList = [(a, i) for i, a in enumerate(A)]
numList.sort(reverse=True)
numList.append((0, 0))
y = float('inf')
for c, (a, i) in enumerate(numList[: N], start=1):
y = min(y, i)
ans[y] += c * (a - numList[c][0])
print(*ans, sep='\n')
| p03801 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
S = sum(A)
for i in range(N):
A[i] = [A[i], i+1]
A.sort(reverse=True)
ans = [0]*(N+1)
i = 0
num = N+1
while i < N-1:
num = min(num, A[i][1])
while i < N-1 and A[i][0] == A[i+1][0]:
num = min(num, A[i+1][1])
i += 1
if i == N-1:
break
ans[num] += (i+1)*(A[i][0]-A[i+1][0])
i += 1
ans[1] += S-sum(ans)
for i in range(1, N+1):
print((ans[i])) | N = int(eval(input()))
A = [int(a) for a in input().split()]
ans = [0]*N
num = 0
B = sorted(A)
j = 0
for i in range(N):
cnt = 0
while j < N and B[j] <= A[i]:
cnt += max(0, B[j]-num)
j += 1
ans[i] = cnt + max(0, (N-j)*(A[i]-num))
num = max(num, A[i])
for a in ans:
print(a) | p03801 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
return [[] for _ in range(col)]
elif col == 1:
return [I() for _ in range(row)]
else:
read_all = [LI() for _ in range(row)]
return list(map(list, list(zip(*read_all))))
#################
N = I()
a = LI()
asort = sorted(a)
d = defaultdict(int)
for i in range(N):
d[a[i]] += 1
ans = [0]*N
max_ = 0
for i in range(N):
if a[i] > max_:
diff = a[i]-max_
num = N-bisect_left(asort,a[i])
ans[i] = num*diff
for j in range(max_+1,a[i]):
ans[i] += (j-max_)*d[j]
max_ = a[i]
ans[0] = sum(a)-sum(ans[1:])
for i in range(N):
print((ans[i])) | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
return [[] for _ in range(col)]
elif col == 1:
return [I() for _ in range(row)]
else:
read_all = [LI() for _ in range(row)]
return list(map(list, list(zip(*read_all))))
#################
N = I()
a = LI()
asort = sorted(a)
d = defaultdict(int)
for i in range(N):
d[a[i]] += 1
keys = sorted(list(d.keys()))
ans = [0]*N
max_ = 0
place = 0
for i in range(N):
if a[i] > max_:
diff = a[i]-max_
num = N-bisect_left(asort,a[i])
ans[i] = num*diff
for j in range(place,len(keys)):
if keys[j] <= max_:
continue
elif keys[j] >= a[i]:
place = j
break
else:
ans[i] += (keys[j]-max_)*d[keys[j]]
max_ = a[i]
ans[0] = sum(a)-sum(ans[1:])
for i in range(N):
print((ans[i])) | p03801 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
return input().split()
def MI():
return list(map(int,input().split()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
n=I()
a=LI()
d={}
nd={}
for i,x in enumerate(a):
if x in d:
d[x]=min(i,d[x])
nd[x]+=1
else:
d[x]=i
nd[x]=1
A=[i for i in list(d.items())]
A=sorted(A,key=lambda x:x[0])
#[::-1]
ans=[0]*n
px,pm=A.pop()
nn=nd[px]
while A:
x,m=A.pop()
ans[pm]+=(px-x)*nn
nn+=nd[x]
px,pm=x,min(m,pm)
ans[0]+=sum(a)-sum(ans)
#print(n,sum(a),a)
#print(*ans)
for i in ans:print(i)
| def I():
return int(eval(input()))
def LI():
return [int(i) for i in input().split()]
n=I()
a=LI()
d={}
nd={}
for i,x in enumerate(a):
if x in d:
d[x]=min(i,d[x])
nd[x]+=1
else:
d[x]=i
nd[x]=1
A=sorted([i for i in list(d.items())],key=lambda x:x[0])
ans=[0]*n
px,pm=A.pop()
nn=nd[px]
while A:
x,m=A.pop()
ans[pm]+=(px-x)*nn
nn+=nd[x]
px,pm=x,min(m,pm)
ans[0]+=sum(a)-sum(ans)
for i in ans:
print(i) | p03801 |
# -*- coding:utf-8 -*-
n = int(input())
a = [[int(k),i+1] for i,k in enumerate(input().split())]
a.sort(reverse=True)
z = [l[1] for l in a]
s=[0]*n
a.append([0,0])
for i,p in enumerate(a[:-1]):
if not p[0] == a[i+1][0]:
q = p[0] - a[i+1][0]
y = z[:i+1]
s[min(y)-1] += (i+1)*q
for t in s:
print(t) | # -*- coding:utf-8 -*-
n = int(input())
a = [[int(k),i+1] for i,k in enumerate(input().split())]
a.sort(reverse=True)
z = [l[1] for l in a]
s=[0]*n
a.append([0,0])
min_a_i = float('inf')
for i,p in enumerate(a[:-1]):
min_a_i = min(min_a_i, a[i][1])
if not p[0] == a[i+1][0]:
q = p[0] - a[i+1][0]
s[min_a_i-1] += (i+1)*q
for t in s:
print(t) | p03801 |
import collections
import heapq
n=int(eval(input()))
A=[int(i) for i in input().split()]
Ans=[0]*n
M=[0]
for i in range(n):
M.append(max(M[-1],A[i]))
D=collections.defaultdict(int)
H=[]
for i in range(n):
j=n-1-i
if A[j]<=M[j]:
heapq.heappush(H,-A[j])
else:
Ans[j]=(A[j]-M[j])*(D[A[j]]+1)
D[M[j]]+=D[A[j]]+1
ct=0
while H:
a=heapq.heappop(H)
a=-a
if a<=M[j]:
heapq.heappush(H,-a)
break
else:
Ans[j]+=a-M[j]
D[M[j]]+=1
for a in Ans:
print(a)
| import collections
import heapq
n=int(eval(input()))
A=[int(i) for i in input().split()]
Ans=[0]*n
M=[0]#自分より前の最大値をメモ。これ以下だと現れない
for i in range(n):
M.append(max(M[-1],A[i]))
D=collections.defaultdict(int)
H=[]
for i in range(n):
j=n-1-i
if A[j]<=M[j]:
heapq.heappush(H,-A[j])#出現しないインデックスの数を管理。大きいほうから取り出す。
else:
Ans[j]=(A[j]-M[j])*(D[A[j]]+1)#自分より前の最大値と自分の差かける自分自身と同じ数のこれまでの出現回数
D[M[j]]+=D[A[j]]+1#自分自身より後ろの自分と同じ数全てを自分より前の最大値まで減らすことで増える分
ct=0
while H:#自分より後ろで自分より小さいが、自分の前の最大値より大きいものを全て見る
a=heapq.heappop(H)
a=-a
if a<=M[j]:
heapq.heappush(H,-a)
break
else:
Ans[j]+=a-M[j]
D[M[j]]+=1
for a in Ans:
print(a)
| p03801 |
n,x=list(map(int,input().split()))
line=list(map(int,input().split()))
Sum=[0]
sum=0
for i in range(n):
sum+=line.pop()
Sum.append(sum)
Ans=10**18
for k in range(1,n):
p=0
for i in range(n+k-1//k):
if i==0:
if n>=k:
p+= (Sum[k])*5
else:
p+=(Sum[n])*5
break
else:
if n> (k*i +k):
p+= (Sum[k*i +k]-Sum[k*(i-1) +k])*(2*i +3)
else:
p+= (Sum[n]-Sum[k*(i-1) +k])*(2*i +3)
break
ans=(n+k)*x + p
Ans=min(Ans,ans)
print(Ans) | #入力
n,x=list(map(int,input().split()))
line=list(map(int,input().split()))
#累積和を計算しておく
#はじめに0を入れておくと、右からi番目で計算できる(i-1としなくて良い)
Sum=[0]
sum=0
#lineの後ろから値を取って、sumに足してlistに入れる
for i in range(n):
sum+=line.pop()
Sum.append(sum)
#大きい数で初期化(今回は小さい数の方が選ばれるので、十分大きい数で)
Ans=10**18
#それぞれのkについてコストを計算
for k in range(1,n):
#pは純粋な移動のみのコスト
p=0
#kで割り切れる時は、n//k -1個のグループが出来る(最初は2kでグループを作る)
#kで割り切れない時は、n//k 個のグループが出来る
#よってn-1しておけばkで割り切れる時だけ-1出来る
for i in range((n-1)//k):
#はじめだけ処理が異なる
if i==0:
if n>=2*k:
p+= (Sum[2*k])*5
#2kの長さがなければ最初から最後まで足して終わり
else:
p+=(Sum[n])*5
break
else:
if n> (k*i +2*k):
#(i+1)*k+1から(i+2)*kまでの座標の和に移動コストをかける
p+= (Sum[k*i +2*k]-Sum[k*(i-1) +2*k])*(2*i +5)
else:
p+= (Sum[n]-Sum[k*(i-1) +2*k])*(2*i +5)
break
#n*xが1)のコスト、k*xが2)のコスト
ans=(n+k)*x + p
#小さい方をAnsに代入
Ans=min(Ans,ans)
#答え
print(Ans) | p03255 |
#!/usr/bin/env python3
import sys
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
sys.setrecursionlimit(10**6)
def debug(*args): print(*args, file=sys.stderr)
def exit(): sys.exit(0)
N, X = map(int, input().split())
x = [0] + list(map(int, input().split()))
r = [0, 0]
rr = 0
for j in range(1, N+1):
rr += x[j]
r.append(rr)
def f(k):
# debug("compute %s" % k)
s = 0
m = N // k + 1
# s += 2*(r[N+1] - r[(m-1)*k])
for l in range(k):
n = (N-l) // k
s += x[l+k*n]*2
for i in range(1, m+1):
# if k*(m-i+1) > N:
# t = r[N+1]
# else:
# t = r[k*(m-i+1)]
t = r[N-k*(i-1)+1]
if N-k*i+1 < 0:
u = 0
else:
u = r[N-k*i+1]
s += (2*i+1)*(t-u)
return s
# def f(k):
# # debug("compute %s" % k)
# s = 0
# # m = N // k + 1
# # s += 2*(r[N+1] - r[(m-1)*k])
# for l in range(k):
# n = (N-l) // k
# s += x[l+k*n]*2
# for i in range(1, n+2):
# s += (2*i+1)*x[l+k*(n-i+1)]
# return s
# def g(k):
# s = 0
# for l in range(k):
# n = (N-l) // k
# s += x[l+k*n]
# for i in range(1, n+2):
# if l+k*(n-i) < 0:
# y = 0
# else:
# y = x[l+k*(n-i)]
# s += ((i+1)**2)*(x[l+k*(n-i+1)] - y)
# return s
candidates = [f(k) + k*X + N*X for k in range(1, N+1)]
debug(candidates)
# cand = [g(k) + k*X + N*X for k in range(1, N+1)]
# debug(cand)
ans = min(candidates)
print(ans)
| #!/usr/bin/env python3
import sys
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
sys.setrecursionlimit(10**6)
def debug(*args): print(*args, file=sys.stderr)
def exit(): sys.exit(0)
N, X = map(int, input().split())
x = [0] + list(map(int, input().split()))
r = [0, 0]
rr = 0
for j in range(1, N+1):
rr += x[j]
r.append(rr)
def f(k):
# debug("compute %s" % k)
s = 0
m = N // k + 1
# s += 2*(r[N+1] - r[(m-1)*k])
# for l in range(k):
# n = (N-l) // k
# s += x[l+k*n]*2
s += 2*(r[N+1] - r[N-k+1])
for i in range(1, m+1):
# if k*(m-i+1) > N:
# t = r[N+1]
# else:
# t = r[k*(m-i+1)]
t = r[N-k*(i-1)+1]
if N-k*i+1 < 0:
u = 0
else:
u = r[N-k*i+1]
s += (2*i+1)*(t-u)
return s
# def f(k):
# # debug("compute %s" % k)
# s = 0
# # m = N // k + 1
# # s += 2*(r[N+1] - r[(m-1)*k])
# for l in range(k):
# n = (N-l) // k
# s += x[l+k*n]*2
# for i in range(1, n+2):
# s += (2*i+1)*x[l+k*(n-i+1)]
# return s
# def g(k):
# s = 0
# for l in range(k):
# n = (N-l) // k
# s += x[l+k*n]
# for i in range(1, n+2):
# if l+k*(n-i) < 0:
# y = 0
# else:
# y = x[l+k*(n-i)]
# s += ((i+1)**2)*(x[l+k*(n-i+1)] - y)
# return s
candidates = [f(k) + k*X + N*X for k in range(1, N+1)]
debug(candidates)
# cand = [g(k) + k*X + N*X for k in range(1, N+1)]
# debug(cand)
ans = min(candidates)
print(ans)
| p03255 |
#!/usr/bin/env python3
import sys
from itertools import accumulate
def solve(N: int, X: int, x: "List[int]"):
coeff = [2*i+1 if i>=3 else 5 for i in range(N+1)]
acc = list(accumulate([0]+x))
tmp = 0
for i in range(N):
tmp += coeff[N-i]*x[i]
tmp += N*X+X
ans = tmp
M = N
for i in range(2, N+1):
#M -= 2
#if M<1:
# break
#tmp -= 4*acc[(coeff[M+2]-5)//2-1] + 2*x[(coeff[M+2]-5)//2-1]
#tmp += X
def tmp_iter():
cnt = 0
p, q = -(-N//i), N%i
if q>0:
for _ in range(q):
cnt += 1
yield coeff[p]
if cnt==N:
break
else:
p += 1
while cnt<N:
p -= 1
for j in range(i):
cnt += 1
yield coeff[p]
if cnt==N:
break
tmp_ans = 0
for k, elem in enumerate(tmp_iter()):
#print(i, k, elem)
tmp_ans += elem*x[k]
tmp_ans += N*X+i*X
ans = min(ans, tmp_ans)
print(ans)
return
# Generated by 1.1.3 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
X = int(next(tokens)) # type: int
x = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
solve(N, X, x)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
from itertools import accumulate
def solve(N: int, X: int, x: "List[int]"):
coeff = [2*i+1 if i>=3 else 5 for i in range(N+1)]
acc = list(accumulate([0]+x))
tmp = 0
for i in range(N):
tmp += coeff[N-i]*x[i]
tmp += N*X+X
ans = tmp
for i in range(2, N+1):
#def tmp_iter():
# cnt = 0
# p, q = -(-N//i), N%i
# if q>0:
# for _ in range(q):
# cnt += 1
# yield coeff[p]
# if cnt==N:
# break
# else:
# p += 1
# while cnt<N:
# p -= 1
# for j in range(i):
# cnt += 1
# yield coeff[p]
# if cnt==N:
# break
#for k, elem in enumerate(tmp_iter()):
# print(i, k, elem)
# tmp_ans += elem*x[k]
#tmp_ans += N*X+i*X
tmp_ans = 0
p, q = N//i, N%i
for j in range(p):
tmp_ans += coeff[p-j]*(acc[q+i*(j+1)]-acc[q+i*j])
if q>0:
tmp_ans += coeff[p+1]*acc[q]
tmp_ans += N*X+i*X
ans = min(ans, tmp_ans)
print(ans)
return
# Generated by 1.1.3 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
X = int(next(tokens)) # type: int
x = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
solve(N, X, x)
if __name__ == '__main__':
main()
| p03255 |
N, X = list(map(int, input().split()))
X_l = list(map(int, input().split()))
def golden_search(func, l,r):
# 最小値を求める
phi = 1.618 # phi=2とすると三分探索
if l >= r-4:
return min([func(k) for k in range(l,r+1)])
c1 = int((phi/(1+phi))*l + (1/(1+phi))*r)
c2 = int((1/(1+phi))*l + (phi/(1+phi))*r)
if func(c1) < func(c2):
r = c2
elif func(c1) >= func(c2):
l = c1
return golden_search(func, l,r)
def Ktimes(k):
ret = X*k + X*N
for i,x in enumerate(X_l[::-1]):
t = i//k
if t==0:
ret += 5*x
else:
ret += ((t+2)**2 - (t+1)**2)*x
return ret
answer = golden_search(Ktimes, 1, N)
print(answer) | N, X = list(map(int, input().split()))
X_l = list(map(int, input().split()))
def golden_search(func, l,r):
# 最小値を求める
phi = 1.618 # phi=2とすると三分探索
if l >= r-4:
return min([func(k) for k in range(l,r+1)])
c1 = int((phi/(1+phi))*l + (1/(1+phi))*r)
c2 = int((1/(1+phi))*l + (phi/(1+phi))*r)
if func(c1) < func(c2):
r = c2
elif func(c1) >= func(c2):
l = c1
return golden_search(func, l,r)
memo = {}
def Ktimes(k):
if k not in memo:
memo[k] = X*k + X*N
memo[k] += 2* sum(X_l[::-1][:k])
memo[k] += sum([(2*(i//k)+3)*x for i,x in enumerate(X_l[::-1])])
return memo[k]
answer = golden_search(Ktimes, 1, N)
print(answer) | p03255 |
N, X = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1e15
"""
abcdef
f +4(f-e) + 9+(e-d) + 16(d-c) + ...
= 5f + 5e + 7d + 9c + 11b + 13a
"""
mul = [5] + [5 + 2*i for i in range(N)]
#print(mul)
for k in range(1,N+1): # Number of robots (this loop will be ended early)
cost = N*X + k*X # pickup and throw costs(fixed with k)
for i in range(1,N+1):
cost += A[N-i] * mul[(i-1)//k]
#print(k,cost)
ans = min(ans,cost)
if N//k <= 1: # early stopping (after mul is 5 for all A's, cost is monotonicaly increasing)
print(ans)
exit(0)
#print(ans)
| N, X = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1e19
"""
abcdef
f +4(f-e) + 9+(e-d) + 16(d-c) + ...
= 5f + 5e + 7d + 9c + 11b + 13a
"""
mul = [5] + [5 + 2*i for i in range(N)]
#print(mul)
CX = [0] * (N+1)
#cum_sum
for i in range(N):
CX[i+1] = CX[i] + A[i]
for k in range(1,N+1): # Number of robots (this loop will be ended early)
cost = N*X + k*X # pickup and throw costs(fixed with k)
# partial point answer (not using cumulative sum)
# for i in range(1,N+1):
# cost += A[N-i] * mul[(i-1)//k]
ix = N
loopc = 0
while ix > 0:
if ix-k > 0:
cost += (CX[ix] - CX[ix-k]) * mul[loopc]
else:
cost += (CX[ix]) * mul[loopc]
loopc += 1
ix -= k
#print(k,cost)
ans = min(ans,cost)
if N//k <= 1: # early stopping (after mul is 5 for all A's, cost is monotonicaly increasing)
print(ans)
exit(0)
#print(ans)
| p03255 |
N,X = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 10**100
for k in range(1,N+1):
cur = (N+k) * X
dp = []
dpnum = []
for i in range(1,N+1,k):
sum = 0
num = 0
for j in range(i,min(i+k,N+1)):
sum += a[N-j]
num += 1
dp.append(sum)
dpnum.append(num)
count = 0
for i in range(len(dp)):
if i == 0:
cur += dp[i] * 5
else:
cur += dp[i] * (2*(i+1) + 1)
"""
for i in range(1,N+1,k):
num = min(i+k-1,N) - i + 1
if count == 0:
cur += dp[count] * 5 * num
else:
cur += dp[count] * (2*(count+1) + 1) * num
count += 1
"""
### print(dp, dpnum, cur)
ans = min(ans, cur)
print(ans)
|
N,X = list(map(int, input().split()))
a = list(map(int, input().split()))
a = a[::-1]
dp = [0 for i in range(N+1)]
for i in range(1,N+1):
dp[i] = a[i-1] + dp[i-1]
ans = 10**100
for k in range(1,N+1):
cur = (N+k) * X
count = 1
i = k
while 1:
first = i - k
last = min(N,i)
flag = False
if i > N:
flag = True
if count == 1:
cur += dp[last] * 5
else:
cur += (dp[last] - dp[first]) * (2*count + 1)
count += 1
i += k
if flag:
break
### print(dp, cur)
ans = min(ans, cur)
print(ans)
| p03255 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, X = inpl()
A = inpl()
B = [0]
for a in A:
B.append(B[-1] + a)
ans = INF
for k in range(1, N + 1):
tmp = 0
i = 0
cur = N - k
while True:
e = 5 if i == 0 else 2 * i + 3
tmp += e * (B[cur + k] - B[max(cur, 0)])
if cur <= 0:
break
i += 1
cur -= k
ans = min(ans, tmp + (N + k) * X)
print(ans) | # coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, X = inpl()
A = inpl()
B = [0]
for a in A:
B.append(B[-1] + a)
ans = INF
for k in range(1, N + 1):
e = 5
cur = N - k
tmp = e * (B[N] - B[cur]) + (N + k) * X
cur -= k
while True:
tmp += e * (B[cur + k] - B[max(cur, 0)])
if cur <= 0:
break
e += 2
cur -= k
ans = min(ans, tmp)
print(ans)
| p03255 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, X = inpl()
A = inpl()
B = [0]
for a in A:
B.append(B[-1] + a)
ans = []
for k in range(1, N + 1):
e = 5
cur = N - k
tmp = e * (B[N] - B[cur]) + (N + k) * X
cur -= k
while True:
tmp += e * (B[cur + k] - B[max(cur, 0)])
if cur <= 0:
break
e += 2
cur -= k
ans.append(tmp)
print((min(ans))) | # coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, X = inpl()
A = inpl()
B = [0]
for a in A:
B.append(B[-1] + a)
ans = INF
for k in range(1, N + 1):
tmp = 5 * B[N] + (N + k) * X
cur = N - 2 * k
while cur > 0:
tmp += 2 * B[cur]
cur -= k
ans = min(ans, tmp)
print(ans)
| p03255 |
N,X=list(map(int,input().split()))
x=list(map(int,input().split()))
w=[x[-1]]
for y in x[N-2::-1]:w+=[w[-1]+y]
r=1e20
for k in range(1,N+1):
s=0
for j in range(1,1+((N+k-1)//k)):
s+=max(5,2*j+1)*(w[min(N,k*j)-1]-(0 if j==1 else w[k*j-k-1]))
s+=(N+k)*X
r=min(s,r)
print(r) | N,X=list(map(int,input().split()))
w=[0]
for i in map(int,input().split()):w+=[w[-1]+i]
print((min(5*w[N]+k*X+sum(2*w[j]for j in range(N-k*2,0,-k))for k in range(1,N+1))+N*X)) | p03255 |
iN ,iX = [int(x) for x in input().split()]
aX = [int(x) for x in input().split()]
#人のをみてようやく仕組みがわかったがこれで通るんだろうか
aCum = [0]*(iN)
aCum[0] = aX[0]
for i in range(1,iN):
aCum[i]=aCum[i-1]+aX[i]
def fCalcCost(iN,iX,aCum,iK):
iCost = 5 * aCum[-1]
i = 2
while i*iK < iN :
iCost += 2 * aCum[-1 * i * iK -1]
i += 1
iCost += (iK +iN)*iX
return iCost
iTotalCost = fCalcCost(iN,iX,aCum,1)
for iK in range(2,iN//2 + 2):
iTotalCost = min(iTotalCost,fCalcCost(iN,iX,aCum,iK))
print(iTotalCost)
|
iN ,iX = [int(x) for x in input().split()]
aX = [int(x) for x in input().split()]
aCum = [0]*(iN)
aCum[0] = aX[0]
for i in range(1,iN):
aCum[i]=aCum[i-1]+aX[i]
def fCeil(iT,iR):
return -1 * iT // iR * -1
def fCalcCost(iN,iX,aCum,iK):
iCost = 5 * aCum[-1]
for i in range(2,fCeil(iN,iK) ):
iCost += 2 * aCum[-1 * i * iK -1]
# i = 2
# while i*iK < iN :
# iCost += 2 * aCum[-1 * i * iK -1]
# i += 1
iCost += (iK +iN)*iX
return iCost
iTotalCost = fCalcCost(iN,iX,aCum,1)
for iK in range(2,iN//2 + 2):
iTotalCost = min(iTotalCost,fCalcCost(iN,iX,aCum,iK))
print(iTotalCost)
| p03255 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.