input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = lambda: sys.stdin.readline().rstrip()
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total = 0
stack = [(0, 0, 0, 0, 0)]
res = 0
flg = 0
while stack:
av, ai, bv, bi, ans = stack.pop()
if av + bv > K:
... | import sys
input = lambda: sys.stdin.readline().rstrip()
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0] + A
b = [0] + B
for i in range(len(a)-1):
a[i+1] += a[i]
for i in range(len(b)-1):
b[i+1] += b[i]
ans = 0
j =... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0] + A
B = [0] + B
for i in range(1, N+1):
A[i] += A[i-1]
for i in range(1, M+1):
B[i] += B[i-1]
start = 0
end = N+1
while end-start > 1:
sep = (start+end)//2
if A[sep] <= K:
... | N,M,K=list(map(int,input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
#入力終わり
#累積和とる
A_wa = [0]
for i in range(N) :
A_wa.append(A_wa[i]+A[i])
B_wa = [0]
for i in range(M) :
B_wa.append(B_wa[i]+B[i])
a = N
ans = 0
for b in range(M+1):
A_lim = K - B_wa... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
s = 0
b_count = 0
for i in range(m):
if s + b[i] <= k:
s += b[i]
ans += 1
b_count = i+1
else:
break
a_count = 0
while True:
if a_count < n ... | n, m, k = list(map(int,input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = [0]
for i in range(n):
sa.append(sa[-1] + a[i])
inf = 1001001001
sb = [-inf, 0]
for i in range(m):
sb.append(sb[-1] + b[i])
sb.append(inf)
ans = 0
for i in range(n+1):
s = sa[i]... | p02623 |
n,m,k=list(map(int,input().split()))
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
acum1=[0]
for i in range(n): #累積和ai,bjを求める
acum1.append(acum1[-1]+arr1[i])
acum2=[0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans=0
j=m
for i in range(n+1):
if acum1[i]>k: #ai>Kであれば、どのよう... | n,m,k=list(map(int,input().split()))
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
acum1=[0]
#累積和ai,bjを求める
for i in range(n):
# acum[-1]で一番最後のリストの値を参照している
# うしろからみている
acum1.append(acum1[-1]+arr1[i])
acum2=[0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans=0
j=m
fo... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
a.insert(0, 0)
b.insert(0, 0)
for i in range(n+1):
if sum(a[0:i+1]) > k:
break
for j in range(m+1):
if sum(a[0:i+1]) + sum(b[0:j+1]) > k:
break
... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
amax = 0
samax = 0
for i in range(n):
if samax + a[i]<=k:
amax += 1
samax += a[i]
else:
break
book = amax
ans = book
samax = sum(a[0:amax])
... | p02623 |
import itertools
n, m, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
sa = list(itertools.accumulate(a))
sb = list(itertools.accumulate(b))
max = 0
for i in range(n + 1):
for j in range(m + 1):
if (sa[i] + sb[j] <= k):
... | import itertools
n, m, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
sa = list(itertools.accumulate(a))
sb = list(itertools.accumulate(b))
output = 0
j = m
for i in range(n + 1):
if sa[i] > k:
break
while sa[i] + sb... | p02623 |
from itertools import accumulate
N, M, K = list(map(int,input().split()))
A_list = [0] + list(map(int,input().split()))
B_list = [0] + list(map(int,input().split()))
A_sums_list = list(accumulate(A_list))
B_sums_list = list(accumulate(B_list))
for n in range(N + 1):
if A_sums_list[n] > K:
break
... | from itertools import accumulate
N, M, K = list(map(int,input().split()))
A_list = [0] + list(map(int,input().split()))
B_list = [0] + list(map(int,input().split()))
A_sums_list = list(accumulate(A_list))
B_sums_list = list(accumulate(B_list))
ans = 0
for i, A_sums in enumerate(A_sums_list):
B_min = 0
... | p02623 |
from itertools import accumulate
N, M, K = list(map(int,input().split()))
A_list = [0] + list(map(int,input().split()))
B_list = [0] + list(map(int,input().split()))
A_sums_list = list(accumulate(A_list))
B_sums_list = list(accumulate(B_list))
ans = 0
for i, A_sums in enumerate(A_sums_list):
B_min = -1
... | from itertools import accumulate
N, M, K = list(map(int,input().split()))
A_list = [0] + list(map(int,input().split()))
B_list = [0] + list(map(int,input().split()))
A_sums_list = list(accumulate(A_list))
B_sums_list = list(accumulate(B_list))
ans = 0
for i, A_sums in enumerate(A_sums_list):
B_min = -1
... | p02623 |
from collections import deque
from sys import exit
N, M, K = [int(x) for x in input().split()]
a_book = [0]
for index, i in enumerate(input().split(), 1):
if a_book[index-1] + int(i) <= K:
a_book.append(a_book[index-1] + int(i))
else:
N = index - 1
break
b_book = [0]
for... | from bisect import bisect_right
from time import time
N, M, K = [int(x) for x in input().split()]
a_book = [0]
for index, i in enumerate(input().split(), 1):
if a_book[index-1] + int(i) <= K:
a_book.append(a_book[index-1] + int(i))
else:
N = index - 1
break
b_book = [0]
... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tmp = []
s = 0
for i in a:
if s + i <= k:
tmp.append(i)
s += i
a = tmp
tmp = []
s = 0
for i in b:
if s + i <= k:
tmp.append(i)
s += i
b = tmp
line ... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tmp = []
s = 0
for i in a:
if s + i <= k:
tmp.append(i)
s += i
else:
break
a = tmp
tmp = []
s = 0
for i in b:
if s + i <= k:
tmp.append(i)
... | p02623 |
from itertools import accumulate
from bisect import bisect_right
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
acc_a = list(accumulate(a))
acc_b = list(accumulate(b))
ans = 0
for i, e in enumerate(acc_b):
if e > k:
bre... | from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
INF = 10 ** 18
acc_a = [0] + list(accumulate(a))
acc_b = [0] + list(accumulate(b))
j = m
ans = 0
for i, e in enumerate(acc_a):
while j >= 0 and acc_b[j] > ... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = [0]
for i in range(N):
A_sum.append(A[i] + A_sum[i])
B_sum = [0]
for i in range(M):
B_sum.append(B[i] + B_sum[i])
import bisect
ans = 0
for i in range(N+1):
a = A_sum[i]
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = [0]
for i in range(N):
A_sum.append(A[i] + A_sum[i])
B_sum = [0]
for i in range(M):
B_sum.append(B[i] + B_sum[i])
b_idx = 0
for i in range(1, M+1):
if B_sum[i] <= K:
... | p02623 |
n, m, k = list(map(int, input().split()))
alst = list(map(int, input().split()))
blst = list(map(int, input().split()))
amax = 0
count = 0
for i in alst:
if alst[amax] + count <= k:
count += alst[amax]
amax += 1
else:
break
# print("a:" + str(amax))
"""
while alst[amax] ... | n, m, k = list(map(int, input().split()))
alst = list(map(int, input().split()))
blst = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i, new in enumerate(alst):
if asum[i] + new <= k:
asum.append(asum[i] + new)
else:
break
for i, new in enumerate(blst):
if bsum[i] ... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) <= K:
a_max = N
ans = N
else:
a_total = 0
for i in range(N):
a_total += A[i]
if a_total > K:
break
a_max = i
ans = a_max
f... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0]*N, [0]*M
total = 0
for i in range(N):
total += A[i]
a[i] = total
a = [0] + a
total = 0
for i in range(M):
total += B[i]
b[i] = total
b = [0] + b
ans, j =... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
from itertools import accumulate
ar=[0]+list(accumulate(a))
bru=[0]+list(accumulate(b))
from bisect import bisect_left as bl,bisect_right as br
ans=0
nb=0
for i in range(n,-1,-1):
if ar[i]>k:continue
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
from itertools import accumulate
ar=[0]+list(accumulate(a))
bru=[0]+list(accumulate(b))
from bisect import bisect_left as bl,bisect_right as br
ans=0
for i in range(n+1):
g=ar[i]
if g>k:break
... | p02623 |
import sys
sys.setrecursionlimit(10**6)
def DFS(point,left,right,cnt):
global ans
if point<=k:
if cnt>ans:
ans=cnt
if left<n:
if point+A[left]<=k:DFS(point+A[left],left+1,right,cnt+1)
if right<m:
if point+B[right]<=k:DFS(point+B[right],left,right+1,cnt... | n,m,k=list(map(int,input().split()))
A=[0]+list(map(int,input().split()))
B=[0]+list(map(int,input().split()))
for i in range(1,n+1):
A[i]=A[i-1]+A[i]
for i in range(1,m+1):
B[i]=B[i-1]+B[i]
ans,j=0,m
for i in range(n+1):
if A[i]>k:break
while B[j]>k-A[i]:
j -=1
ans=max(ans,i... | p02623 |
N,M,K=list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
sum_A=0
sum_B=0
for i in range(N):
sum_A +=A[i]
if sum_A>K:
del A[i:]
break
for i in range(M):
sum_B +=B[i]
if sum_B>K:
del B[i:]
break
while sum(A)+s... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= ... | p02623 |
n,m,k=list(map(int,input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
ans=0
a, b=[0], [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
for i in range(n+1):
if k<a[i]:
break
j=m
while b[j]>k-a[i]:
j-=1
... | n,m,k=list(map(int,input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
ans=0
a, b=[0], [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
j=m
for i in range(n+1):
if k<a[i]:
break
while b[j]>k-a[i]:
j-=1
... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=[0]
B=[0]
for i in range(1,len(a)+1):
A.append(a[i-1]+A[i-1])
for i in range(1,len(b)+1):
B.append(b[i-1]+B[i-1])
maxman=0
for i in range(len(A)):
for j in range(len(B)):
... | N, M, K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a, b=[0], [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j=0, M
for i in range(N+1):
if a[i]>K:
break
while b[j]>K-a[i]:
j-=1
... | p02623 |
n,m,k=list(map(int,input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = 1
c = [0]
d = [0]
for i in range(1,n+1):
c.append(c[i-1] + a[i-1])
if(c[i] > k):
c.pop()
break
for i in range(1,m+1):
d.append(d[i-1] + b[i-1])
if(d[i] > ... | import sys
n,m,k=list(map(int,input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = 1
c = [0]
d = [0]
for i in range(1,n+1):
c.append(c[i-1] + a[i-1])
if(c[i] > k):
c.pop()
break
for i in range(1,m+1):
d.append(d[i-1] + b[i-1])
... | p02623 |
N, M, K =list(map(int, input().split()))
A = list(map(int, input().split()))
A.insert(0,0)
B = list(map(int, input().split()))
B.insert(0,0)
len_A = len(A)
len_B = len(B)
dp = [[10**10]*len_B for _ in range(len_A)]
ans = 0
for i in range(len_A):
for j in range(len_B):
if i == 0 and j == 0:
... | N, M, K =list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [0]
sum_B = [0]
for a in range(len(A)):
sum_A.append(sum_A[a]+A[a])
for b in range(len(B)):
sum_B.append(sum_B[b]+B[b])
len_A = len(sum_A)
j = len(sum_B) - 1
ans = 0
for i i... | p02623 |
import bisect
def main():
N, M, K = list(map(int, input().split()))
A = [int(v) for v in input().split()]
B = [int(v) for v in input().split()]
if N < M:
for _ in range(M-N):
A.append(0)
else:
for _ in range(N-M):
B.append(0)
C = [v1+v2 for v1... | import bisect
def main():
N, M, K = list(map(int, input().split()))
A = [int(v) for v in input().split()]
B = [int(v) for v in input().split()]
ruisekiA = [0 for _ in range(N+1)]
ruisekiB = [0 for _ in range(M+1)]
for i in range(N):
ruisekiA[i + 1] = ruisekiA[i] + A[i]
f... | p02623 |
import sys
sys.setrecursionlimit(10**6)
INF = 10**11
def main(input, print):
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
at = [0] * (n+1)
bt = [0] * (m+1)
for i in range(1, n+1):
at[i] = at[i-1]+a[i-1]
f... | import sys
sys.setrecursionlimit(10**6)
INF = 10**11
def main(input, print):
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
at = [0] * (n+1)
bt = [0] * (m+1)
for i in range(1, n+1):
at[i] = at[i-1]+a[i-1]
f... | p02623 |
import os
import sys
from collections import defaultdict, Counter, deque
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepc... | import os
import sys
from collections import defaultdict, Counter, deque
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepc... | p02623 |
from bisect import bisect_left
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
cumA=[0]*(N+1)
cumB=[0]*(M+1)
for i in range(N):
cumA[i+1]=cumA[i]+A[i]
for i in range(M):
cumB[i+1]=cumB[i]+B[i]
ans=0
for i in range(N+1):
r=K-cumA[i]
... | def bisect(x):
l,r=-1,M+1
while(r-l>1):
mid=(l+r)//2
if cumB[mid]>=x:
r=mid
else:
l=mid
return l
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
cumB=[0]*(M+1)
for i in range(M):
cumB[i... | p02623 |
import random
n, m, k = list(map(int, input().split()))
# n, m, k = random.randint(1, 10**5), random.randint(1, 10**5), random.randint(10**8, 10**9)
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# a_list = [random.randint(1, 10**8) for i in range(n)]
# b_list = [random.randint(... | import random
n, m, k = list(map(int, input().split()))
# n, m, k = random.randint(1, 10**5), random.randint(1, 10**5), random.randint(10**8, 10**9)
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# a_list = [random.randint(1, 10**3) for i in range(n)]
# b_list = [random.randint(... | p02623 |
import random
n, m, k = list(map(int, input().split()))
# n, m, k = random.randint(1, 10**5), random.randint(1, 10**5), random.randint(10**8, 10**9)
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# a_list = [random.randint(1, 10**3) for i in range(n)]
# b_list = [random.randint(... | import random
n, m, k = list(map(int, input().split()))
# n, m, k = random.randint(1, 10**5), random.randint(1, 10**5), random.randint(10**8, 10**9)
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# a_list = [random.randint(1, 10**3) for i in range(n)]
# b_list = [random.randint(... | p02623 |
import bisect
import sys
from itertools import accumulate
input = sys.stdin.readline
def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
B_cumsum = list(accumulate(B))
ans = 0
time = 0
for i in range... | import bisect
import sys
from itertools import accumulate
input = sys.stdin.readline
def main():
N, M, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
B_cumsum = tuple(accumulate(B))
ans = 0
time = 0
for i in ra... | p02623 |
import sys
from itertools import accumulate
input = sys.stdin.readline
def is_ok(a, key, idx):
if a[idx] <= key:
return True
else:
return False
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (abs(ok - ng) > 1):
... | import sys
from itertools import accumulate
input = sys.stdin.readline
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = m... | p02623 |
import sys
from itertools import accumulate
input = sys.stdin.readline
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = m... | import sys
from itertools import accumulate
input = sys.stdin.readline
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (ng - ok > 1):
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = mid
... | p02623 |
import sys
from itertools import accumulate
input = sys.stdin.readline
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (ng - ok > 1):
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = mid
... | import sys
from itertools import accumulate
input = sys.stdin.readline
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
while (ng - ok > 1):
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = mid
... | p02623 |
n,m,k = list(map(int,input().split()))
A = [int(p) for p in input().split()]
B = [int(p) for p in input().split()]
a,b = [0],[0]
a_apnd = a.append
b_apnd = b.append
for i in range(n):
a_apnd(a[i]+A[i])
for i in range(m):
b_apnd(b[i]+B[i])
count = 0
for i in range(n+1):
if k<a[i]:
break
for... | n,m,k = list(map(int,input().split()))
A = [int(p) for p in input().split()]
B = [int(p) for p in input().split()]
a,b = [0],[0]
a_apnd = a.append
b_apnd = b.append
for i in range(n):
a_apnd(a[i]+A[i])
for i in range(m):
b_apnd(b[i]+B[i])
count = 0
t = m
for i in range(n+1):
if k<a[i]:
break... | p02623 |
import sys
readline = sys.stdin.readline
N,M,K = list(map(int,readline().split()))
A = [0] + list(map(int,readline().split()))
B = [0] + list(map(int,readline().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
import bisect
ans = 0
for i in range... | import sys
readline = sys.stdin.readline
N,M,K = list(map(int,readline().split()))
A = [0] + list(map(int,readline().split()))
B = [0] + list(map(int,readline().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
ans = 0
b_ind = len(B) - 1
for i in ... | p02623 |
import bisect
from collections import deque
n,m,k=list(map(int,input().split()))
a=deque(list(map(int,input().split())))
b=deque(list(map(int,input().split())))
a_sum=deque()
b_sum=deque()
a_sum.append(0)
b_sum.append(0)
for i in range(n):
a_sum.append(a_sum[i]+a[i])
for j in range(m):
b_sum.append(... | import bisect
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a_sum=[]
b_sum=[]
a_sum.append(0)
b_sum.append(0)
for i in range(n):
a_sum.append(a_sum[i]+a[i])
for j in range(m):
b_sum.append(b_sum[j]+b[j])
ans=0
for x in range(n+1):
timeco... | p02623 |
anum,bnum,acc = list(map(int,input().split()))
alist = list(map(int,input().split()))
blist = list(map(int,input().split()))
ans = 0;a = 0;b = 0
while sum(alist[:a+1]) <= acc:
if a == anum:
break
a += 1
while sum(alist[:a]+blist[:b+1]) <= acc:
if b == bnum:
break
b += 1
... | anum,bnum,acc = list(map(int,input().split()))
alist = list(map(int,input().split()))
blist = list(map(int,input().split()))
asum = [0]
bsum = [0]
ans = 0
for i in range(anum):
asum.append(asum[i]+alist[i])
for i in range(bnum):
bsum.append(bsum[i]+blist[i])
b = bnum
for a in range(anum+1):
... | p02623 |
number=list(map(int,input().split()))
N,M,K=number[0],number[1],number[2]
A=list(map(int,input().split()))
B=list(map(int,input().split()))
i=len(A)
C=A
answer=0
l=M
if sum(A)>K:
while sum(C)>=K:
i-=1
C=A[:i]
for j in range(len(C),0,-1):
C=C[:j]
while sum(B[:l])>K-sum(C):
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K... | number=list(map(int,input().split()))
N,M,K=number[0],number[1],number[2]
A=list(map(int,input().split()))
B=list(map(int,input().split()))
answer=0
j=M
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
for i in range(N+1):
if a[i]>K:
br... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 0
aa = 0
for i in range(n+1):
cnt = 0
x = k
x -= aa
if i != n:
aa += a[i]
if x<0:
break
while x>0 and cnt<m:
x -= b[cnt... | n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
x = [0]
y = [0]
for i in range(n):
x.append(x[i]+a[i])
for i in range(m):
y.append(y[i]+b[i])
ans = 0
cnt = m
for i in range(n+1):
if k-x[i]<0:
break
... | p02623 |
n,m,k = list(map(int, input().split()))
from collections import deque
an = list(map(int, input().split()))
bn = list(map(int, input().split()))
an = [0] + an
bn = bn
vMax = 10**9+10
import itertools
accum_a = [0]
accum_b = [0]
candidate = []
for b_i in range(0,len(bn)):
i_ = accu... | n,m,k = list(map(int, input().split()))
from collections import deque
an = list(map(int, input().split()))
bn = list(map(int, input().split()))
accum_a = [0]
accum_b = [0]
for a_i in range(0,len(an)):
sumCandidate = accum_a[-1] + an[a_i]
if sumCandidate > k:
break
accum_a.app... | p02623 |
import sys
from itertools import accumulate
from bisect import bisect_right
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, K, *AB = list(map(int, read().split()))
A = AB[:N]
... | import sys
from itertools import accumulate
from bisect import bisect_right
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, K, *AB = list(map(int, read().split()))
A = AB[:N]
... | p02623 |
import sys
readline = sys.stdin.readline
from bisect import bisect_right
def main():
N, M, K = list(map(int, readline().rstrip().split()))
A = list(map(int, readline().rstrip().split()))
B = list(map(int, readline().rstrip().split()))
a_acc, b_acc = A[:], B[:]
for i in range(1, N):
... | import sys
readline = sys.stdin.readline
from bisect import bisect_right
def main():
N, M, K = list(map(int, readline().rstrip().split()))
A = list(map(int, readline().rstrip().split()))
B = list(map(int, readline().rstrip().split()))
a_acc, b_acc = A[:], B[:]
for i in range(1, N):
... | p02623 |
from itertools import accumulate, permutations
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0] + list(accumulate(A))
B = [0] + list(accumulate(B))
ans = 0
for i in range(N+1):
a = A[i]
if a > K:
... | from itertools import accumulate, permutations
import bisect
# ----------
INF = float("inf")
MOD = 10 ** 9 + 7
# ----------
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0] + list(accumulate(A))
B = [0] + list(accumulate(B))
a... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
ans = 0
max_num = 0
j = 0
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
for i in range(N+1):
if a[i] > K:
break
else:
... | N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
ans = 0
max_num = 0
j = M
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
for i in range(N+1):
if a[i] > K:
break
else:
... | p02623 |
from collections import deque
from bisect import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
R_A = deque()
R_A.append(0)
i = 0
while i < N:
R_A.append(R_A[-1]+A[i])
i += 1
B = list(map(int, input().split()))
R_B = deque()
R_B.append(0)
i = 0
while i < M:
... | from bisect import bisect
N, M, K = list(map(int, input().split()))
A = [0]+list(map(int, input().split()))
B = list(map(int, input().split()))
R_B = [0]*(M+1)
i = 0
while i < M:
R_B[i+1] = R_B[i]+B[i]
i += 1
ans = 0
i = 0
while i <= N and K >= A[i]:
K -= A[i]
idx = bisect(R_B, K)
ans = max(a... | p02623 |
def main():
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [A[0]]
sum_B = [B[0]]
for i in range(n - 1):
sum_A.append(sum_A[i] + A[i + 1])
for i in range(m - 1):
sum_B.append(sum_B[i] + B... | def main():
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [A[0]]
sum_B = [B[0]]
for i in range(n - 1):
sum_A.append(sum_A[i] + A[i + 1])
for i in range(m - 1):
sum_B.append(sum_B[i] + B... | p02623 |
from sys import stdin
import bisect
def main():
input = stdin.readline
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [0] * (n + 1)
for i in range(n):
c[i + 1] = c[i] + a[i]
d = [0] * (m + 1)
for ... | from sys import stdin
import bisect
def main():
input = stdin.readline
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [0] * (n + 1)
for i in range(n):
c[i + 1] = c[i] + a[i]
d = [0] * (m + 1)
for ... | p02623 |
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
A_cumulative_sum = [0]
B_cumulative_sum = [B[0]]
for i in range(N):
A_cumulative_sum.append(A[i] + A_cumulative_sum[i])
for i in range(1, M):
B_cumulative_sum.append(... |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
'''
with open('./b09.txt') as f:
N, M, K = map(int, f.readline().split())
A = list(map(int, f.readline().split()))
B = list(map(int, f.readline().split()))
'''
A_cnt = 0
B_cnt = 0
a... | p02623 |
N, M, K = list(map(int, input().split()))
INF = int(1e18)
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = A[:]
B = B[:]
i, j = 0, 0
mcnt = 0
tmp = M+1
ccnt = 0
while tmp != 0:
ccnt += 1
tmp //= 2
LA = [0 for _ in range(N+1)]
LB = [0 for _ in range(M+1)]
for i in range(N):
... | N, M, K = list(map(int, input().split()))
INF = int(1e18)
A = list(map(int, input().split()))
B = list(map(int, input().split()))
i, j = 0, 0
mcnt = 0
tmp = M+1
ccnt = 0
while tmp != 0:
ccnt += 1
tmp //= 2
LA = [0 for _ in range(N+1)]
LB = [0 for _ in range(M+1)]
for i in range(N):
LA[i+1] = LA[i] +... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
memo = [[None] * (M + 1) for _ in range(N + 1)]
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
A.insert(0, 0)
B.insert(0, 0)
r = 0
for i, a in enu... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
A.insert(0, 0)
B.insert(0, 0)
r = 0
for i, a in enumerate(A):
min_idx = 0
max_idx = len(B)... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
for i in range(n + 1):
if a[i] > k:
break
for j in ra... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
j = m
for i in range(n + 1):
if a[i] > k:
break
wh... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
j = m
for i in range(n + 1):
if a[i] > k:
break
wh... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A = [0]
B = [0]
ans = 0
for i in range(n):
A.append(A[i] + a[i])
for i in range(m):
B.append(B[i] + b[i])
j = m
for i in range(n + 1):
if A[i] > k:
break
whil... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
calc_A = [0]
calc_B = [0]
for i in range(N):
calc_A.append(calc_A[i] + A[i])
for j in range(M):
calc_B.append(calc_B[j] + B[j])
ans = 0
for i in range(N+1):
j = M
if ca... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
check_A = [0]
check_B = [0]
for a in range(N):
check_A.append(check_A[a] + A[a])
for b in range(M):
check_B.append(check_B[b] + B[b])
ans = 0
j = M
for i in range(N+1):
if ... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i]+A[i])
for j in range(m):
b.append(b[j]+B[j])
#print(a,b)
ans = 0
for i in range(n+1):
j = 0
if a[i] > k:
break
while (k - a[... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i]+A[i])
for j in range(m):
b.append(b[j]+B[j])
#print(a,b)
ans = 0
j = m
for i in range(n+1):
if a[i] > k:
break
while (k - a[... | p02623 |
X=int(eval(input()))
if X==7 or X==5 or X==3:
print('YES')
else:
print('NO') | N=int(eval(input()))
if N==3 or N==5 or N==7:
print('YES')
else:
print('NO') | p03210 |
x = int(eval(input()))
if x==3 or x==5 or x==7:
print("YES")
else:
print("NO")
| X = int(eval(input()))
if(X == 3 or X == 5 or X == 7):
print("YES")
else:
print("NO") | p03210 |
x = int(eval(input()))
if x == 3 or x == 5 or x == 7:
print("YES")
else:
print("NO") | x = int(eval(input()))
if x in [3,5,7]:
print("YES")
else:
print("NO") | p03210 |
x = int(eval(input()))
if x in [3, 5, 7]:
print('YES')
else:
print('NO') | print((['NO','YES'][int(eval(input()))in[3,5,7]])) | p03210 |
x = int(eval(input()))
if x == 5 or x == 3 or x == 7:
print("YES")
else:
print("NO")
| x = int(eval(input()))
if x == 3 or x == 5 or x == 7:
ans = 'YES'
else:
ans = 'NO'
print(ans)
| p03210 |
X = int(eval(input()))
if X == 7 or X == 5 or X == 3:
print('YES')
else:
print('NO') | X = int(eval(input()))
if X in (3, 5, 7):
print('YES')
else:
print('NO') | p03210 |
X = int(eval(input()))
if X == 3 or X == 5 or X == 7:
print("YES")
else:
print("NO") | X = int(eval(input()))
if X == 7 or X == 5 or X == 3:
print("YES")
else:
print("NO")
| p03210 |
N = int(eval(input()))
if N==3 or N==5 or N==7:
print("YES")
else:
print("NO") | N = int(eval(input()))
print(("YES" if N==3 or N==5 or N==7 else "NO")) | p03210 |
X = int(eval(input()))
if X == 3 or X == 5 or X == 7:
print("YES")
else :
print("NO") | print(("YES" if [7, 5, 3].count(int(eval(input()))) else "NO")) | p03210 |
print(('YES' if int(eval(input())) in [3, 5, 7] else 'NO')) | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
X = ir()
bl = (3 <= X <= 7) and X&1
print(('YES' if bl else 'NO'))
| p03210 |
N = int(eval(input()))
if N == 3 or N == 5 or N == 7:
print("YES")
else:
print("NO")
| N = int(eval(input()))
print((["NO", "YES"][N == 3 or N == 7 or N == 5])) | p03210 |
a=int(eval(input()))
print(("YES"if a==3 or a==5 or a==7 else"NO"))
| s=[3,5,7]
print(("YES"if s.count(int(eval(input())))>0 else"NO")) | p03210 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
if n ==7 or n ==5 or n == 3:
print("YES")
else: print("NO") | def main():
n = int(eval(input()))
# t, a = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
if n == 7 or n == 5 or n==3 :
print("YES")
else: print("NO")
if __name__ == '__main__':
main()
| p03210 |
a=input();print("NO") if a!="5" and a!="3" and a!="7" else print("YES")
| print("YES") if input()in["3","5","7"] else print("NO")
| p03210 |
x=int(eval(input()))
print(("YES" if x==7 or x==5 or x==3 else "NO"))
| x = int(eval(input()))
print(("YES" if x in [7, 5, 3] else "NO"))
| p03210 |
X = int(eval(input()))
print(('YES' if X in (3,5,7) else 'NO')) | X = int(eval(input()))
print(('YES' if X in (7,5,3) else 'NO')) | p03210 |
a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO")) | a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO")) # if a in (3, 5, 7) else | p03210 |
X = int(eval(input()))
if X in [3, 5, 7]:
print("YES")
else:
print("NO")
| n=int(eval(input()))
print((["NO","YES"][n in {3,5,7}])) | p03210 |
x = int(eval(input()))
if x in (7,5,3):
print('YES')
else:
print('NO')
| n = int(eval(input()))
if n in (7, 5, 3):
print('YES')
else:
print('NO')
| p03210 |
X = int(eval(input()))
if(X in [7, 5, 3]):
print("YES")
else:
print("NO") | x = int(eval(input()))
ans = "NO"
if x in [7, 5, 3]:
ans = "YES"
print(ans) | p03210 |
X = int(eval(input()))
if X == 7 or X == 5 or X == 3:
print('YES')
else:
print('NO') | x = int(eval(input()))
if x in [7, 5, 3]:
print('YES')
else:
print('NO') | p03210 |
n, m, c = list(map(int, input().split()))
l = (0,) + tuple(map(int, input().split()))
a = [0] * (c + 1)
w = [tuple(map(int, input().split())) for _ in range(n)]
w.sort(key = lambda x:x[1], reverse = True)
v = 0
for i in range(n):
if a[w[i][0]] < l[w[i][0]]:
v += w[i][1]
a[w[i][0]] += 1
... | n, m, c = list(map(int, input().split()))
l = [0] + list(map(int, input().split()))
w = [tuple(map(int, input().split())) for _ in range(n)]
w.sort(key = lambda x:x[1], reverse = True)
v = 0
p = 0
for i in range(n):
if l[w[i][0]]:
l[w[i][0]] -= 1
v += w[i][1]
p += 1
if p =... | p02126 |
import os
import string
import sys
from collections import Counter
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
S = sys.stdin.buffer.readline().decode(... | import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
# 解説
S = sys.stdin.buffer.readline().decode().rstrip()
N = len(S)
cs = [0] * N... | p03570 |
def main():
import sys
from collections import defaultdict
from bisect import bisect_left
input = sys.stdin.readline
S = input().rstrip('\n')
N = len(S)
A = [ord(s)-97 for s in S]
H = [0] * (N+1)
h2i = defaultdict(list)
for i in range(N):
H[i+1] = H[i] ^ (1... | def main():
import sys
from bisect import bisect_left
input = sys.stdin.readline
S = input().rstrip('\n')
N = len(S)
A = [ord(s)-97 for s in S]
H = [0] * (N+1)
h2i = {}
for i in range(N):
H[i+1] = H[i] ^ (1 << A[i])
if H[i+1] in h2i:
h2i[H[... | p03570 |
while 1:
n,a,b=list(map(int,input().split()))
if n==a==b==0:break
c=0;d=[1]+[0]*2000000
for i in range(0,n+1):
if d[i]:d[i+a]=d[i+b]=1
else:c+=1
print(c) | while 1:
n,a,b=list(map(int,input().split()))
if n==a==b==0:break
c=0;d=[1]*(n+1)
for x in range(a):
for i in range(x*b,n+1,a):d[i]=0
print((sum(d))) | p00687 |
N = int(eval(input()))
array = list(map(int, input().split()))
ans = 0
next = 1
a = True
while (a):
a = False
b = False
for i in range(next,len(array)):
if array[i] < array[i-1]:
array[i] = array[i] + 1
ans += 1
a = True
if b == False:
... | N = int(eval(input()))
array = list(map(int, input().split()))
ans = 0
next = 1
a = True
while (a):
a = False
b = False
for i in range(next,len(array)):
if array[i] < array[i-1]:
ans += array[i-1] - array[i]
array[i] = array[i - 1]
a = True
... | p02578 |
import sys
sys.setrecursionlimit(10**7)
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import ceil
def main():
n, *a = list(map(int, read().split()))
#a2 = a[::-1]
r = 0
for i1 in range(1, n):
if max(a[:i1]) > a[i1]:
r += max(a[:i1]) - a[i1]
print(r... | import sys
sys.setrecursionlimit(10**7)
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
r = 0
st = a[0]
for ae in a[1:]:
if st > ae:
r += st - ae
else:
st = ae
print(r)
if __name__ == '... | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
m = a[0]
for i in range(1, n):
m = max(a[i-1], m)
if a[i] - m < 0:
ans += abs(a[i] - m)
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
m = 1
ans = 0
for i in range(n):
if m > a[i]:
ans += m - a[i]
m = max(a[i], m)
print(ans) | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
base = a[0]
ans = 0
for i in range(1, n):
base = max(base, a[i])
ans += base - a[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
fllor = a[0]
ans = 0
for i in range(n):
if fllor > a[i]:
ans += fllor - a[i]
else:
fllor = max(fllor, a[i])
print(ans) | p02578 |
# coding: utf-8
# Your code here!
# import math
# from decimal import Decimal
# from collections import deque, Counter
# from itertools import product
def LI():
return list(map(int,input().split()))
def OPEN():
return list(map(int,open(0).read().split()))
n,*a=OPEN()
now=a[0]
a... | n,*a=list(map(int,open(0).read().split()))
now=a[0]
ans=0
for i in range(n):
if a[i]<now:
ans+=(now-a[i])
now=max(a[i],now)
print(ans)
| p02578 |
n = int(eval(input()))
wa = 0
l = list(map(int, input().split()))
for i in range(1, n):
if max(l[:i]) >= l[i]:
wa += max(l[:i]) - l[i]
print(wa) | n = int(eval(input()))
wa = 0
m = 0
l = list(map(int, input().split()))
for i in range(n):
m = max(l[i], m)
if m > l[i]:
wa += m - l[i]
print(wa) | p02578 |
n=int(eval(input()))
a=list(map(int,input().split()))
s=0
if sorted(a) == a:
print(s)
exit()
while len(a)>0:
x=max(a)
k=a.index(x)
s=s+x*(len(a)-1-k)-sum(a[k+1:])
a=a[:k]
print(s)
| n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
mx=a[0]
for x in a:
if mx>x:ans+=mx-x
else:mx=x
print(ans)
| p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range (0,N-1):
while(A[i]>A[i+1]):
count += 1
A[i+1] += 1
if(A[i]<=A[i+1]):
continue
print(count) | N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
max = A[0]
for i in range (0,N):
while(max>A[i]):
count = count + (max - A[i])
A[i] = max
# print(A)
if(max<=A[i]):
max = A[i]
# print(A)
print(count) | p02578 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=mx=0
for x in A:
mx=max(mx,x)
ans+=mx-x
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
ans=mx=0
for x in a:
mx=max(mx,x)
ans+=mx-x
print(ans)
| p02578 |
N = int(eval(input()))
A = list(map(int, input().split()))
mae = []
stepsum = 0
for i in A:
if mae and max(mae) > i:
stepsum += max(mae)-i
mae.append(i)
print(stepsum) | N = int(eval(input()))
A = list(map(int, input().split()))
heighest = 0
stepsum = 0
for i in A:
if heighest < i:
heighest = i
continue
else:
stepsum += heighest-i
print(stepsum) | p02578 |
def main():
n = int(eval(input()))
a = [int(x) for x in input().split()]
cnt = 0
while n > 1:
a_max = max(a[:n])
a_max_i = a.index(a_max)
if a_max_i != n-1:
cnt += (n - a_max_i) * a_max - sum(a[a_max_i:n])
n = a_max_i
print(cnt)
if __name__ ==... | def main():
n = int(eval(input()))
A = [int(x) for x in input().split()]
maxv = 0
ans = 0
for a in A:
if maxv > a:
ans += maxv - a
else:
maxv = a
print(ans)
if __name__ == '__main__':
main() | p02578 |
a=int(eval(input()))
b=list(map(int,input().split()))
c=0
if a==0:
print((0))
else:
for i in range(a-1):
while b[i]>b[i+1]:
b[i+1]=b[i+1]+1
c=c+1
print(c) | a=int(eval(input()))
b=list(map(int,input().split()))
c=0
for i in range(a-1):
if b[i]>b[i+1]:
c=c+b[i]-b[i+1]
b[i+1]=b[i]
print(c) | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
M = a[0]
if n != 1:
for i in range(n - 1):
if M > a[i + 1]:
x += (M - a[i + 1])
else:
M = a[i + 1]
print(x) | n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
h = a[0]
for i in range(n):
if a[i] > h:
h = a[i]
else:
x += (h - a[i])
print(x) | p02578 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
for i in range(n-1):
while True:
if a[i] > a[i + 1]:
a[i + 1] += 1
x += 1
if a[i] <= a[i + 1]:
break
print(x) | N = int(eval(input()))
A = [int(x) for x in input().split()]
ans = 0
for i in range(N-1):
if A[i]>A[i+1]:
ans += A[i]-A[i+1]
A[i+1] = A[i]
print(ans) | p02578 |
n = int(eval(input()))
li = list(map(int,input().split()))
ans = 0
for i in range(1,n):
while li[i]<li[i-1]:
li[i] +=1
ans+=1
print(ans) | n = int(eval(input()))
li = list(map(int,input().split()))
ma = 0
ans = 0
for i in range(n):
if li[i]>ma:
ma = li[i]
else:
ans+=ma-li[i]
print(ans) | p02578 |
import sys
cin = sys.stdin.readline
n = int(cin())
height = list(map(int, cin().split()))
last, ans = 0, 0
for i in height:
diff = last - i
if diff > 0:
ans += diff
continue
last = i
print(ans)
| import sys
cin = sys.stdin.readline
n = cin()
height = list(map(int, cin().split()))
last, ans = 0, 0
for i in height:
diff = last - i
if diff > 0:
ans += diff
continue
last = i
print(ans)
| p02578 |
#!/usr/local/bin/python3
N = int(eval(input()))
A = list(map(int, input().split()))[::-1]
ans = 0
while N != 0:
m = max(A)
idx = A.index(m) + 1
ans += (len(A[:idx]) * m) - sum(A[:idx])
A = A[idx:]
N -= idx
print(ans)
| #!/usr/local/bin/python3
N = int(eval(input()))
A = list(map(int, input().split()))
m = ans = 0
for i in range(N):
m = max(m, A[i])
ans += m - A[i]
print(ans)
| p02578 |
from sys import stdin, setrecursionlimit
#input = stdin.buffer.readline
setrecursionlimit(10 ** 7)
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
... | from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
answer = 0
max_a = A[0]
for a in A:
max_a = max(max_a, a)
answer += max_a - a
print(answer) | p02578 |
def main():
_ = int(eval(input()))
A = [int(i) for i in input().split()]
ma = A[0]
ans = 0
for a in A[1:]:
if ma > a:
ans += ma - a
if ma < a:
ma = a
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
ma = A[0]
ans = 0
for a in A:
ma = max(ma, a)
ans += ma - a
print(ans)
if __name__ == '__main__':
main()
| p02578 |
N = int(eval(input()))
li = list(map(int, input().split()))
a = []
b = 0
for i in li:
a.append(i)
c = max(a)
if i < c:
b = b + c - i
print(b)
| N = int(eval(input()))
li = list(map(int, input().split()))
a = 0
b = 0
for i in li:
if a < i:
a = i
if i < a:
b = b + a - i
print(b) | p02578 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for i in range(1,n):
while True:
if a[i] >= a[i-1]:
break
else:
a[i] += 1
ans += 1
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if a[i] >= a[i-1]:
continue
else:
step = a[i-1] - a[i]
a[i] += step
ans += step
print(ans)
| p02578 |
n = int(eval(input()))
num_list = [int(i) for i in input().split()]
count = 0
while num_list:
max_num_index = num_list.index(max(num_list))
for i in range(max_num_index,len(num_list)):
count += (num_list[max_num_index]-num_list[i])
num_list[i] = num_list[max_num_index]
num_list.rem... | n = int(eval(input()))
num_list = [int(i) for i in input().split()]
count = 0
for i in range(1,n):
if num_list[i] < num_list[i-1]:
count += (num_list[i-1] - num_list[i])
num_list[i] = num_list[i-1]
print(count) | p02578 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.