input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
h = A[0]
ans = 0
for i in range(N):
if A[i] < h:
ans += h - A[i]
if A[i] > h:
h = A[i]
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
tallest = A[0]
ans = 0
for height in A:
if height < tallest:
ans += tallest - height
elif height > tallest:
tallest = height
print(ans)
if __name__ == "__main__":
... | p02578 |
n=int(eval(input()))
arr=list(map(int,input().split()))
c=0
for i in range(1,n):
m=0
for j in range(i,0,-1):
if arr[j-1]>m:
m=arr[j-1]
if arr[i]<m:
c+=m-arr[i]
print(c) | n=int(eval(input()))
arr=list(map(int,input().split()))
c=0
for i in range(1,n):
if arr[i]<arr[i-1]:
c+=arr[i-1]-arr[i]
arr[i]+=arr[i-1]-arr[i]
print(c) | p02578 |
# -*- coding: utf-8 -*-
# 標準入力を取得
N = int(eval(input()))
A = list(map(int, input().split()))
# 求解処理
ans = 0
highest = 0
for n in range(N):
highest = max(highest, A[n])
ans += max(highest - A[n], 0)
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N = int(eval(input()))
A = list(map(int, input().split()))
return N, A
def main(A: list) -> None:
"""
メイン処理.
Args:\n
A (list): 身長(1 <= A_i <= 10**... | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
for i in range(1, len(a)):
if a[i-1] > a[i]:
while not a[i] == a[i-1]:
a[i] += 1
sum += 1
print(sum) | n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
for i in range(1, len(a)):
if a[i-1] > a[i]:
sum += a[i - 1] - a[i]
a[i] = a[i - 1]
print(sum) | p02578 |
N = int(eval(input()))
A = list(map(int, input().split(' ')))
ans = 0
for i in range(1,N):
if A[i-1] > A[i]:
ans += A[i-1] - A[i]
A[i] += A[i-1] - A[i]
print(ans) | N = int(eval(input()))
A = list(map(int, input().split(' ')))
ans = 0
gap = 0
for i in range(1,N):
if ( A[i-1] + gap ) > A[i]:
gap = ( A[i-1] + gap ) - A[i]
else:
gap = 0
ans += gap
print(ans) | p02578 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=sum(A)
s=N+1
j=s
for i in range(100000):
if A==sorted(A):
break
x=max(A[:s])
s=A.index(x)
A[s:j]=[x]*len(A[s:j])
j=s
print((sum(A)-ans)) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=sum(A)
for i in range(1,N):
if A[i-1] > A[i]:
A[i]=A[i-1]
print((sum(A)-ans)) | p02578 |
n=int(eval(input()))
s=list(map(int,input().split()))
m=0
for i in range(n-1):
if s[i+1] < s[i]:
m+= s[i] - s[i+1]
s[i+1] = s[i]
print(m) | n=int(eval(input()))
a = list(map(int,input().split()))
p=0
for i in range(1,n):
if a[i-1] > a[i]:
p+=a[i-1]-a[i]
a[i] = a[i-1]
print(p) | p02578 |
n,*a=list(map(int,open(0).read().split()))
count=0
for i in range(1,n):
if i==1:
if a[0]>a[1]:
count+=a[0]-a[1]
else:
if max(a[:i])>a[i]:
count+=max(a[:i])-a[i]
print(count) | n,*a=list(map(int,open(0).read().split()))
count,max_n=0,a[0]
for i in range(1,n):
if max_n>a[i]:
count+=max_n-a[i]
else:
max_n=max(max_n,a[i])
print(count) | p02578 |
n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if l[i+1]<=max(l[0:i+1]):
ans+= max(l[0:i+1])-l[i+1]
print(ans) | n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if l[i+1]<l[i]:
ans+= l[i]-l[i+1]
l[i+1]=l[i]
print(ans) | p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
tmp = A[0]
sm = A[0]
for i in range(len(A)-1):
sm += max(tmp, A[i+1])
tmp = max(tmp, A[i+1])
print((sm-sum(A))) | N = int(eval(input()))
A = list(map(int, input().split()))
tmp = 0
sm = 0
for i in range(len(A)):
sm += max(tmp, A[i])
tmp = max(tmp, A[i])
print((sm-sum(A))) | p02578 |
N=int(eval(input()))
A=list(map(int, input().split()))
B=[0 for _ in range(N)]
C=A
for i in range(1,N):
M=max(C[:i])
if M>A[i]:
B[i]=M-A[i]
C[i]=M
print((sum(B))) | N=int(eval(input()))
A=list(map(int, input().split()))
ans=0
M=A[0]
for i in range(1,N):
if A[i]>M:
M=A[i]
else:
ans+=M-A[i]
print(ans)
| p02578 |
n = int(eval(input()))
aN = list(map(int, input().split()))
sum_board = 0
for i in range(1,n):
if aN[i] < max(aN[:i]):
sum_board += max(aN[:i]) - aN[i]
print(sum_board) | n = int(eval(input()))
aN = list(map(int, input().split()))
sum_board = 0
aN_max = aN[0]
for i in range(1,n):
if aN[i] < aN_max:
sum_board += aN_max - aN[i]
else:
aN_max = aN[i]
print(sum_board) | p02578 |
from collections import defaultdict
N = int(eval(input()))
A = [int(a) for a in input().split()]
ans = 0
memo = defaultdict(lambda: 0)
for i in range(1, len(A))[::-1]:
memo[A[i]] += 1
for h in list(memo.keys()):
if (A[i-1] > h):
diff = A[i-1] - h
ans += diff *... | N = int(eval(input()))
A = [int(a) for a in input().split()]
ans = 0
for i in range(len(A)-1):
if A[i] > A[i+1]:
diff = A[i] - A[i+1]
A[i+1] += diff
ans += diff
print(ans) | p02578 |
n = int(eval(input()))
A = [*list(map(int, input().split()))]
s = maxA = 0
for a in A:
maxA = max(maxA, a)
s += maxA - a
print(s)
| _ = int(eval(input()))
s = h = 0
for a in map(int, input().split()):
h = max(h, a)
s += h - a
print(s)
| p02578 |
n = int(eval(input()))
a = [int(i) for i in input().split(' ')]
result = 0
max_height = 0
for i in range(n):
an = a[i]
if i == 0:
max_height = an
max_height_idx = 0
continue
if an >= max_height:
max_height = an
max_height_idx = i
continue
result += (max_height - an)
... | n = int(eval(input()))
a = [int(i) for i in input().split(' ')]
result = 0
max_height = 0
for i in range(n):
an = a[i]
if i == 0:
max_height = an
continue
if an >= max_height:
max_height = an
continue
result += (max_height - an)
print(result) | p02578 |
n = int(eval(input()))
a = [int(i) for i in input().split(' ')]
result = 0
max_height = 0
for i in range(n):
an = a[i]
if i == 0:
max_height = an
continue
if an >= max_height:
max_height = an
continue
result += (max_height - an)
print(result) | n = int(eval(input()))
a = [int(i) for i in input().split(' ')]
result = 0
max_height = 0
for i in range(n):
if a[i] >= max_height:
max_height = a[i]
continue
result += (max_height - a[i])
print(result) | p02578 |
N = int(eval(input()))
array = list(map(int,input().split()))
su = sum(array)
def func(c,ar):
num = max(ar[0:c])
idx = ar.index(num)
for i in range(idx+1,c):
ar[i] = num
if idx == 0:
print((sum(ar)-su))
return
func(idx,ar)
res = func(N,array) | N = int(eval(input()))
array = list(map(int,input().split()))
new_array = array
t = sum(array)
for i in range(N-1):
if array[i] > array[i+1]:
array[i+1] = array[i]
print((sum(array) - t)) | p02578 |
n = int(eval(input()))
a = [int(s) for s in input().split()]
b = a.copy()
max_index = a.index(max(a))
count = 0
last_index = len(a)
while(last_index > 0):
b[max_index: last_index] = [a[max_index]] * (last_index - max_index)
last_index = max_index
if last_index == 0 or len(set(a[:last_index]))... | n = int(eval(input()))
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
if max > a[i]:
if a[i - 1] > max:
max = a[i - 1]
count += max - a[i]
else:
max = a[i]
print(count) | p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
fumidai_list, A_after = [], 0
for count_a in range(len(A)):
fumidai = 0
if(A[count_a] >= A_after):
A_after = A[count_a]
fumidai_list.append(fumidai)
elif(A[count_a] < A_after):
while True:
fumida... | N = int(eval(input()))
A = list(map(int, input().split()))
fumidai_list, A_after = [], 0
for count_a in range(len(A)):
fumidai = 0
if(A[count_a] >= A_after):
A_after = A[count_a]
fumidai_list.append(fumidai)
elif(A[count_a] < A_after):
fumidai = A_after - A[count_a]
... | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
res = a[0]
ans = 0
for i in range(1, n):
if res>=a[i]:
ans += res-a[i]
else:
res = a[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
res = a[0]
ans = 0
for i in range(1, n):
if res-a[i]>=0:
ans += res-a[i]
else:
res = a[i]
print(ans) | p02578 |
N=int(eval(input()))
A=list(map(int,input().split()))
c=0
for i in range(len(A)-1):
m=max(A[0:i+1])
if m>A[i+1]:
d=m-A[i+1]
c+=d
print(c) | N=int(eval(input()))
A=list(map(int,input().split()))
c=0
m=A[0]
for i in range(len(A)-1):
if m<A[i+1]:
m=A[i+1]
if m>A[i+1]:
d=m-A[i+1]
c+=d
print(c) | p02578 |
n = int(eval(input()))
li = list(map(int,input().split()))
ans = 0
for i in range(n):
if i > 0:
while li[i-1] > li[i]:
li[i]+=1
ans += 1
print(ans)
| n = int(eval(input()))
li = list(map(int,input().split()))
ans = 0
for i in range(n):
if i > 0:
if li[i-1] > li[i]:
ans += li[i-1]-li[i]
li[i] += (li[i-1]-li[i])
print(ans)
| p02578 |
N=int(eval(input()))
A=[int(_) for _ in input().split(" ")]
max=max(A)
if A[0] == max:
total=0
for i in range(len(A)):
total = total + max - A[i]
print(total)
exit()
ans=0
total=0
b=len(A)
a=1
while a!=0:
max=0
for i in range(b):
if max < A[i]:
a=i
max=A[i]
for... | N=int(eval(input()))
A=[int(_) for _ in input().split(" ")]
max=0
total=0
for i in range(len(A)):
if max < A[i]:
max=A[i]
else:
total+=max-A[i]
print(total)
| p02578 |
n = int(eval(input()))
A = list(map(int,input().split()))
step = [0]
for i in A[1:]:
if A[A.index(i)-1] >= i:
step.append(A[A.index(i)-1] - i)
A[A.index(i)] += A[A.index(i)-1] - i
print((sum(step)))
| n = int(eval(input()))
A = list(map(int,input().split()))
step = [0]
for k,i in enumerate(A[1:]):
if A[k] >= i:
step.append(A[k] - i)
A[k+1] = A[k+1] + A[k] - i
print((sum(step)))
| p02578 |
#coding: utf-8
import sys
def input():
return sys.stdin.readline()[:-1]
"""
N人が1列に並んでおり、前からi番目の人の身長は A_iです。
それぞれの人の足元に、高さが0以上の踏み台を設置し、全ての人が次の条件を満たすようにしたいです。
条件：踏み台を込めて身長を比較したとき、自分より前に、自分より背の高い人が存在しない
この条件を満たす時の、踏み台の高さの合計の最小値を求めてください。
"""
N = int(eval(input()))
A = list(map(int, input().split()))
out = 0... | #coding: utf-8
import sys
def input():
return sys.stdin.readline()[:-1]
"""
N人が1列に並んでおり、前からi番目の人の身長は A_iです。
それぞれの人の足元に、高さが0以上の踏み台を設置し、全ての人が次の条件を満たすようにしたいです。
条件：踏み台を込めて身長を比較したとき、自分より前に、自分より背の高い人が存在しない
この条件を満たす時の、踏み台の高さの合計の最小値を求めてください。
"""
N = int(eval(input()))
A = list(map(int, input().split()))
out = 0... | p02578 |
N = int(eval(input()))
A = input().split()
count = 0
for i in range(N-1):
if int(A[i]) > int(A[i+1]):
count += int(A[i]) - int(A[i+1])
A[i+1] = int(A[i])
print(count) | N = int(eval(input()))
A = input().split()
count = 0
for i in range(N):
A[i] = int(A[i])
for i in range(N-1):
if A[i] > A[i+1]:
count += A[i] - A[i+1]
A[i+1] = A[i]
print(count) | p02578 |
N = int(eval(input()))#整数
A = list(map(int, input().split()))#配列Int型
ans = 0
for i in range(N):
for j in range(i + 1):
if A[i] > A[j]:
ans = A[i] - A[j]
A[j] += ans
print(ans) | N = int(eval(input()))#整数
A = list(map(int, input().split()))#配列Int型
ans = 0
max_val = A[0]
for i in range(1, N):
if max_val > A[i]:
ans += max_val - A[i]
else:
max_val = A[i]
print(ans) | p02578 |
b=0
print((sum((b:=max(c:=int(a),b))-c for a in[*open(0)][1].split()))) | b=s=0
for a in[*open(0)][1].split():a=int(a);b=max(b,a);s+=b-a
print(s) | p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
res = []
for i in range(len(A) - 1, 0, -1):
val = A[i]
max_val = -1
for j in A[:i]:
if max_val < j:
max_val = j
if max_val > val:
res.append(max_val - val)
else:
res.append(0)
print((sum... | N = int(eval(input()))
A = list(map(int, input().split()))
res = 0
max_val = -1
for a in A:
if a >= max_val:
max_val = a
else:
res += max_val - a
print(res)
| p02578 |
N = int(eval(input()))
A = list(map(int,input().split()))
hight = A[0]
base = 0
for i in range(1,N):
if A[i] < hight:
base += hight - A[i]
else:
hight = A[i]
print(base) | N = int(eval(input()))
List = list(map(int,input().split()))
counter = 0
height = List[0]
for i in range(1,N):
if List[i] < height:
counter += height - List[i]
else:
height = List[i]
print(counter) | p02578 |
N = int(eval(input()))
As = list(map(int, input().split()))
sum_humidai = 0
for person_idx, person_height in enumerate(As):
if person_idx == 0:
continue
max_front_person = max(As[:person_idx])
if max_front_person > person_height:
humidai = max_front_person - person_height
sum_... | N = int(eval(input()))
As = list(map(int, input().split()))
sum_humidai = 0
max_front_person = 0
for person_idx, person_height in enumerate(As):
if person_idx == 0:
continue
max_front_person = max(max_front_person, As[person_idx - 1])
if max_front_person > person_height:
humidai ... | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
l = []
for i in range(n):
if i == 0:
l.append(a[0])
else:
if max(l) <= a[i]:
l.append(a[i])
else:
l.append(max(l))
print((sum(l) - sum(a))) | n = int(eval(input()))
a = list(map(int, input().split()))
l = [a[0]]
for i in range(n-1):
if l[i] >= a[i+1]:
l.append(l[i])
else:
l.append(a[i+1])
print((sum(l) -sum(a))) | p02578 |
##C - Step(TLE)
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N):
##print(i,A)
if A != []:
maxi = max(A)
Idx = A.index(maxi)
ans += maxi*(len(A) - Idx) - sum(A[Idx::])
del A[Idx::]
else:
break
print(ans) | ##C - Step(TLE)
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
maxi = 0
for i in A:
ans += max(0,maxi-i)
maxi = max(maxi,i)
print(ans) | p02578 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
def seek(LIST:list):
global ans
max_num = max(LIST)
index = LIST.index(max(LIST))
if(index == 0):
ans += max_num*len(LIST)-sum(LIST)
else:
cal_LIST = LIST[index:]
ans += max_num*len(cal_LIST)-sum(cal... | N = int(eval(input()))
A = list(map(int,input().split()))
max_num = A[0]
ans = 0
for i in A:
if(max_num>=i):
ans += max_num-i
else:
max_num = i
print(ans)
| p02578 |
n = int(eval(input()))
A = list( int(x) for x in input().split() )
fumidai = 0
for i in range(n):
x_list = A[0:i+1]
max_list = max(x_list)
if max_list > A[i]:
fumidai += max_list - A[i]
print(fumidai) | n = int(eval(input()))
A = list( int(x) for x in input().split() )
fumidai = 0
great = A[0]
for i in range(n):
if great > A[i]:
fumidai += great - A[i]
else:
great = A[i]
print(fumidai) | p02578 |
N = int(eval(input()))
array = []
array += list(map(int,input().split()))
sumarray = sum(array)
step = 0
while array != []:
rearray=array[array.index(max(array)):]
step+=len(rearray)*max(array)
del array[array.index(max(array)):]
ans=step-sumarray
print(ans)
| N = int(eval(input()))
array = []
array+=list(map(int,input().split()))
ans=0
premax=0
for n in range(N):
premax=max(array[n],premax)
ans+=premax-array[n]
print(ans)
| p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1, N):
if A[i-1] <= A[i]:
continue
ans += A[i-1] - A[i]
A[i] = A[i-1]
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1, N):
if A[i-1] > A[i]:
d = A[i-1] - A[i]
A[i] += d
ans += d
print(ans)
| p02578 |
N=int(eval(input()))
A=list(map(int,input().split()))
S=0
i=N
while i>1:
saidai=A.index(max(A[0:i]))
S+=sum(list([max(A[0:i])-x for x in A[saidai:i]]))
i=saidai
print(S) | n=int(eval(input()))
a=list(map(int,input().split()))
s=a[0]
ans=0
for i in range(n):
if a[i]<s:
ans+=s-a[i]
else:
s=a[i]
print(ans) | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
if i == 0 and max(a):
continue
elif i < max(a):
ans += 1
print(ans) | from sys import stdin
readline = stdin.readline
n = int(readline())
a = list(map(int, readline().split()))
x = 0
ans = 0
for i in a:
if x > i:
ans += (x-i)
else:
x = i
print(ans) | p02578 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=0
for i in range(N):
L = [A[j] for j in range(i+1)]
L.sort()
B += L[i]-A[i]
print(B)
| N=int(eval(input()))
A=list(map(int,input().split()))
B=0
Mi=A[0]
for i in range(1,N):
if A[i] > Mi:
Mi = A[i]
B += Mi - A[i]
print(B) | p02578 |
N = int(eval(input()))
height = list(map(int, input().split()))
total = 0
max_number = height[0]
for i in range(1, height.index(max(height))):
if height[i] > max_number:
max_number = height[i]
else:
total += (max_number - height[i])
for i in range(height.index(max(height)), N):
total += (max(height... | N = int(eval(input()))
height = list(map(int, input().split()))
total = 0
max_number = height[0]
for i in range(1, height.index(max(height))):
if height[i] > max_number:
max_number = height[i]
else:
total += (max_number - height[i])
total += (max(height)*(N-1-height.index(max(height)))-sum(height[hei... | p02578 |
# dp[i] := i番目の人が選ばれたときの踏み台
def main():
# INF = 10 ** 9
N = int(eval(input()))
A = list(map(int, input().split()))
# initialize
dp = [0] * (N + 10)
dp[0] = A[0]
res = 0
for i in range(1, N):
for j in range(10**9):
tmp = A[i] + j
if dp[i-1... | # maをi-1番目までにでてる最大値としてi番目との差分を足していく
def main():
# INF = 10 ** 9
N = int(eval(input()))
A = list(map(int, input().split()))
# initialize
ma = A[0]
res = 0
for i in range(1, N):
if A[i] <= ma:
res += ma - A[i]
else:
ma = A[i]
print... | p02578 |
N = eval(input())
A = list(map(int, input().split()))
c = 0
hoge = []
for i in range(len(A)):
hoge.append(max(A[0:i+1]))
print((sum(hoge)-sum(A))) | N = eval(input())
A = list(map(int, input().split()))
c = 0
mae = A[0]
for i in A:
if i < mae:
c += mae - i
else:
mae = i
print(c) | p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
if A[i+1] < A[i]:
cnt += A[i]-A[i+1]
A[i+1] = A[i]
else:
pass
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
if A[i+1] < A[i]:
cnt += A[i] - A[i+1]
A[i+1] = A[i]
print(cnt) | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(1, n):
if a[i-1] > a[i]:
ans += a[i-1] - a[i]
a[i] = a[i-1]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
tmp = a[0]
ans = 0
for i in a:
if i < tmp:
ans += tmp-i
else:
tmp = i
print(ans)
| p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
min_size = A[0]
res = 0
for i in range(N):
if A[i] < min_size:
d = min_size - A[i]
res += d
elif A[i] > min_size:
min_size = A[i]
print(res) | N = int(eval(input()))
A = list(map(int, input().split()))
res = 0
max_size = A[0]
for i in range(N):
max_size = max(max_size, A[i])
d = max_size - A[i]
res += d
print(res) | p02578 |
c = [1.1,0.6,0.2,0.0]
r = [0 for i in range(8)]
while 1:
try:
e = list(map(float, input().split()))
for i in range(2):
for j in range(4):
if e[i] >= c[j]:
r[i+2*j] += 1
break
except:
break
for i in range(0,8,2):
... | from bisect import bisect
ref = [0.2,0.6,1.1]
l,r = [0]*4,[0]*4
while 1:
try:
le,re = list(map(float, input().split()))
l[bisect(ref,le)] += 1
r[bisect(ref,re)] += 1
except:
break
for i in range(1,5):
print(l[-i],r[-i]) | p00149 |
a, b = list(map(int, input().split()))
d = a//b
r = a % b
f = a / b
print(("{:d} {:d} {:.5f}".format(d,r,f))) | a, b = list(map(int,input().split()))
d,r,f = a//b,a%b,a/b
print(('{} {} {:.5f}'.format(d,r,f)))
| p02399 |
a,b = list(map(int,input().split()))
ans = a+b
#print(ans)
if ans%2 == 1:
print(((a+b)//2+1))
else:
print(((a+b)//2)) | from math import ceil #小数点以下切り上げ
a, b = list(map(int, input().split()))
print((ceil((a+b)/2))) | p03485 |
import math
a,b = list(map(int, input().split()))
print((math.ceil( (a+b) / 2) )) | import math
a,b = list(map(int, input().split()))
print((int(math.ceil((a+b)/2)))) | p03485 |
a,b = list(map(int,input().split()))
c = int((a+b+1)/2)
print(c) | a,b = list(map(int,input().split()))
print(((a+b+1)//2)) | p03485 |
import math
a, b = list(map(int,input().split()))
print((math.ceil((a+b)/2))) | a, b = list(map(int,input().split()))
print(((a+b+1)//2)) | p03485 |
a, b = list(map(int, input().split()))
print((-(-(a+b)//2))) | a, b = list(map(int, input().split()))
print((-((-a-b)//2))) | p03485 |
"""
author : halo2halo
date : 24,Oct,2019
"""
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
n, a = list(map(int, readline().rstrip().split()))
ans = int((n+a+1)/2)
print(ans)
| """
author : halo2halo
date : 29, Jan, 2020
"""
import sys
import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B = list(map(int, readline().split()))
print(((A+B+1)//2))
| p03485 |
import math
a, b = list(map(int, input().split()))
print((math.ceil((a+b)/2))) | # -*- coding: utf-8 -*-
import math
def func(a, b):
result = math.ceil((a+b)/2)
return result
a, b = list(map(int, input().split()))
print((func(a, b)))
| p03485 |
import functools
import os
INF = float('inf')
def inp():
return int(input())
def inpf():
return float(input())
def inps():
return input()
def inl():
return list(map(int, input().split()))
def inlf():
return list(map(float, input().split()))
def inls():
r... |
import math
a, b = list(map(int, input().split()))
print((math.ceil((a + b) / 2)))
| p03485 |
a,b =list(map(int, input().split()))
x = (a+b)/2
import math
print(( math.ceil(x))) | import math
a,b = list(map(int, input().split()))
print((math.ceil((a+b)/2))) | p03485 |
a,b = list(map(int,input().split()))
print((-(-(a+b)//2))) | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
a, b = list(map(int, input().split()))
print(((a + b + 1) // 2))
resolve() | p03485 |
import math
a, b = list(map(int, input().split()))
print((math.ceil((a+b)/2))) | a, b = list(map(int, input().split()))
print(((a + b + 2 - 1) // 2)) | p03485 |
import math
a, b = list(map(int, input().split()))
x = (a + b) / 2
print((math.ceil(x))) | a, b = list(map(int, input().split()))
# "//"は商を求める演算子
x = (a + b + 1) // 2
print(x) | p03485 |
# -*- coding: utf-8 -*-
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
nums = list(map(int, input().rstrip().split()))
#----------
average = (nums[0] + nums[1]) / 2
print(( Decimal(str(average)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)))
| # -*- coding: utf-8 -*-
a,b = [int(i) for i in input().rstrip().split()]
print(( ((a+b) + (2-1)) // 2 ))
| p03485 |
a, b = list(map(int, input().split()))
if (a + b) % 2 == 0:
x = (a + b) / 2
else:
x = (a + b + 1)/2
print((int(x)))
| a, b = list(map(int, input().split()))
print(((a + b + 1)//2)) | p03485 |
st=input().split()
a=int(st[0])
b=int(st[1])
if (a+b)%2==0:
print(((a+b)//2))
else:
print(((a+b+1)//2))
| a,b=list(map(int,input().split()))
print((-((-a-b)//2))) | p03485 |
a,b = list(map(int,input().split()))
if (a+b) % 2 == 0:
print(((a+b)//2))
else:
print(((a+b)//2+1)) | print((-~sum(map(int,input().split()))//2)) | p03485 |
a,b=list(map(int,input().split()))
ans= (a+b)//2 if (a+b)%2 == 0 else (a+b)//2+1
print(ans) | import math
a,b=list(map(int,input().split()))
print((math.ceil((a+b)/2))) | p03485 |
import math
a,b=list(map(int,input().split()))
print((math.ceil((a+b)/2))) | print((-~sum(map(int,input().split()))//2)) | p03485 |
a,b=list(map(int,input().split()))
print((-~(a+b)//2)) | a,b=list(map(int,input().split()))
print((-(-(a+b)//2))) | p03485 |
ab=list(map(int,input().split()));print(((sum(ab)-1)//2+1))
| print((~-sum(map(int,input().split()))//2+1)) | p03485 |
a, b = (int(i) for i in input().split())
#print(a,b)
c=-(-(a+b)//2)
print(c) | a, b = (int(i) for i in input().split())
#print(a,b)
c=(a+b+(2-1))//2
print(c) | p03485 |
a, b = list(map(int, input().split()))
if (a + b) % 2 == 0:
mean = (a + b) // 2
else:
mean = (a + b) // 2 + 1
print(mean)
| a, b = list(map(int, input().split()))
if (a + b) % 2 == 0:
print(((a + b) // 2))
else:
print(((a + b) // 2 + 1))
| p03485 |
print((eval(input().replace(' ','+1+'))//2)) | print((eval(input().replace(*' +'))+1>>1)) | p03485 |
a,b=list(map(int,input().split()))
print((int((a+b+1)/2))) | a,b=list(map(int,input().split()))
print(((a+b+1)//2)) | p03485 |
import math
a,b=list(map(int,input().split()))
print((math.ceil((a+b)/2))) | a,b = list(map(int,input().split()))
print(((a+b+1)//2)) | p03485 |
from math import ceil
from statistics import mean
a = list(map(int,input().split()))
print((ceil(mean(a)))) | import math
a,b = list(map(int,input().split()))
print((math.ceil((a+b)/2))) | p03485 |
a, b = list(map(int, input().split()))
print((-(-(a + b)//2))) | a, b = list(map(int, input().split()))
print(((a + b + 1)//2)) | p03485 |
import math
import statistics as st
a,b = list(map(int,input().split()))
print((math.ceil(st.mean((a,b))))) | import math
a, b = list(map(int,input().split()))
print((math.ceil((a+b)/2))) | p03485 |
import math
a,b = list(map(int,input().split()))
print((int(math.ceil((a+b)/2)))) | a,b = list(map(int,input().split()))
print((-(-(a+b)//2))) | p03485 |
from math import ceil
from statistics import mean
ab = list(map(int, input().split()))
print((ceil(mean(ab))))
| from math import ceil
a, b = list(map(int, input().split()))
print((ceil((a+b)/2)))
| p03485 |
x,y = list(map(int, input().split()))
z =x+y
import math
print((math.ceil(z/2))) | x,y = list(map(int, input().split()))
import math
print((math.ceil((x+y)/2))) | p03485 |
n,q=list(map(int,input().split()))
c=list(map(int,input().split()))
p=[0]*(max(c)+1)
for i in c:
p[i]=1
for k in range(q):
m=int(input())
flag=0
ans=0
for i in range(m-1,0,-1):
for pi in p[i::m]:
if pi:
ans=i
break
if ans>0:
break
print(ans) | N,Q=list(map(int,input().split()))
c=list(map(int,input().split()))
mxc=max(c)
p=[0]*(mxc+1)
for i in c:
p[i]=1
l=[0]*(mxc+1)
num=0
for i in range(mxc+1):
l[i]=num
if p[i]:
num=i
for i in range(Q):
q=int(input())
sp=mxc
ans=0
while 1:
r=sp%q... | p00265 |
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(Q):
m = -1
spam = int(eval(input()))
for n in C:
ham =n%spam
m = max(m,ham)
print(m) | def next_max(lst,mi,v):
l, r = 0, mi-1
while l <= r:
mid = int((l+r)/2)
if lst[mid] == v: return mid -1
if lst[mid] > v:
r = mid - 1
else:
l = mid + 1
return r
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
C.so... | p00265 |
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(eval(input()))
n_v = M-1
m = 0
while n_v != 0:
... | N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(eval(input()))
n_v = M-1
m = 0
while n_v != 0:
... | p00265 |
# Aizu Problem 0270: Modular Query
import sys, math, os, datetime
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
N, Q = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]
for q in range(Q):
m = int(eval(input()))
... | N,Q=list(map(int,input().split()))
c=list(map(int,input().split()))
mxc=max(c)
p=[0]*(mxc+1)
for i in c:
p[i]=1
l=[0]*(mxc+1)
num=0
for i in range(mxc+1):
l[i]=num
if p[i]:
num=i
for i in range(Q):
q=int(input())
sp=mxc
ans=0
while 1:
r=s... | p00265 |
import sys
lst = []
for line in sys.stdin:
num = line.strip()
if num == "0":
print(lst.pop())
else:
lst.append(num) | import sys
lst = []
for line in sys.stdin:
if line.strip() :
num = int(line.strip())
if num == 0:
print(lst.pop())
else:
lst.append(num) | p00013 |
import sys
file_input = sys.stdin
NM = file_input.readline()
import itertools
while NM != '0 0\n':
N, M = list(map(int, NM.split()))
P = [int(file_input.readline()) for i in range(N)]
P.append(0)
P = list(set(P))
P.sort()
scores = list(map(sum, itertools.combinations_with_repla... | import sys
file_input = sys.stdin
NM = file_input.readline()
import itertools, bisect
while NM != '0 0\n':
N, M = list(map(int, NM.split()))
P = [int(file_input.readline()) for i in range(N)]
P.append(0)
scores = list(map(sum, itertools.combinations_with_replacement(P, 2)))
scores =... | p00452 |
import bisect
while 1:
n,m=list(map(int,input().split()))
if n==0:break
s,a=[],[0]*(n+1)
for i in range(1,n+1):
a[i]=int(eval(input()))
for j in range(i+1):
if a[i]+a[j]<=m:s+=[a[i]+a[j]]
else:break
s.sort()
print((max(i+s[bisect.bisect_right(s,... | import bisect
while 1:
n,m=list(map(int,input().split()))
if n==0:break
s=[]
a=[0]+sorted([int(eval(input())) for _ in range(n)])
for i in range(n+1):
for j in a[i:]:
if a[i]+j>m:break
s+=[a[i]+j]
s.sort()
print((max(i+s[bisect.bisect_right(s,m-i)-1... | p00452 |
import bisect
while True:
N,M=list(map(int,input().split()))
if N==M==0:break
L=[eval(input()) for i in range(N)]
L.append(0)
S=set(i+j for i in L for j in L)
B=sorted(S)
maxInt=0
for i in B:
if i>M:break
idx=bisect.bisect(B,M-i)
if i+B[idx-1]<=M:
... | import bisect
while True:
N,M=list(map(int,input().split()))
if N==M==0:break
L=[eval(input()) for i in range(N)]
L.append(0)
S=set(i+j for i in L for j in L)
B=sorted(S)
maxInt=0
for i in B:
if i>M:break
idx=bisect.bisect(B,M-i)
maxInt=max(maxInt,i+B[... | p00452 |
while(1):
[N,M]=[int(x) for x in input().split()]
if N==0:
break
a=[0]
for i in range(N):
a.append(int(input()))
#b=sorted([x+y for x in a for y in a])
#c=[]
#for i in range(1,len(b)):
# if b[i]>M:
# break
# elif b[i-1]!=b[i]:
# ... | import bisect
while(1):
[N,M]=[int(x) for x in input().split()]
if N==0:
break
a=[0 for x in range(N+1)]
for i in range(N):
a[i+1]=int(input())
#b=sorted([x+y for x in a for y in a])
#c=[]
#for i in range(1,len(b)):
# if b[i]>M:
# break
# ... | p00452 |
def solve():
while True:
n,m = list(map(int,input().split()))
if not n and not m: break
lst = []
lst2 = []
lst = [int(eval(input())) for _ in range(n)]
lst.append(0)
lst2 = [i + j for i in lst for j in lst if i <= j]
#for i in lst:
# for j in lst:
# if i + j <= m... | def solve():
while True:
n,m = list(map(int,input().split()))
if not n and not m: break
lst = [int(eval(input())) for _ in range(n)]
lst.append(0)
lst = sorted(lst)
lst2 = [i + j for i in lst for j in lst if i <= j]
lst2 = sorted(lst2)
A = []
index = len(lst2) - 1
... | p00452 |
def calc(s, count):
global m, r, nums
if s >= m or count > 4:
return
else:
if r < s:
r = s
for n in nums:
calc(s + n, count + 1)
while True:
n, m = [int(n) for n in input().split()]
if n == 0 and m == 0:
break
else:
... | import bisect
while True:
n, m = [int(n) for n in input().split()]
if n == 0 and m == 0:
break
else:
r = 0
nums = [int(input()) for i in range(n)] + [0]
temp = sorted(set([x + y for x in nums for y in nums if x + y < m]))
for num in temp:
index... | p00452 |
import itertools
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
P = set([int(input()) for i in range(N)])
ans = 0
for i in range(2,5):
for p in itertools.combinations_with_replacement(P,i):
if ans < sum(p) <= M:
ans = sum(p)
print(ans) | from bisect import *
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
P = [int(input()) for i in range(N)] + [0]
P = sorted([i+j for i in P for j in P])
s = bisect(P,M) - 1
print(max(i + P[bisect(P,M-i) - 1] for i in P[:s])) | p00452 |
from bisect import *
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
P = [int(input()) for i in range(N)] + [0]
P = sorted([i+j for i in P for j in P])
s = bisect(P,M) - 1
print(max(i + P[bisect(P,M-i) - 1] for i in P[:s])) | from bisect import *
while 1:
N,M = list(map(int,input().split()))
if N == 0: break
P = [int(input()) for i in range(N)] + [0]
P = sorted(set(i+j for i in P for j in P))
s = bisect(P,M) - 1
print(max(i + P[bisect(P,M-i) - 1] for i in P[:s])) | p00452 |
from bisect import bisect_right
while True:
n, m = list(map(int, input().split()))
if not n:
break
ps = [0] + sorted(int(eval(input())) for _ in range(n))
p2 = set()
for i, pi in enumerate(ps):
for pj in ps[i:]:
if pi + pj > m:
break
... | from bisect import bisect_right
while True:
n, m = list(map(int, input().split()))
if not n:
break
ps = [0] + sorted(int(eval(input())) for _ in range(n))
p2 = set()
for i, pi in enumerate(ps):
for pj in ps[i:]:
if pi + pj > m:
break
... | p00452 |
from bisect import *
while 1:
n, lmt = list(map(int, input().split()))
if n == 0: break
p = [eval(input()) for i in range(n)] + [0]
p = sorted(set(i + j for i in p for j in p))
s = bisect(p, lmt)
print(max(i + p[bisect(p[:s], lmt - i) - 1] for i in p[:s])) | from bisect import *
while 1:
n, lmt = list(map(int, input().split()))
if n == 0: break
p = [eval(input()) for i in range(n)] + [0]
p = sorted(set(i + j for i in p for j in p))
s = bisect(p, lmt)
print(max(i + p[bisect(p, lmt - i) - 1] for i in p[:s])) | p00452 |
import bisect
while 1:
n,m=list(map(int,input().split()))
if n==m==0:break
p=[0]+[int(input()) for _ in range(n)]
com=[0]*((n+1)**2)
for i in range(n+1):
for j in range(n+1):
com[(n+1)*i+j]=p[i]+p[j]
com.sort()
ans=0
for i in range(n+1):
for j in... | import bisect
while 1:
n,m=list(map(int,input().split()))
if n==m==0:break
p=[0]+[int(input()) for _ in range(n)]
com=[None]*((n+1)**2)
for i in range(n+1):
for j in range(n+1):
com[(n+1)*i+j]=p[i]+p[j]
com.sort()
ans=0
for i in range(n+1):
for j... | p00452 |
import bisect
while 1:
n,m=list(map(int,input().split()))
if n==m==0:break
p=[0]+[int(input()) for _ in range(n)]
com=[None]*((n+1)**2)
for i in range(n+1):
for j in range(n+1):
com[(n+1)*i+j]=p[i]+p[j]
com.sort()
ans=0
for i in range(n+1):
for j... | import bisect
def solve(n,m):
p=[0]+[int(input()) for _ in range(n)]
com=[None]*((n+1)**2)
for i in range(n+1):
for j in range(n+1):
com[(n+1)*i+j]=p[i]+p[j]
com.sort()
ans=0
for i in range(n+1):
for j in range(n+1):
tmp=m-com[(n+1)*i+j]
... | p00452 |
# -*- coding: utf-8 -*-
import sys
import math
from decimal import Decimal, ROUND_DOWN
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line... | # -*- coding: utf-8 -*-
import sys
import math
from decimal import Decimal, ROUND_DOWN
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line... | p02629 |
import string
# 1千兆 + 1
N = int(eval(input()))
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
x = N - 1
ans = []
# while True:
# mod = x % 26
# ans = [ mod ] + ans
# x = x // 26
# if x <= 0:
# if ans[0] == 0:
# ans = [0] + ans
# break... | import string
# 1千兆 + 1
N = int(eval(input()))
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
x = N - 1
ans = []
# while True:
# x -= 1
# mod = x % 26
# ans = [ mod ] + ans
# x = x // 26
# if x <= 0:
# break
# print(ans)
# print("".join([ letters[... | p02629 |
import string
# 1千兆 + 1
N = int(eval(input()))
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
x = N - 1
ans = []
# while True:
# x -= 1
# mod = x % 26
# ans = [ mod ] + ans
# x = x // 26
# if x <= 0:
# break
# print(ans)
# print("".join([ letters[... | import string
# 1千兆 + 1
N = int(eval(input()))
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
# x = N - 1
x = N
ans = []
# while True:
# x -= 1
# mod = x % 26
# ans = [ mod ] + ans
# x = x // 26
# if x <= 0:
# break
# print(ans)
# print("".join([... | p02629 |
import sys
input = sys.stdin.readline
import string
import sys
import math
ALPHABET = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
result = []
def alphabet_decimal(v):
quotient = math.floor(v / len(ALPHABET))
surplus = v % len(ALPHABET)
... | import sys
input = sys.stdin.readline
import string
def main():
def f(n):
if n == -1:return
a, b = divmod(n, 26)
ans.append(string.ascii_lowercase[b])
f(a-1)
N = int(eval(input()))
ans = []
f(N-1)
print(("".join(ans[::-1])))
if __name__ == "__main__":
... | p02629 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.