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:
... | 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:
... | 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])
... | 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__... | 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]:
... | 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]:
... | 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__':
... | 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... | 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 =... | 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 ... | 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 h... | #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 h... | 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
... | 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__... | 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 +... | # 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
... | 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 c... | 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
... | 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
... | 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:
ac... | 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,in... | #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,in... | 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:
a... | # 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これで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:... | 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... | 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:
... | #旧版の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... | 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... | 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] -... | #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] ... | 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
... | # 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()... | 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... | 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)
... | 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
prin... | 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]... | 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[-... | 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... | 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,... | 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(v... | 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... | 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)
... | 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,... | 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=... | 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() # 大きい山
... | 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, ... | 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
... | 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:
pr... | 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):
... | 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):
... | 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():
... | 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])
... | 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
fo... | # -*- 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][... | 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)
... | 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])#出現しないインデックスの数を管理。大きいほ... | 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... | #入力
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... | 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... | #!/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... | 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... | #!/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... | 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 fu... | 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 fu... | 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 = 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... | 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]
... |
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
... | 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
... | # 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:
... | 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:
... | # 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]
... | 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 += ... |
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) ):... | p03255 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.