problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03548 | s010926650 | Accepted | x,y,z=list(map(int,input().split()))
x-=z
print(x//(y+z))
|
p03012 | s024873689 | Accepted | n = int(input())
w = list(map(int,input().split()))
ans = abs(sum(w[0:1]) - sum(w[1:n+1]))
for i in range(1,n-1):
a = abs(sum(w[0:i+1]) - sum(w[i+1:n+1]))
ans = min(ans,a)
print(ans) |
p02989 | s184119127 | Accepted | def resolve():
'''
code here
'''
N = int(input())
Ds = [int(item) for item in input().split()]
Ds.sort()
print(Ds[N//2] - Ds[N//2 -1])
if __name__ == "__main__":
resolve()
|
p03862 | s607586869 | Wrong Answer | n, x = map(int, input().split())
a = list(map(int, input().split()))
result = 0
if a[0] > x:
a[0] = x
for i in range(1, n):
box2 = a[i-1] + a[i]
if x < box2:
result += box2 - x
a[i] -= abs(box2 - x)
print(result) |
p03042 | s224507052 | Accepted | s = list(input())
head = int(s[0] + s[1])
tail = int(s[2] + s[3])
if (0 < head < 13) and (0 < tail < 13):
print('AMBIGUOUS')
elif 0 < tail < 13:
print('YYMM')
elif 0 < head < 13:
print('MMYY')
else:
print('NA') |
p03760 | s624802382 | Accepted | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))
o = S()
e = S()
for i in range(len(o)+len(e)):
if i%2 == 0:
print(o[i//2],end = "")
else:
print(e[i//2],end = "") |
p02717 | s399728537 | Wrong Answer | a,b,c = map(int,input("enter three integers : ").split())
temp = a
a=b
b=temp
temp = c
c= a
a=temp
print(a,b,c) |
p03324 | s782080883 | Accepted | d, n = map(int, input().split())
print(100 ** d * (n + n // 100)) |
p02552 | s021047089 | Accepted | def solve():
x = int(input())
if x == 0:
print(1)
else:
print(0)
if __name__ == '__main__':
solve()
|
p03804 | s207715822 | Wrong Answer | n,m = map(int,input().split())
a = [list(input())for i in range(n)]
b = [list(input())for i in range(m)]
for y in range(n-m+1):
for z in range(n-m):
count = 0
for p in range(m):
if b[p] == a[y+p][z:(z+m)]:
count += 1
if count == m:
print("Yes")
exit()
else:
count = 0
print("No") |
p03076 | s179630021 | Wrong Answer | I = ["{0:03d}".format(int(n)) for n in open(0).read().split()]
c = 0
min_z = 10
for i in I:
x, y, z = map(int, i)
if 0 < z < min_z:
min_z = z
if 0 < z:
y +=1
if 9 < y:
x += 1
y -= 10
n = x * 100 + y * 10
c += n
min_z = (min_z if min_z != 10 else 0)
print(c+min_z-10) |
p03836 | s721078084 | Wrong Answer | sX,sY,tX,tY = list(map(int,input().split()))
ans = ""
a1 = 'U' * (tY-sY) + 'R' * (tX-sX)
a2 = 'D' * (tY-sY) + 'L' * (tX-sX)
a3 = "L" + "U" * (tX-sX+1) + "R" * (tY-sY+1) + "D"
a4 = "R" + "D" * (tY-sY+1) +"L" * (tX-sX+1) +"U"
print(a1+a2+a3+a4) |
p03137 | s715953672 | Accepted | N,M=map(int,input().split())
X=list(map(int,input().split()))
X.sort()
mi=X[0]
ma=X[len(X)-1]
l=[]
c=0
#print(X)
#for i in (mi,ma+1,1):
for i in range(M-1):
l.append(X[i+1]-X[i])
l.sort()
for i in range(len(l)-(N-1)):
c=c+l[i]
print(c) |
p03860 | s342198819 | Accepted | AtCoder, s, Contest = input().split()
print(AtCoder[0] + s[0] + Contest[0]) |
p03328 | s358780902 | Wrong Answer | a, b = map(int, input().split())
print((b - a) * (b - a - 1) / 2 - a)
|
p02623 | s812777040 | Wrong Answer | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.append(10**10)
B.append(10**10)
L = []
for i in range(N+M):
if A[0] >= B[0]:
L.append(B[0])
B.pop(0)
else:
L.append(A[0])
A.pop(0)
ans = 0
for i in range(N+M):
ans += L[i]
if ans > K:
print(i)
break
if ans <= K:
print(N+M) |
p02933 | s236290486 | Wrong Answer | a=int(input())
print(input() if a<3200 else 'red') |
p02693 | s424453966 | Wrong Answer | k = int(input())
a, b = list(map(int, input().split()))
s = [i for i in range(a, b) if i % k == 0]
if len(s) == 0:
print('NG')
else:
print('YES') |
p03852 | s421352732 | Wrong Answer | c=input()
if c == 'a' or 'e' or 'u' or 'i' or 'o':
print('vowel')
else:
print('consonant') |
p03471 | s686483160 | Wrong Answer | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
if y==10000*i-5000*j-1000*(n-i-j):
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p02859 | s392007400 | Accepted | r = int(input())
print(r ** 2) |
p02553 | s581042838 | Wrong Answer | a,b,c,d = map(int,input().split())
print(max(a*b,c*d,b*c,a*d)) |
p02701 | s720326834 | Accepted | n=int(input())
a=[]
for i in range(n):
s=input()
a.append(s)
print(len(set(a))) |
p02742 | s780142608 | Accepted | H,W = list(map(int,input().split()))
if H==1 or W==1:
print(1)
exit()
if (H*W)%2==0:
ans = H*W//2
else:
ans = H*W//2 + 1
print(ans) |
p03309 | s166799936 | Accepted | N = int(input())
A = list(map(int, input().split()))
A = [A[i]-(i+1) for i in range(N)]
A.sort()
cumsum = [0]*N
cumsum[0] = A[0]
for i in range(1, N):
cumsum[i] = cumsum[i-1] + A[i]
ans = 1e20
for i in range(N):
tmp = -(cumsum[i]) + (cumsum[N-1]-cumsum[i]) + (i+1)*A[i] - (N-i-1)*A[i]
ans = min(ans, tmp)
print(ans)
|
p02951 | s852823722 | Accepted | import math
import sys
(A,B,C) = list(map(int,input().split()))
print(max(0,C - (A-B)))
|
p02601 | s214673446 | Wrong Answer | a,b,c=(int(x) for x in input().split())
k=int(input())
ans=0
for i in range(0,k):
c1=c*pow(2,i)
b1=b*pow(2,(k-i))
if a<b1 and b1<c1:
ans=1
break
else:
b1=b
c1=c
if ans==1:
print("Yes")
else:
print("No")
|
p02983 | s576743842 | Accepted | import math
INF = 2_000_000_001
L, R = list(map(int, input().split()))
if math.ceil(L / 2019) <= R // 2019:
print(0)
else:
res = INF
for i in range(L % 2019, R % 2019):
for j in range(L % 2019 + 1, R % 2019 + 1):
res = min(res, (i * j) % 2019)
print(res)
|
p03038 | s284541224 | Accepted | from heapq import heapify, heappop, heappush
from sys import stdin
N, M = map(int, input().split())
A = list(map(int, stdin.readline().split()))
heapify(A)
BC = [None] * M
for i in range(M):
BC[i] = tuple(map(int, stdin.readline().split()))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
enough = False
for bc in BC:
if enough:
break
for i in range(bc[0]):
if bc[1] <= A[0]:
enough = True
break
heappop(A)
heappush(A, bc[1])
print(sum(A))
|
p02691 | s899120827 | Accepted | class Map(dict):
def __missing__(self, key):
default_value = 0
self[key] = default_value
return default_value
def main():
int(input())
d = Map()
ans = 0
for i, height in enumerate(input().split()):
height = int(height)
d[i + height] += 1
ans += d[i - height]
return ans
if __name__ == '__main__':
print(main())
|
p02873 | s500547765 | Wrong Answer | s = input()
n = len(s)
ans = 0
l = 0
ll = [0] * (n + 1)
r = 0
rl = [0] * (n + 1)
for i in range(n):
if s[i] == '<':
l += 1
ll[i+1] = l
else:
l = 0
if s[-i] == '>':
r += 1
rl[-i-1] = r
else:
r = 0
for i in range(n + 1):
ans += max(rl[i], ll[i])
print(ans) |
p02664 | s130719070 | Accepted | s = input()
print(s.replace('?','D'))
|
p02597 | s614759079 | Wrong Answer | N = int(input())
c = list(input())
pre = c[0:(N+1)//2]
suf = c[(N+1)//2:N]
ans = 0
pre_cnt = pre.count('W')
suf_cnt = suf.count('R')
ans = min(pre_cnt,suf_cnt)
print(ans) |
p02594 | s055148940 | Accepted | X = int(input())
if X >= 30:
print("Yes")
else:
print("No") |
p02582 | s398617402 | Wrong Answer | # coding: utf-8
# Your code here!
S = input()
#N = int(input())
#A, B = map(int, input().split())
#List = list(map(int, input().split()))
if S=="RRR":
print(3)
elif S=="SSS":
print(3)
elif S=="RSS":
print(2)
elif S=="RRS":
print(2)
elif S=="SRR":
print(2)
elif S=="SSR":
print(2)
else:
print(1) |
p02897 | s242052901 | Wrong Answer |
N = int(input())
print(1/2 if (N%2)==0 else (N+1)/2*N) |
p03861 | s202044488 | Wrong Answer | a, b, x = map(int, input().split())
p = 0
y = int(b//x) + 1
i = 1
#for i in range(1,y):
while x*i <= b:
if a <= x*i:
p = x*i
break
i += 1
if p != 0:
t = b-p
s = t//x
ans = s + 1
if a == 0:
ans += 1
print(ans)
else:
print(0) |
p02705 | s988477745 | Accepted | import math
r=int(input())
print(2*math.pi*r) |
p02719 | s329231166 | Accepted | n,k=map(int,input().split())
while n>k:
n=n%k
if n>k//2:
n=abs(n-k)
print(n) |
p02775 | s381933366 | Accepted |
ans = 0
s = input()
l = len(s)
N = [0 for i in range(l)]
for i in range(l):
N[i] = int(s[-i-1])
N.append(0)
for i in range(l+1):
if N[i]<5:
ans += N[i]
elif N[i]>5:
ans += 10-N[i]
N[i+1] += 1
elif N[i+1]>4:
ans += 10-N[i]
N[i+1] += 1
else:
ans += N[i]
print(ans)
|
p02572 | s614047258 | Accepted | n=int(input())
arr=list(map(int,input().split()))
s=sum(arr)
ans=0
m=10**9+7
c=0
for i in arr:
c+=i
ans+=i*(s-c)
ans%=m
print(ans) |
p02661 | s488312745 | Accepted | from operator import itemgetter
n = int(input())
info = [list(map(int, input().split())) for i in range(n)]
a = [info[i][0] for i in range(n)]
b = [info[i][1] for i in range(n)]
a = sorted(a)
b = sorted(b)
if n % 2 == 1:
l = a[n // 2]
r = b[n // 2]
print(r - l + 1)
else:
l1, l2 = a[n // 2 - 1], a[n // 2]
r1, r2 = b[n // 2 - 1], b[n // 2]
print((r1 + r2) - (l1 + l2) + 1) |
p03665 | s642825370 | Wrong Answer | N, P = map(int, input().split())
A = list(map(int, input().split()))
OE = [0,0]
for i in range (0, N):
if A[i]%2 == 0:
OE[1]+=1
else:
OE[0]+=1
RemEven = 1
if OE[0]%2 - 1 !=0:
RemEven = 0
import math
count = 0
for i in range (0, OE[0]+1):
if i%2==0:
count+=(2**OE[1])*math.factorial(OE[0])/(math.factorial(i)*math.factorial(OE[0]-i))
if RemEven == 1:
print(int(count))
else:
print(int(2**N-count)) |
p03062 | s950262773 | Accepted | N = int(input())
A = list( map(int, input().split()))
minus = len([ 1 for i in A if i<0])
abs_A = list(map(abs, A))
if minus % 2 == 0:
print(sum(abs_A))
else:
print(sum(abs_A) - 2 * min( abs_A)) |
p04045 | s841925737 | Accepted | N,K=map(int,input().split())
D=list(map(int,input().split()))
while True:
S=str(N)
flag=True
for x in S:
if int(x) in D:
flag=False
if flag==True:
break;
N+=1
print(N) |
p02780 | s435968102 | Accepted | N,K = map(int,input().split())
p = list(map(int,input().split()))
E = sum(p[0:K])
a = E
for i in range (0,N-K):
E = E - p[i] + p[i+K]
if E == max(a,E):
a = E
print((a+K)/2) |
p02602 | s486540496 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k, n):
print("Yes") if a[i] > a[i-k] else print("No")
|
p02761 | s019973158 | Accepted | n,m = map(int,input().split())
li = [list(map(int,input().split())) for _ in range(m)]
if n==1 and all([i[1]==0 for i in li]):
print(0)
exit()
for i in range(10**(n-1),10**n):
p = list(map(int,list(str(i))))
for s,c in li:
if p[s-1] != c:break
else:
print(i)
exit()
print(-1) |
p04044 | s045819031 | Accepted | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
N, L = LI()
S = [SS() for _ in range(N)]
S.sort()
print(''.join(S))
if __name__ == '__main__':
resolve()
|
p03785 | s102518881 | Accepted | N,C,K = map(int,input().split())
T = []
for i in range(N):
T.append(int(input()))
T.sort()
ans = 0
p = C
d_time = 0
for i in range(N):
if T[i] - d_time > K or p == C:
ans += 1
d_time = T[i]
p = 1
else:
p += 1
print(ans)
|
p02777 | s890027021 | Accepted | s1, s2 = map(str, input().split())
a, b = map(int, input().split())
s3 = input()
if(s1==s3):print(a-1, b)
else:print(a, b-1) |
p02952 | s956356851 | Wrong Answer | s = input()
n = len(s)
if n == 1:
print(n)
elif n == 2:
print(9)
elif n == 3:
print(9+(int(s)-99))
elif n == 4:
print(9+900)
elif n == 5:
print(9+899+(int(s)-9999))
else:
print(90909) |
p02836 | s859861863 | Accepted | a=input()
i = 0
j = 0
while a != a[::-1]:
if(a[i]!=a[len(a) - i - 1]):
sList = list(a)
sList[i] = sList[len(a) - i - 1]
a = "".join(sList)
j += 1
i += 1
print(j) |
p02641 | s514750861 | Accepted | x, n = map(int, input().split())
p = list(map(int, input().split()))
if n == 0:
print(x)
exit()
for i in range(100):
if x - i not in p:
print(x-i)
exit()
if x + i not in p:
print(x+i)
exit() |
p02832 | s450840136 | Accepted | n=int(input())
a=list(map(int,input().split()))
now=1
break_num=0
for i in range(n):
if a[i]!=now:
break_num+=1
else:
now+=1
if break_num==n: print(-1)
else: print(break_num) |
p03617 | s352876854 | Wrong Answer | q, h, s, d = map(int, input().split())
n = int(input())
cheep_1 = min(q * 4, 2 * h, s)
if 2 * cheep_1 <= d:
print(cheep_1 * n)
else:
n1 = n % 2
print(n // 2 + n1 * cheep_1)
|
p03145 | s557856091 | Wrong Answer | a = list(map(int, input().split()))
print(a[0]*a[1]/2) |
p02631 | s089573160 | Accepted | import sys
import math
from collections import defaultdict, deque
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
n=r()
a=rl()
all=a[0]^a[1]
for i in range(2,n):
all^=a[i]
b=[]
for j in range(n):
b.append(all^a[j])
print(*b) |
p02989 | s125939069 | Wrong Answer | N=int(input())
d=list(map(int, input().split()))
d=sorted(d)
ans=0
if N%2==0:
for i in range(10**5):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
else:
for i in range(10**5):
if d[int(N//2+1)] == i:
ans +=1
print(ans) |
p03475 | s579551214 | Accepted | n = int(input())
loss = []
for _ in range(n-1):
c,s,f = map(int,input().split())
loss.append((c,s,f))
for i in range(n-1):
time = 0
for j in range(i,n-1):
if time < loss[j][1]:
time = loss[j][1]
if (time-loss[j][1])%loss[j][2] != 0:
time += loss[j][2]-(time-loss[j][1])%loss[j][2]
time += loss[j][0]
print(time)
print(0) |
p02708 | s853117441 | Accepted | # import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N,K = map(int,input().split())
mod = 10 ** 9 + 7
res = 0
for i in range(K,N+2):
r = (2 * N - i + 1) * i // 2
l = (i - 1) * i // 2
res += r - l + 1
res %= mod
print(res)
main()
|
p03371 | s653540677 | Accepted | A, B, C, X, Y = map(int, input().split())
if A + B >= C * 2:
price = min(X, Y) * C * 2
tmp = min(X,Y)
X = X - tmp
Y = Y - tmp
if A * X < C * X * 2:
price += A * X
X -= X
if B * Y < C * Y * 2:
price += B * Y
Y -= Y
price += C * 2 * max(X, Y)
print(price)
else:
print(A * X + B * Y) |
p02688 | s740347822 | Accepted | n , k = map(int,input().split())
ans = [0] * n
for i in range(k):
d = int(input())
for j in list(map(int,input().split())):
ans[j-1] = 1
print(ans.count(0))
|
p03379 | s862293045 | Accepted | n = int(input())
X = list(map(int, input().split()))
import copy
Y = copy.copy(X)
L = []
U = []
X.sort()
for i in range(n):
if i < n//2:
L.append(X[i])
else:
U.append(X[i])
#print(L)
#print(U)
L_ = set(L)
U_ = set(U)
ans = [0]*n
for i, y in enumerate(Y):
if y in L_:
ans[i] = U[0]
else:
ans[i] = L[-1]
print(*ans, sep='\n')
|
p03286 | s496957156 | Accepted | n = int(input())
result = ""
if n != 0:
while n != 0:
if n%2==0:
result = "0"+result
else:
result = "1"+result
n = (n-n%2)//(-2)
else:
result = "0"
print(result) |
p02923 | s567178146 | Accepted | n=int(input())
l=list(map(int,input().split()))
cnt=0
ans=0
lis=[(l[i+1]-l[i]) for i in range(n-1)]
for i in lis:
if i<=0:
cnt+=1
else:
ans=max(cnt, ans)
cnt=0
ans=max(cnt, ans)
print(ans) |
p04029 | s164334532 | Accepted | s=int(input())
n=0
while(s>0):
n=n+s
s=s-1
print(n) |
p02548 | s994799486 | Accepted | n = int(input())
ans = 0
for a in range(1,n):
ans += (n-1)//a
print(ans)
|
p03407 | s532652472 | Wrong Answer | a,b,c = map(int,input().split())
if a+b>c:
print('Yes')
else:
print('No') |
p03069 | s486769299 | Accepted | n = int(input())
s = input()
b_total = 0
w_total = 0
ans = 0
for i in range(n):
if s[i] == '#':
b_total += 1
if s[i] == '.':
w_total += 1
if b_total == n:
print(0)
else:
b_cnt = 0
w_cnt = 0
ans = b_cnt + (w_total - w_cnt)
for i in range(n):
if s[i] == '#':
b_cnt += 1
if s[i] == '.':
w_cnt += 1
cnt = b_cnt + (w_total - w_cnt)
ans = min(ans, cnt)
print(ans)
|
p02831 | s843196471 | Accepted | import fractions
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
A, B = map(int , input().split())
print(lcm(A, B))
|
p03309 | s222826263 | Accepted | N=int(input())
A=sorted(a-i-1 for i,a in enumerate(map(int,input().split())))
#A-iを取り出して昇順に並べる
print(sum(abs(a-A[N//2]) for a in A)) |
p03385 | s463682944 | Accepted | S = list(input())
S.sort()
if S == ['a', 'b', 'c']:
print('Yes')
else:
print('No')
|
p02677 | s960082300 | Accepted | import math
A, B, H, M = map(int, input().split())
rad_h = (H / 12 + M / 12 / 60 ) * 2 * math.pi
rad_m = M / 60 * 2 * math.pi
res = math.sqrt(A ** 2 + B ** 2 - 2 * A * B * math.cos(abs(rad_h - rad_m)))
print(res)
|
p03944 | s296514196 | Wrong Answer | w, h, n = map(int, input().split())
x1 = [0]
x2 = [w]
y1 = [0]
y2 = [h]
for i in range(n):
x, y, a = map(int, input().split())
if a == 1:
x1.append(x)
elif a == 2:
x2.append(x)
elif a == 3:
y1.append(y)
elif a == 4:
y2.append(y)
left = max(x1)
right = min(x2)
bottom = max(y1)
top = min(y2)
ans = (top - bottom) * (right - left)
print(ans if ans > 0 else 0) |
p02829 | s472161753 | Accepted | a = int(input())
b = int(input())
print(a^b) |
p02628 | s003858117 | Accepted | n,k=map(int,input().split())
t=[int(i) for i in input().split()]
t.sort()
print(sum(t[:k])) |
p03624 | s488231434 | Accepted | import string
S = list(input())
low_list = list(string.ascii_lowercase)
for i in range(len(S)):
try:
low_list.remove(S[i])
except ValueError:
pass
if len(low_list) == 0:
print('None')
else:
print(low_list[0])
|
p02859 | s349979292 | Wrong Answer | a = int(input())
print(a**a) |
p02768 | s543680367 | Wrong Answer | n, a, b = map(int, input().split(' '))
MOD = 10**9 + 7
ans = -1
def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n = n>>1
return res
ans += modpow(2, n, MOD)
def COM(n, k):
res = 1
for i in range(1, k+1):
res = res * (n-i+1) / i % MOD
return res %MOD
ans -= COM(n, a)
ans -= COM(n, b)
print(int(ans)) |
p03493 | s075055320 | Wrong Answer | s = input()
cnt = sum([int(c) for c in s]) |
p02829 | s874085021 | Accepted | print(6-int(input())-int(input())) |
p03359 | s200616924 | Accepted | a, b = map(int, input().split())
print(a if a <= b else a-1)
|
p02645 | s212041626 | Wrong Answer | import sys
import random
def main():
S = input()
l = len(S)
n = [0, 1, l-1]
out = S[n[0]] + S[n[1]] + S[n[2]]
print(out)
main() |
p02761 | s737878128 | Accepted | def main():
n, m = [int(s) for s in input().strip().split()]
S, C = [], []
for _ in range(m):
s, c = [int(s) for s in input().strip().split()]
S.append(s)
C.append(str(c))
for x in range(1000):
x = str(x)
if len(x) == n and all(x[s - 1] == c for s, c in zip(S, C)):
print(x)
return
print(-1)
main()
|
p03069 | s610061927 | Accepted | n = int(input())
s = str(input())
ans = s.count('.')
L = [[0, s.count('.')]]
for i in range(n):
if s[i] == '#':
L.append([L[i][0]+1, L[i][1]])
else:
L.append([L[i][0], L[i][1]-1])
ans = min(ans, L[-1][0] + L[-1][1])
print(ans)
|
p03076 | s139300101 | Accepted | lis = []
rank1 = []
for i in range(5):
lis.append(input())
rank1.append( 10 if lis[-1][-1] == "0" else int(lis[-1][-1]))
min_index = rank1.index(min(rank1))
ans = 0
for i in range(5):
if i == min_index:
continue
ans = (ans + int(lis[i]) + 9)//10*10
ans += int(lis[min_index])
print(ans)
|
p02847 | s165769092 | Accepted | ls = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7 - ls.index(str(input()))) |
p02787 | s743815418 | Accepted | h,n=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
dp=[0]*h
for i in range(h):
_min = 10**10
for g in range(n):
if i>=ab[g][0]:
_min = min(ab[g][1]+dp[i-ab[g][0]], _min)
else:
_min = min(ab[g][1], _min)
dp[i]=_min
print(dp[-1]) |
p03161 | s592091226 | Accepted | mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
l=list(mi())
dp=[0]*a
dp[0]=0
for i in range(1,a):
dp[i]=min(abs(l[i]-l[i-j-1])+dp[i-j-1] for j in range(min(i,b)))
print(dp[-1]) |
p02759 | s371334993 | Accepted | N = int(input())
if N % 2 == 0:
print(int(N / 2))
else:
print(int(N / 2) + 1)
|
p03862 | s788778344 | Wrong Answer | import sys
def eat(i,candies,counter):
s=candies[i]+candies[i-1]
nc=max(0,s-x)
counter+=nc
candies[i]-=nc
return counter
def main(n,x,candies):
counter=0
if candies[0]>x:
candies[0]=x
counter=x-candies[0]
for i in range(1,n):
counter=eat(i,candies,counter)
return counter
n,x=map(int,sys.stdin.readline().strip().split())
candies=list(map(int,sys.stdin.readline().strip().split()))
print(main(n,x,candies))
|
p04031 | s375109394 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
y = 1000000
for i in range(-100, 100):
x = 0
for m in a:
x += (i-m)**2
if y > x:
y = x
print(y) |
p02602 | s346254496 | Accepted | n, k = map(int, input().split(' '))
list_a = list(map(int, input().split(' ')))
for i in range(k, n):
if list_a[i] > list_a[i-k]:
print('Yes')
else:
print('No') |
p02661 | s452626034 | Wrong Answer | N = int(input())
A = []
B = []
for i in range(N):
hoge = input().split()
A.append(int(hoge[0]))
B.append(int(hoge[1]))
sorted_A = sorted(A)
sorted_B = sorted(B)
if N % 2 != 0:
center_A = sorted_A[N//2]
center_B = sorted_B[N//2]
print(abs(center_B - center_A) + 1)
else:
center_A = (sorted_A[N//2-1] + sorted_A[N//2]) //2
center_B = (sorted_B[N//2-1] + sorted_B[N//2]) //2
print(abs(center_B - center_A)*2 + 1) |
p03745 | s707114138 | Accepted | N = int(input())
a_list = list(map(int, input().split()))
count = 1
up_flag = None
prev_a = a_list[0]
for a in a_list[1:]:
if up_flag is None:
if prev_a == a:
continue
up_flag = a > prev_a
if up_flag and a >= prev_a:
prev_a = a
continue
elif not up_flag and a <= prev_a:
prev_a = a
continue
else:
up_flag = None
count += 1
prev_a = a
print(count) |
p03730 | s688533237 | Accepted | import sys
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
sys.setrecursionlimit(10**6)
INF = 10**20
def mint():
return map(int,input().split())
def lint():
return map(int,input().split())
def judge(x, l=['Yes', 'No']):
print(l[0] if x else l[1])
a,b,c = mint()
judge(c%gcd(a,b)==0,['YES','NO']) |
p03150 | s680874606 | Accepted | S=[i for i in list(input())];N=len(S);k=['k','e','y','e','n','c','e']
for d in range(N-6):
for i in range(N-d+1):
s=S[:i]+S[i+d:]
if s==k:
print('YES');quit()
print('NO')
|
p02657 | s099250583 | Accepted | a = list(map(int,input().split()))
print(a[0] * a[1]) |
p02603 | s972343431 | Accepted | N = int(input())
A = list(map(int, input().split()))
m=1000
s=0
for i in range(N-1):
if A[i] < A[i+1]:
s+=m//A[i]
m=m%A[i]
if A[i] > A[i+1]:
m += A[i]*s
s=0
print(m+A[N-1]*s)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.