problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03617 | s753501053 | Accepted | q,h,s,d,n=map(int,open(0).read().split())
if n%2==0:
print(min(8*q,4*h,2*s,d)*(n//2))
else:
print(min(8*q,4*h,2*s,d)*(n//2)+min(4*q,2*h,s)) |
p02909 | s153747615 | Wrong Answer | S = input()
if S == "Sunny":
print ('cloudy')
elif S == "Cloudy" :
print ('Rainy')
else :
print ('Sunny') |
p02628 | s015406311 | Wrong Answer | N, K = map(int,input().split())
List_1 = sorted(list(map(int, input().split())), reverse=True)
K = K+1
ans = sum(List_1[:K]) |
p03448 | s949227328 | Wrong Answer | A = int(input())
B = int(input())
C = int(input())
X = int(input())
ans = 0
for a in range(A+1):
if 500 * a > X:
break
for b in range(B+1):
if 500 * b > X:
break
x = X - 500*a -100*b
if x%50 == 0 and x >= 0:
if x//50 <= C:
ans += 1
prin... |
p03474 | s044219135 | Accepted | import re
a, b = [int(x) for x in input().split()]
s = input()
print("Yes" if re.search("\\d{{{}}}-\\d{{{}}}".format(a, b), s) is not None else "No") |
p03455 | s214378214 | Accepted | a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd") |
p03284 | s059578242 | Accepted |
ans = float("inf")
def solve():
N, K = map(int, input().split())
if N % K:
print(1)
else:
print(0)
if __name__ == "__main__":
solve()
|
p03221 | s775298459 | Accepted | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
import collections
import bisect
n,m = readInts()
p = [[int(j) for j in... |
p02700 | s220111456 | Accepted | A, B, C, D = map(int, input().split())
while 1:
C -= B
if C <= 0:
print('Yes')
exit()
A -= D
if A <= 0:
print('No')
exit() |
p03281 | s265279283 | Wrong Answer | n=int(input())
p=[3,5,7,11,13]
x=[]
for i in range(5):
for j in range(i):
for k in range(j):
if n >= p[i]*p[j]*p[k]:
x.append(i*j*k)
cnt=len(x)
if 135 <= n <189:
cnt += 1
elif n <= 189:
cnt += 2
else:
pass
print(cnt) |
p02714 | s385940505 | Accepted | n = int(input())
s = input()
ans = s.count("R") * s.count("G") * s.count("B")
for i in range(n):
for j in range(i+1, n):
k = 2 * j - i
if k >= n:
break
ans -= s[k] != s[i] != s[j] != s[k]
print(ans) |
p03627 | s525407097 | Wrong Answer | import collections
n = int(input())
l = map(int, input().split())
c = collections.Counter(l)
c = sorted(c.items(), key=lambda c:c[0], reverse=True)
ans = 1
cnt = 0
for key,val in c:
if val>=2:
ans*=key
cnt+=1
if cnt == 2:
break
else:
ans = 0
print(ans) |
p03071 | s142434230 | Wrong Answer | a, b = map(int, input().split())
preans = max(a*2-1,b*-1)
ans=max(preans,a+b)
print(ans) |
p04045 | s169743773 | Accepted | n, k = map(int, input().split())
d = list(map(str, input().split()))
possible = [str(i) for i in range(10) if str(i) not in d]
for i in range(n,10**5):
for j in str(i):
if j not in possible:
break
else:
print(i)
exit() |
p03557 | s811924220 | Accepted | import sys
from bisect import bisect_left, bisect_right
n = int(sys.stdin.buffer.readline())
a = list(map(int, sys.stdin.buffer.readline().split()))
b = list(map(int, sys.stdin.buffer.readline().split()))
c = list(map(int, sys.stdin.buffer.readline().split()))
a.sort()
b.sort()
c.sort()
ans = 0
for j in b:
ans += ... |
p02972 | s396134835 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans_l = [0]*n
for i in reversed(range(1,n)):
if sum(ans_l[(i-i)::i])%2 != a[i]:
ans_l[i] += 1
if sum(ans_l) != a[0]:
ans_l[0] += 1
ans = []
for i in range(n):
if ans_l[i]==1:
ans.append(i+1)
print(len(ans))
if len(ans)>0:
print(" ".joi... |
p02899 | s711088443 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
l = [[] for i in range(n)]
for i in range(n):
l[i] = [A[i], i+1]
print(l)
l.sort()
print(l)
ans = [0 for i in range(n)]
for i in range(n):
ans[i] = l[i][1]
print(*ans) |
p02796 | s707277363 | Accepted | H = int(input())
x = [[float('inf')]*2 for i in range(H)]
for i in range(H):
X, L = map(int, input().split())
x[i][0] = X - L
x[i][1] = X + L
from operator import itemgetter
sf = sorted(x, key=itemgetter(1))
ans = 0
last = float('inf')*-1
for i in range(H):
if last <= sf[i][0]:
ans += 1
... |
p02861 | s694686987 | Accepted | import math
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
dis = []
for i in range(n-1):
for j in range(i+1, n):
dis.append(((xy[i][0]-xy[j][0])**2+(xy[i][1]-xy[j][1])**2)**(1/2))
print(2*math.factorial(n-1)*sum(dis)/(math.factorial(n))) |
p03633 | s170488457 | Wrong Answer | def gcd(a,b):
r=1
while r!=0:
r=a%b
a=b
b=r
return a
g=1
n = int(input())
t = [int(input()) for i in range(n)]
t1 = list(set(t))
n1 = len(t1)
for i in range(n1):
g = gcd(g,t1[i])
ans = g
for i in range(n1):
ans *= t1[i]//g
print(ans)
|
p02791 | s669299301 | Accepted | n=int(input())
p=list(map(int,input().split()))
m=p[0]
total=0
for i in range(0,n):
if m>=p[i]:
m=p[i]
total+=1
print(total)
|
p02789 | s567229540 | Wrong Answer | N, M=map(int, input().split())
if N==M:
print('YES')
else:
print('NO')
|
p02606 | s885008324 | Accepted | L, R, d = list(map(int, input().split()))
s = [i for i in range(L,R+1)]
ans = 0
for i in s:
if i % d == 0:
ans += 1
print(ans) |
p02690 | s110476732 | Accepted | import sys
x = int(input())
for a in range(-1000, 1000):
for b in range(-1000, 1000):
if a ** 5 - b ** 5 == x:
print(a, b)
sys.exit() |
p03254 | s482743740 | Accepted | N, x = map(int, input().split())
a = list(map(int, input().split()))
count = 0
maxcandy = 0
X = x
A = sorted(a)
for i in range(N):
maxcandy += A[i]
for i in range(N):
if x >= A[i]:
x = x - A[i]
count += 1
else:
break
if maxcandy < X:
print(count-1)
else:
print(count)
|
p03759 | s279527288 | Accepted | a,b,c =map(int,input().split())
if b-a == c-b:
print("YES")
else:
print("NO") |
p03471 | s597281147 | Wrong Answer | n, y = map(int, input().split(' '))
a = False
for i in range(0, n+1):
for i2 in range(0, n-i):
c = n - i2 - i
if i*10000 + i2 * 5000 + c * 1000 == y:
print (i, i2, c)
a = True
if a == False:
print ("-1 -1 -1")
|
p03274 | s148872256 | Accepted | n, k = map(int, input().split())
xxx = list(map(int, input().split()))
print(min(min(abs(l), abs(r)) + r - l for l, r in zip(xxx, xxx[k - 1:]))) |
p02862 | s648457024 | Accepted | X, Y = map(int, input().split())
mod = 10**9 + 7
def comb(n, r, mod):
X = 1
Y = 1
for i in range(1,r+1):
X = (X*(n-i+1))%mod
Y = (Y*i)%mod
return (X*pow(Y, mod-2, mod))%mod
if (X+Y)%3 != 0 :
print(0)
elif X < (X+Y)//3 or Y < (X+Y)//3 :
print(0)
else :
i = X - (X+Y)//3
p... |
p02577 | s247085195 | Wrong Answer | N = input()
array = list(map(int, N))
S = sum(array)
if S%9 == 0:
print('YES')
else:
print('NO') |
p03061 | s739812015 | Wrong Answer | from itertools import combinations
def gcd(a,b):
if(b==0):
return a;
return gcd(b,a%b);
mx =0;
n =int(input())
a = list(map(int,input().split()))
x = combinations(a,2)
for a,b in x:
if mx<gcd(a,b):
mx = gcd(a,b)
print(mx)
|
p03011 | s674697195 | Wrong Answer | i = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる
i=(sorted(i,reverse=True))
print(i[0]+i[1]) |
p02971 | s905924550 | Wrong Answer | n=int(input())
a=[]
for i in range(n):
a.append(input())
sort_a=sorted(a,reverse=True)
if sort_a[0]==sort_a[1]:
for _ in range(n):
print(sort_a[0])
else:
for i in range(n):
if a[i]==sort_a[0]:
print(sort_a[1])
else:
print(sort_a[0]) |
p03962 | s121815502 | Accepted | A = set(input().split())
print(len(A))
|
p02780 | s688942572 | Accepted | def main(N,K,p):
sumi = 0
ruiseki = [0] * (N+1)
for i in range(N):
ruiseki[i+1] = ruiseki[i] + p[i]
for j in range(N-K+1):
sumi = max(sumi, (ruiseki[j+K]-ruiseki[j]))
return (sumi + K) / 2
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(main(N,K,p))
|
p02797 | s938635615 | Accepted | N,K,S=map(int, input().split())
ans=[0]*N
if K==0:
if S==10**9:
for i in range(N):
ans[i]=S-1
else:
for i in range(N):
ans[i]=S+1
else:
for i in range(K):
ans[i]=S
if S==10**9:
for i in range(K,N):
ans[i]=S-1
else:
for i in ... |
p03644 | s791810895 | Accepted | N=int(input())
ans = 1
while ans*2 <= N:
ans*=2
print(ans) |
p03011 | s707513893 | Wrong Answer | A = list(map(int, input().split()))
print(A[0]+A[1])
|
p03319 | s404640957 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(ceil((N-1)/(K-1)))
|
p02747 | s146496563 | Accepted | print("NYoe s"[input()in["hi"*x for x in range(6)]::2]) |
p03239 | s184757148 | Wrong Answer | N, T = map(int,input().split())
cnt = T+1
for _ in range(N):
c, t = map(int,input().split())
if t <= T:
cnt = min(cnt,c)
if cnt == T+1:
print("TLE")
else:
print(cnt) |
p02859 | s784711232 | Accepted | r = int(input())
print(r**2) |
p02603 | s677013337 | Accepted | def main():
N=int(input())
A=list(map(int,input().split()))
ans=1000
stocks=0
for i in range(N-1):
if A[i]>A[i+1]:
ans+=stocks*A[i]
stocks=0
else:
stocks+=(ans//A[i])
ans-=(ans//A[i])*A[i]
print(ans+stocks*A[-1])
if __name__=='__mai... |
p02817 | s884279555 | Accepted | S,T = input().split()
print(T+S) |
p03449 | s828150653 | Accepted | n = int(input())
A = []
for i in range(2):
A.append(list(map(int, input().split())))
start = sum(A[0]) + A[1][-1]
B = [start]
for i in range(n - 1):
start = start - A[0][-1 - i] + A[1][-2 - i]
B.append(start)
print(max(B)) |
p02682 | s914074118 | Accepted | A, B, C, K = map(int, input().split(" "))
if A + B >= K:
if K <= A:
print(K)
else:
print(A)
else:
print(A-(K-A-B)) |
p02664 | s517508673 | Accepted | T = list(input())
for i in range(len(T)):
if T[i] == '?':
T[i] = 'D'
print(''.join(T)) |
p02639 | s474052970 | Accepted | a,b,c,d,e = map(int,input().split())
if a*1 == 0:
print(1)
elif b*1 == 0:
print(2)
elif c*1 == 0:
print(3)
elif d*1 == 0:
print(4)
elif e*1 == 0:
print(5) |
p04031 | s709196942 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=10**10
for i in range(201):
cnt=0
for j in range(n):
cnt+=(a[j]-(i-100))**2
ans=min(ans,cnt)
print(ans) |
p02789 | s712474634 | Accepted | n, m = map(int, input().split())
print('Yes' if n == m else 'No') |
p03136 | s369999063 | Accepted | a = int(input())
b = [int(i) for i in input().split(" ")]
Max = max(b)
c = -Max
for i in range(a):
c+=b[i]
if Max<c:
print("Yes")
else:
print("No") |
p02755 | s789853563 | Accepted | A, B = map(int, input().split())
ans = -1
for price in range(1, 1251):
if int(price * 0.08) == A and int(price * 0.1) == B:
ans = price
break
print(ans) |
p03548 | s465315770 | Wrong Answer | X,Y,Z = map(int,input().split())
X = X-Z
i = 0
while X > 0:
if X >= Y:
X = X-Y
i += 1
X = X-Z
print(i) |
p04034 | s132086197 | Accepted | n,m = map(int, input().split())
r = [0]*(n+1)
r[1] = 1
b0 = [1]*(n+1)
for i in range(m):
x,y = map(int, input().split())
b0[x] -= 1
b0[y] += 1
if r[x]:
r[y] = 1
if b0[x]==0:
r[x]=0
ans = 0
for j in range(n+1):
if r[j]:
ans += 1
print(ans)
|
p03545 | s490445276 | Wrong Answer | S = input()
s = [int(c) for c in S]
def to_s(a):
if a>=0:
return "+"+str(a)
return str(a)
for b in [-s[1],s[1]]:
for c in [-s[2],s[2]]:
for d in [-s[3],s[3]]:
if s[0]+b+c+d == 7:
print(S[0]+to_s(s[1])+to_s(s[2])+to_s(s[3])+"=7")
exit() |
p03799 | s512927281 | Accepted | n, m = map(int, input().split())
x = min(n, m//2)
y = (m-x*2)//4
print(x+y) |
p02691 | s721768220 | Accepted | from collections import defaultdict
N = int(input())
A = map(int, input().split())
d = defaultdict(int)
ans = 0
for i, a in enumerate(A):
ans += d[-i+a]
d[-i-a] += 1
print(ans)
|
p02789 | s963933253 | Wrong Answer | def ac_or_wa(n, m):
if n == m:
return "AC"
else:
return "WA"
n, m = map(int, input().split())
print(ac_or_wa(n, m))
|
p02789 | s264712831 | Accepted | n,m=map(int,input().split())
if n==m:
print("Yes")
else :
print("No") |
p02935 | s808514352 | Accepted | # import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, Vs):
Vs.sort()
ans = Vs[0]
for i in range(1, N):
ans = (ans + Vs[i]) / 2
print(ans)
if __name__ == '__main__':
# S = input()
... |
p03377 | s964224226 | Wrong Answer | a, b, c = map(int, input().split())
if a<c and b>c-a:
print('YES')
else :
print('NO') |
p02993 | s439657299 | Accepted | a=list(input())
count=0
for i in range(4):
if i==3:
break
if a[i]==a[i+1] :
count+=1
if count>=1:
print('Bad')
else:
print('Good') |
p03951 | s980613899 | Wrong Answer | N = int(input())
s = input()
t = input()
if s[N-1] == t[0]:
print(len(s[:N-1] + t))
elif s == t:
print(len(s))
else:
print(len(s + t)) |
p02917 | s791062804 | Accepted | n = int(input())
b = list(map(int,input().split()))
ans = b[0] + b[-1]
for i in range(n-2):
ans += min(b[i],b[i+1])
print(ans) |
p03131 | s117331814 | Accepted | k, a, b = map(int, input().split())
c = 1
if a + 2 >= b: print(c+k)
else:
k = k - (a+1)
c = b
c += (k//2)*(b-a) + k%2
print(c) |
p02627 | s845417813 | Accepted | if input().islower():
print("a")
else:
print("A")
|
p02705 | s699128497 | Wrong Answer | import math
R=int(input())
print(2*math.pi) |
p03001 | s576561463 | Accepted | W, H, x, y = map(float, input().split())
ans = W * H / 2
count = 0
if W / 2 == x and H / 2 == y:
count = 1
print(ans, count) |
p02621 | s865847235 | Accepted | a = int(input())
print(a+a*a+a*a*a) |
p02843 | s581458423 | Wrong Answer | def solve(X:int) -> int:
if(X < 100):return 0
first = int(str(X)[0])
seccond = int(str(X)[1])
ans = 0
if(first >= 6):
ans += first + 200
else:
ans += first + 100
ans += (seccond * 2) * 105
return 1 if(X - ans > 0) else 0
def main():
X = int(input())
print(solve(... |
p03285 | s283446549 | Accepted | N = int(input())
cake = N // 4
donuts = N // 7
calcs = False
for i in range(cake + 1):
for j in range(donuts + 1):
s = i * 4 + j * 7
if s == N:
calcs = True
break
print('Yes' if calcs is True else 'No') |
p03449 | s379716406 | Accepted | n = int(input())
candy_map = []
candy_map.append(list(map(int, input().split())))
candy_map.append(list(map(int, input().split())))
ans = 0
for i in range(n):
upper = sum(candy_map[0][:i])
lower = sum(candy_map[1][i+1:])
Sum = upper + lower + candy_map[0][i] + candy_map[1][i]
ans = max(ans, Sum)
print(a... |
p03721 | s344538525 | Accepted | n, k = map(int, input().split())
freq = dict()
for i in range(n):
a, b = map(int, input().split())
if freq.get(a): freq[a] += b
else: freq[a] = b
f_asc = sorted(freq.items(), key=lambda x: x[0])
idx = 0
for kv in f_asc:
idx += kv[1]
if idx >= k:
print(kv[0])
break |
p02602 | s317317901 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N - K):
if A[i] < A[i + K]:
print("Yes")
else:
print("No")
|
p02700 | s590869426 | Wrong Answer | A,B,C,D = map(int,input().split())
x = ((A+D)-1)/D
y = ((B+C)-1)/B
if(x>=y):
print('Yes')
else:
print('No') |
p03495 | s828529462 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
d = dict()
for v in a:
if v not in d:
d[v] = 1
else:
d[v] += 1
l = []
for v in d.values():
l.append(v)
l.sort()
print(sum(l[:len(l)-k])) |
p03000 | s966842382 | Accepted | n, x = list(map(int, input().split()))
l = list(map(int, input().split()))
d = [0]
for i in range(len(l)):
d.append(d[i] + l[i])
print(len(list(filter(lambda d_i: d_i <= x, d)))) |
p02646 | s576653890 | Accepted | a,v = map(int, input().split())
b,w = map(int, input().split())
t=int(input())
rev = v-w
if rev*t >= abs(b-a):
print("YES")
else:
print("NO") |
p02661 | s103658502 | Accepted | import sys
input = sys.stdin.readline
import numpy as np
from decimal import *
n = int(input())
Li = [[int(e) for e in input().split()] for _ in range(n)]
Li = np.array(Li)
LA = Li[:,0]
LB = Li[:,1]
LA.sort()
LB.sort()
if n %2 == 0: # n = 2m
idx =n //2 -1
min = (LA[idx] + LA[idx+1])
max = (LB[idx] + L... |
p03030 | s369180497 | Accepted | #B
n = int(input())
sp = [list(input().split()) for i in range(n)]
for i in range(n):
sp[i].append(i + 1)
# print(sp)
sspp = sorted(sp, key=lambda x: int(x[1]), reverse=True)
sspp.sort(key=lambda x: x[0])
for i in range(n):
print(sspp[i][2]) |
p02627 | s977466279 | Accepted | A = input()
# 文字列において、全ての文字が大文字かどうか判定するには str.isupper()
# 文字列において、全ての文字が小文字かどうか判定するには str.islower()
ans = ''
if A.isupper(): ans = 'A'
else: ans = 'a'
print(ans) |
p03544 | s636422168 | Accepted | n = int(input())
a = 2
b = 1
for i in range(n-1):
tmp = b
b += a
a = tmp
print(b)
|
p02996 | s159618018 | Wrong Answer | import heapq
n = int(raw_input())
heap = [map(int, raw_input().split(' '))[::-1] for _ in range(n)]
heapq.heapify(heap)
def f(heap):
t = 0
while(heap):
nd,ct = heapq.heappop(heap)
gap = nd - t
while(heap and heap[0][0] == nd):
u,v = heapq.heappop(heap)
t += v
gap -= v
if gap < 0: return False
whi... |
p02696 | s226313969 | Accepted | a, b, n = map(int, input().split())
ans = 0
if n < b:
ans = int(a*n/b)
print(ans)
else:
ans = int(a * (b - 1) / b)
print(ans) |
p02973 | s685579840 | Accepted | from sys import stdin, setrecursionlimit
from bisect import bisect_right
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
N = int(input())
A = tuple(int(input()) for _ in range(N))
B = [-A[0]]
for a in A[1:]:
if a <= -B[-1]:
... |
p02577 | s022358700 | Accepted | import sys
S = str(input())
Sum = 0
for i in range(len(S)):
Sum += int(S[i])
if Sum % 9 == 0:
print("Yes")
else:
print("No")
|
p02847 | s016562015 | Accepted | S = str(input())
if S == 'SUN':
print('7')
elif S == 'MON':
print('6')
elif S == 'TUE':
print('5')
elif S == 'WED':
print('4')
elif S == 'THU':
print('3')
elif S == 'FRI':
print('2')
elif S == 'SAT':
print('1')
|
p03145 | s185187056 | Wrong Answer | a,b,c=map(int,input().split());print(a*b/2) |
p03042 | s896528426 | Accepted | s = input()
xx = s[0] + s[1]
yy = s[2] + s[3]
xx = int(xx)
yy = int(yy)
if 1 <= xx <= 12:
if yy >= 13 or yy == 0:
print("MMYY")
else:
print("AMBIGUOUS")
if xx == 0 or 13 <= xx <= 99:
if 1 <= yy <= 12:
print("YYMM")
else:
print("NA") |
p02836 | s610167562 | Accepted | S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)//2):
if s[i] != ss[i]:
ans += 1
print(ans) |
p03644 | s306266347 | Accepted | N = int(input())
a=2
while a <= N:
a*=2
print(int(a/2)) |
p03623 | s357373022 | Wrong Answer | x, a, b = map(int, input().split())
A = abs(a - x)
B = abs(b - x)
if A > B:
print('A')
else:
print('B') |
p03162 | s196054934 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
n = int(input())
work_list = [tuple(map(int, input().split())) for i in range(n)]
total = 0
target = {0, 1, 2}
pre = {-1}
for work in work_list:
max_val = 0
for i in target - pre:
if max_val < work[i]:
max_val = w... |
p02989 | s152201749 | Accepted | def main():
n = int(input())
d = sorted(list(map(int,input().split())))
print(d[n//2]-d[n//2-1])
if __name__ == "__main__":
main() |
p03380 | s768745488 | Accepted | N=int(input())
*A,=map(int,input().split())
A.sort()
M=A[-1]
A=[-10**9]+A+[10**11]
from bisect import*
P=bisect_right(A,M/2)
if abs(A[P-1]-M/2)>abs(A[P]-M/2):
m=A[P]
else:
m=A[P-1]
print(M,m) |
p02922 | s165309523 | Wrong Answer | a,b=map(int,input().split())
cnt=0
while True:
a+=a-1
cnt +=1
if a>b:
break
print(cnt) |
p03327 | s160372222 | Wrong Answer | a = int(input())
if a < 1000:
print('ABC' + str(a))
else:
a = a - 999
print('ABD' + str(a)) |
p03469 | s416243930 | Wrong Answer | s = input()
print(s.replace("2018","2017")) |
p02959 | s888926608 | Accepted | n=int(input())
b=list(map(int,input().split()))
a=list(map(int,input().split()))
ans=0
for i in range(n):
m=min(b[i],a[i])
ans+=m
a[i]-=m
b[i]-=m
m=min(b[i+1],a[i])
ans+=m
a[i]-=m
b[i+1]-=m
print(ans)
|
p02576 | s190476720 | Wrong Answer | N,X,T =map(int, input().split())
print(T*(N//X+1)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.