problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03416 | s747037063 | Accepted | #ABC090
a,b = list(map(int,input().split()))
count = 0
for i in range(a,b+1):
n = str(i)
if n[0] == n[4] and n[1] == n[3]:
count += 1
print(count) |
p02682 | s696242324 | Accepted | # ABC167 B
def main():
a, b, c, k = map(int, input().split())
total = 0
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
print(a - (k - a - b))
if __name__ == '__main__':
main() |
p02817 | s277571610 | Accepted | s,t=input().split()
print(t+s) |
p02553 | s458218503 | Wrong Answer | # -*- coding: utf-8 -*-
a, b, c, d = map(int, input().split())
ans = max(a*c, b*d)
ans = max(ans, a*d)
ans = max(ans, b*d)
print(ans) |
p03698 | s333756513 | Accepted | s=input()
for x in s:
if s.count(x)>1:
print("no")
break
else:
print("yes") |
p04019 | s954952565 | Wrong Answer | s = input()
if ('S' in s and 'N' in s) or ('S' not in s and 'N' not in s):
print('Yes')
elif ('E' in s and 'W' in s) or ('E' not in s and 'W' not in s):
print('Yes')
else:
print('No') |
p02727 | s554340471 | Accepted | x,y,a,b,c=map(int, input().split())
p=list(map(int, input().split()))
q=list(map(int, input().split()))
r=list(map(int, input().split()))
p=sorted(p)
q=sorted(q)
r=sorted(r)
print(sum(sorted(p[-x:]+q[-y:]+r[-x-y:])[-x-y:])) |
p03059 | s230284277 | Accepted | A, B, T = map(int,input().split())
print( (T//A) * B ) |
p02744 | s658865502 | Accepted | from string import ascii_lowercase as alph
def gen_pattern(N, pre="", m=-1):
for i in range(m+2):
pat = pre+alph[i]
if len(pat) == N:
yield pat
else:
yield from gen_pattern(N, pat, max(i,m))
for pattern in gen_pattern(int(input())):
print(pattern)
|
p02996 | s486632556 | Wrong Answer | N = int(input())
ab = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
ab[i].append(ab[i][1] - ab[i][0])
from operator import itemgetter
ab.sort(key=itemgetter(2))
cnt = 0
max_ = 0
for i in range(N):
cnt += ab[i][0]
max_ = max(max_, ab[i][1])
if cnt > ab[N - 1][1]:
print('No')
else:
print('Yes')
|
p03351 | s321427350 | Wrong Answer | a,b,c,d=map(int,input().split())
if abs(a-c)<=d or abs(a-b)+abs(b-c)<=2*d:
ans="Yes"
else:
ans="No"
print(ans) |
p03767 | s003240216 | Wrong Answer | def getInput():
return [int(i) for i in input().rstrip().split(' ')]
N = getInput()[0]
a_i = getInput()
a_i.sort(reverse=True)
lst = [a_i[i] for i in range(len(a_i)) if i >= N and i < 2*N]
print(sum(lst)) |
p02771 | s084877350 | Wrong Answer | A, B, C = map(int, input().split())
if A == B:
print("Yes")
exit()
if B == C:
print("Yes")
exit()
if A == C:
print("Yes")
exit()
print("No") |
p02814 | s865634229 | Accepted | import math
N,M = map(int,input().split())
A = list(map(int,input().split()))
LCM = A[0]
for i in range(1, N):
LCM = LCM * A[i] // math.gcd(LCM, A[i])
for i in range(N):
temp = LCM//A[i]
if temp%2 == 0: #存在しない
print(0)
exit()
MIN = LCM//2
nokori = M - MIN
#print(MIN,nokori,LCM)
ans = nokori//LCM + 1
print(ans) |
p02771 | s130955658 | Accepted | a, b, c = input().split()
count = 0
if(a == b): count += 1
if(b == c): count += 1
if(c == a): count += 1
print("Yes" if(count == 1) else "No") |
p02797 | s814386501 | Accepted | n ,k, s = map(int, input().split())
for i in range(k):
print(s, end=' ')
for i in range(n-k):
if s == 10**9:
print(s-1, end=' ')
else:
print(s+1, end=' ')
print()
|
p03087 | s506817362 | Accepted | import numpy
n,q = [int(x) for x in input().split()]
s = input()
li = [0]*(n+1)
for i in range(n-1):
if (s[i]=="A" and s[i+1] == "C"):
li[i+1] = 1
cum = numpy.cumsum(li)
for i in range(q):
l,r = [int(x) for x in input().split()]
print(cum[r-1]-cum[l-1]) |
p02946 | s066381381 | Accepted | k, x = map(int, input().split())
for i in range(x-k+1, x+k):
print(i, end = " ") |
p03127 | s915152692 | Accepted | import math
N=int(input())
S=list(map(int,input().split()))
F=S[0]
for i in range(N-1):
F=math.gcd(F,S[i+1])
print(F) |
p03162 | s287063112 | Accepted | import sys
input = sys.stdin.readline #文字列入力では注意！
N = int(input())
a,b,c = map(int,input().split())
dp = [[a,b,c]]
for i in range(N-1):
a,b,c = map(int,input().split())
A = max(dp[i][1]+a,dp[i][2]+a)
B = max(dp[i][2]+b,dp[i][0]+b)
C = max(dp[i][0]+c,dp[i][1]+c)
dp.append([A,B,C])
print(max(dp[-1]))
|
p03208 | s127016489 | Accepted | n,k = map(int,input().split())
li = [int(input()) for _ in range(n)]
li.sort()
ans = 10**10
for i in range(n-k+1):
ans = min(ans,li[i+k-1]-li[i])
print(ans) |
p03160 | s291380624 | Wrong Answer | import sys
n = int(sys.stdin.readline())
inp = list(map(lambda x: int(x), sys.stdin.readline().split(" ")))
dp = [0]*(n)
dp[1] = abs(inp[1]-inp[0])
for i in range(1,n-1):
if (abs(inp[i+1]-inp[i-1]) < abs(inp[i+1]-inp[i])):
dp[i+1] = abs(inp[i+1]-inp[i-1]) + dp[i-1]
else:
dp[i+1] = abs(inp[i+1]-inp[i]) + dp[i]
print(dp[-1]) |
p02779 | s765130269 | Accepted | N = int(input())
A = {i for i in input().split()}
print("YES" if N==len(A) else "NO") |
p03623 | s898025371 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7
x,a,b=MI()
l1=abs(x-a)
l2=abs(x-b)
if l1<l2:
print("A")
else:
print("B") |
p02694 | s815983258 | Wrong Answer | X = int(input())
n = 100
cnt = 0
while n < X:
n += int(n*0.01)
cnt += 1
print(cnt)
|
p02959 | s803823969 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sm = sum(B)
for i in range(N):
if A[i] > B[i]:
A[i] -= B[i]
B[i] = 0
else:
B[i] -= A[i]
A[i] = 0
if A[i+1] > B[i]:
A[i+1] -= B[i]
B[i] = 0
else:
B[i] -= A[i+1]
A[i+1] = 0
print(sm - sum(B))
|
p02973 | s496802445 | Wrong Answer | n=int(input())
a=[]
for i in range(n):
ai=int(input())
a.append(ai)
b=[a[n-1]]
ans=1
for i in reversed(range(n-1)):
if a[i]>=b[-1]:
b.append(a[i])
ans=ans+1
else:
for j in range(ans):
if j>a[i]:
j=a[i]
break
print(ans) |
p04011 | s111168133 | Accepted | # coding = SJIS
n = int(input())
k = int(input())
x = int(input())
y = int(input())
ans = min(n, k) * x + max(n - k, 0) * y
print(ans) |
p02848 | s013019610 | Wrong Answer | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
S = list(sys.stdin.readline())
for s in S:
n = ord(s) + N
print(chr(((n - 65)%26)+65), end="")
if __name__ == '__main__':
main()
|
p02813 | s733082398 | Accepted | import itertools
n = int(input())
p = list(map(int, input().strip().split()))
q = list(map(int, input().strip().split()))
#print(p)
#print(q)
r = list(range(1,n+1))
E = list(itertools.permutations(r))
#print(r)
#print(e)
pi = 0
qi = 0
for i in range(0,len(E)):
if p == list(E[i]):
pi = i
#print(pi)
if q == list(E[i]):
qi = i
#print(qi)
print(abs(pi - qi))
|
p02823 | s298154647 | Accepted | n,a,b = map(int, input().split())
if (b-a)%2 == 0:
print((b-a)//2)
else:
print(min(a-1,n-b)+1+(b-a-1)//2) |
p03493 | s740372064 | Wrong Answer | from sys import stdin
a = stdin.readline().rstrip()
count = 0
print (a[0],a[1],a[2])
for b in a:
if b == "1": count = count + 1
print(count) |
p03146 | s861133120 | Accepted | import sys
s=int(input())
cnt=0
if s==1 or s==2:
print('4')
sys.exit()
while s!=4:
if s%2!=0:
s=3*s+1
cnt+=1
elif s%2==0:
s=s//2
cnt+=1
if s==4:
print(cnt+4) |
p03206 | s896742547 | Wrong Answer | d=int(input())
if d==22:
print('Christmas Eve Eve Eve')
elif d==23:
print('Chistmas Eve Eve')
elif d==24:
print('Christams Eve')
else:
print('Christams') |
p02606 | s148491248 | Wrong Answer | nyuu = list(map(int, input().split()))
sho1 = nyuu[1] // nyuu[2]
sho2 = nyuu[0] // nyuu[2]
print(sho1 - sho2) |
p02838 | s699100839 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
mod = 1e9 + 7
digit = 1
for i in range(60):
one = 0
for aa in a:
if (aa >> i) & 1:
one += 1
ans += (one * (n - one) * digit) % mod
ans %= mod
digit *= 2
print(int(ans))
|
p03475 | s067174199 | Accepted | N = int(input())
C = []; S = []; F = []
for i in range(N-1):
c, s, f = map(int, input().split())
C.append(c); S.append(s); F.append(f)
for i in range(N):
t = 0
for j in range(i, N-1):
if t <= S[j]:
t = S[j]
elif t % F[j] == 0:
pass
elif t % F[j] !=0:
t += F[j] - (t%F[j])
t += C[j]
print(t)
|
p03379 | s094781138 | Accepted | N = int(input())
A = list(map(int,input().split()))
B = sorted(A)
X = B[N//2-1]
Y = B[N//2]
for i in range(N):
if A[i] <= X:
print(Y)
else:
print(X) |
p02682 | s892619397 | Wrong Answer | A,B,C,K = map(int,input().split())
if A >= K:
print(K)
elif A + B >= K:
print(K)
else:
print(A - (K-(A+B))) |
p03126 | s306418036 | Accepted | N, M = map(int, input().split())
K = [0] * N
A = [0] * N
for i in range(N):
A[i] = list(map(int, input().split()))
K[i] = A[i][0]
A[i].pop(0)
S = set(A[0])
for i in range(1, N):
S &= set(A[i])
print(len(S))
|
p02622 | s158913249 | Accepted | s = input()
t = input()
count=0
for (i,j) in zip(s,t):
if i != j:
count+=1
print(count)
|
p02957 | s942174100 | Wrong Answer | a, b = map(int, input().split())
ans = -(a*a-b*b)/(2*(b-a))
if type(ans) == int:
print(ans)
else:
print('IMPOSSIBLE') |
p03162 | s993273768 | Accepted | n=int(input())
abc=[[-1,-1,-1,-1]]
for i in range(n):
a,b,c=map(int,input().split())
abc.append([-1,a,b,c])
dp=[[0 for i in range(4)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(1,4):
for k in range(1,4):
if j==k:
continue
dp[i][k]=max(dp[i][k],dp[i-1][j]+abc[i][k])
ans=max(dp[n])
print(ans) |
p02675 | s307622257 | Wrong Answer | a= str(input())
b = a[-1]
if b == 3:
print("bon")
elif b == 0 or b==1 or b==6 or b ==8:
print("pon")
else:
print("hon")
|
p02848 | s871429474 | Wrong Answer | A = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','S','Y','X','Z']
N = int(input())
S = list(input())
B = []
for i in range(len(S)):
for j in range(26):
if S[i] == A[j]:
if j+N > 25:
B.append(A[j+N-25])
else:
B.append(A[j+N])
print(''.join(B)) |
p03696 | s567475714 | Accepted | input()
t=s=input()
p,q=o="()"
while o in s:s=s.replace(o,"")
print(p*s.count(q)+t+q*s.count(p)) |
p03407 | s074851636 | Wrong Answer | A,B,C=map(int,input().split())
print('Yes' if A+(B*2)>=C else 'No') |
p03759 | s809671060 | Accepted | a, b, c = map(int, input().split())
if (b-a) == (c-b):
print('YES')
else:
print('NO') |
p02783 | s894958586 | Wrong Answer | # = int(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = list(input())
# = [tuple(map(int, input().split())) for _ in range(n)]
h, a = map(int, input().split())
print(h // a)
|
p02554 | s416808115 | Accepted | import sys
import math
input = sys.stdin.readline
n = int(input())
print((10**n - 2*(9**n)+8**n)%((10**9)+7))
|
p02687 | s116594689 | Accepted | s = input()
if s=="ABC":
print("ARC")
else:
print("ABC") |
p03555 | s611210543 | Accepted | c1=input()
c2=input()
print("YES" if c1[::-1]==c2 else "NO") |
p03286 | s216756744 | Accepted | N=int(input())
ans=''
for i in range(33):
if N%pow(2,i+1):
ans+='1'
N-=pow(-2,i)
else:
ans+='0'
print(int(ans[::-1])) |
p02792 | s508096458 | Wrong Answer | from numpy import zeros
N = int(input())
A = zeros((10,10))
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
A[a][b] += 1
cnt = 0
for _ in range(1,N+1):
a = int(str(_)[0])
b = int(str(_)[-1])
cnt += A[b][a]
print(cnt) |
p02772 | s092564499 | Accepted | n=int(input())
a=list(map(int,input().split()))
f=1
for i in range(n):
if a[i]%2:
continue
else:
if a[i]%3==0 or a[i]%5==0:
continue
else:
f=0
if f:
print("APPROVED")
else:
print("DENIED")
|
p02953 | s491192155 | Accepted | N=int(input())
List = list(map(int, input().split()))
Max=0
i=0
while i<N:
if List[i]-Max <= -2:
print("No")
quit()
Max=max(Max,List[i])
i+=1
print("Yes") |
p02725 | s656003275 | Accepted | k,n = map(int,input().split())
A = list(map(int,input().split()))
A.append(A[0]+k)
B = [0 for i in range(n)]
for j in range(n):
B[j] = A[j+1] - A[j]
#print(A)
#print(B)
B.sort()
B.pop()
#print(B)
ans = sum(B)
print(ans) |
p02753 | s150137825 | Accepted | def main():
l = list(str(input()))
ans = 0
for i in range(len(l)-1):
if l[i] != l[i+1]:
ans += 1
if ans > 0:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() |
p02677 | s720816023 | Accepted | from math import cos, pi, sqrt
a, b, h, m = map(int, input().split())
th = 2 * pi * (h / 12) + (2 * pi / 12) * (m / 60)
tm = 2 * pi * (m / 60)
answer = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(th - tm))
print(answer)
|
p03264 | s160494425 | Wrong Answer | a=int(input())
if a%2==0:
ans=(a/2)**2
else:
ans=((a-1)/2)*((a+1)/2)
print(ans) |
p02594 | s300206268 | Wrong Answer | X = int(input())
if X>=30:
print("Yes")
else:
print("Np") |
p03795 | s013828102 | Accepted | n=int(input())
print(800*n-200*(n//15)) |
p02989 | s344754748 | Accepted | n=int(input())
d=list(map(int,input().split()))
d_sort = sorted(d)
d_med1 = d_sort[len(d)//2-1]
d_med2 = d_sort[len(d)//2]
print(d_med2-d_med1) |
p02748 | s473142517 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
A, B, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a) + min(b)
for _ in range(m):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + b[y-1] - c)
print(ans) |
p02608 | s803317273 | Accepted | def main():
N = int(input())
ans = [0] * (10**4 + 1)
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
tmp = i**2 + j**2 + k**2 + i*j + j*k + k*i
if tmp < 10**4 + 1:
ans[tmp] += 1
for i in range(1, N+1):
print(ans[i])
if __name__ == "__main__":
main()
|
p02613 | s625117568 | Accepted | n = int(input())
d = dict()
for _ in range(n):
k = input()
if d.get(k):
d[k] += 1
else:
d[k] = 1
for kk in ['AC', 'WA', 'TLE', 'RE']:
if d.get(kk):
print(kk + ' x ' + str(d.get(kk)))
else:
print(kk + ' x 0')
|
p03319 | s639514087 | Accepted | #!/usr/bin/env python3
n, k = map(int, input().split())
print(0--~-n//~-k) |
p02948 | s149998667 | Accepted | from heapq import heappush,heappop
n,m=[int(x) for x in input().rstrip().split()]
ab=[[] for i in range(10**5)]
for i in range(n):
a,b=[int(x) for x in input().rstrip().split()]
ab[a-1].append(-b)
ans=0
time=0
l=[]
for i in range(m):
for b in ab[i]:
heappush(l,b)
if l:
ans-=heappop(l)
print(ans) |
p02697 | s212156849 | Accepted | def main():
n, m = map(int, input().split())
left = 1
right = n
is_shift = False
ans = []
while left < right:
if right - left <= n // 2 and not is_shift and n % 2 == 0:
left += 1
is_shift = True
ans.append([left, right])
left += 1
right -= 1
for l in range(m):
print(*ans[l])
if __name__ == "__main__":
main()
|
p03457 | s047679158 | Accepted | import sys
input = sys.stdin.buffer.readline #inputに置き換え可能
n = int(input())
txy = [[0,0,0]] + [list(map(int,input().split())) for i in range(n)]
flg = True
for i in range(1, n+1):
dt = txy[i][0] - txy[i-1][0]
dx = abs(txy[i][1] - txy[i-1][1])
dy = abs(txy[i][2] - txy[i-1][2])
dxdy = dx + dy
if dt % 2 != dxdy % 2 or dt < dxdy:
flg = False
break
print('Yes') if flg else print('No') |
p02630 | s841971212 | Accepted | n=int(input())
alist=list(map(int,input().split()))
q=int(input())
numdic={}
for i in range(10**5):
numdic[i+1]=0
for a in alist:
numdic[a] = numdic[a] + 1
outsum=sum(alist)
for i in range(q):
tmpb,tmpc=map(int,input().split())
tmp = numdic[tmpb]
outsum += (tmpc-tmpb)*tmp
print(outsum)
numdic[tmpb]=0
numdic[tmpc]=numdic[tmpc]+tmp
|
p03944 | s087580570 | Wrong Answer | W, H, N = map(int, input().split())
lis = []
xi = 0
yi = 0
xj = 0
yj = 0
for i in range(N):
#lis.append(list(map(int, input().split())))
x, y, a = map(int, input().split())
if a==1:
xi += x
elif a==2:
xj += x
elif a==3:
yi += y
elif a==4:
yj += y
x = (W-xj)-xi
if x<0:
x = 0
y = (H-yj)-yi
if y<0:
y = 0
print(x*y) |
p03208 | s010630280 | Accepted | N, K = map(int, input().split())
h = []
ans = 1000000000
for i in range(N):
h.append(int(input()))
h = sorted(h)
for j in range(N-K+1):
if ans > h[j+K-1]-h[j]:
ans = h[j+K-1]-h[j]
print(ans)
|
p03544 | s289766234 | Wrong Answer | n = int(input())
l1 = 2
l2 = 1
l = 0
for i in range(n-1):
l = l1+l2
l1, l2 = l2, l
print(l) |
p03160 | s105303366 | Accepted | N = int(input())
h = list(map(int, input().split())) + [0]*100010
dp = [float("inf")]*100010
dp[0] = 0
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i] + abs(h[i+1] - h[i]))
dp[i+2] = min(dp[i+2], dp[i] + abs(h[i+2] - h[i]))
# print(dp)
print(dp[N-1]) |
p03433 | s427720222 | Accepted | N=int(input())
A=int(input())
if (N%500<=A):
print("Yes")
else:
print("No") |
p02688 | s411460408 | Wrong Answer | N,K = map(int,input().split())
s = [input() for i in range(K*2)]
l = []
c = 0
k = 0
m = 0
# スペース区切りの整数の入力
num = []
for i in range(K*2):
if i%2==1:
for m in range(int(s[i-1])):
num.append(s[i].split()[m])
for j in (1,N+1):
k=num.count(str(j))
if k == 0:
c = c+1
print(c) |
p03799 | s543060815 | Accepted | n,m=map(int,input().split())
if 2*n<=m:
print(n+(m-2*n)//4)
else:
print(m//2) |
p03555 | s204665438 | Accepted | C1 = input()
C2 = input()
ans = "NO"
if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
ans = "YES"
print(ans)
|
p02873 | s621575602 | Accepted | s = input()
def comb(x):
return x * (x-1) // 2
left, right = 0, 0
ans = 0
pre = '<'
for c in s:
if pre == '>' and c == '<':
ans += comb(min(left, right)) + comb(max(left, right)+1)
left, right = 1, 0
elif c == '<':
left += 1
else:
right += 1
pre = c
ans += comb(min(left, right)) + comb(max(left, right) + 1)
print(ans) |
p02724 | s110622871 | Wrong Answer | X = int(input())
a = X // 500
Y = X - 500 * a
b = Y // 5
print(a)
print(a * 1000 + b * 5)
|
p03162 | s100138095 | Accepted | N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
# dp[i][j] i日目にjを選んだ場合の幸福度
dp = [[0]*3 for _ in range(N+1)]
for i, a in enumerate(A):
for j, h in enumerate(a):
dp[i+1][j] = max(dp[i][(1+j)%3], dp[i][(2+j)%3]) + h
print(max(dp[N])) |
p02748 | s645568471 | Wrong Answer | A,B,M=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
noti=min(a)+min(b)
ans=0
c=0
for i in range(M):
c=a[xyc[i][0]-1] + b[xyc[i][1]-1] -xyc[i][2]
ans=min(noti,c)
print(ans) |
p02707 | s679753290 | Accepted | n = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(n)]
for i in range(n-1):
B[A[i]-1] += 1
for i in range(n):
print (B[i]) |
p02912 | s337295664 | Wrong Answer | from heapq import heapify, heappop, heappush
n, m = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] *= -1
heapify(a)
print(a)
for i in range(m):
maxa = heappop(a)
heappush(a, -(-maxa//2))
print(a)
print(-(sum(a))) |
p03495 | s718991910 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
n=[0]*200000
x=[]
for i in a:
n[i-1]+=1
for i in n:
if i!=0:
x+=[i]
y=len(x)
z=y-k
if z<=0:
print(0)
else:
x.sort()
print(sum(x[:z])) |
p02719 | s716739612 | Accepted | x, k = map(int, input().split())
print(min(x%k, k - x%k)) |
p03252 | s678445345 | Accepted | s = list(input())
t = list(input())
n = len(s)
atoz = [chr(i) for i in range(97, 97+26)]
rs = [-1]*26
rt = [-1]*26
for i in range(n):
if rs[atoz.index(s[i])] != -1 or rt[atoz.index(t[i])] != -1:
if rs[atoz.index(s[i])] != t[i] or rt[atoz.index(t[i])] != s[i]:
print("No")
break
else:
rs[atoz.index(s[i])] = t[i]
rt[atoz.index(t[i])] = s[i]
else:
print("Yes") |
p02791 | s218301989 | Wrong Answer | n = int(input())
p = list(map(int,input().split()))
counter = 0
for i in range(n):
min = p[i]
for j in range(0,i):
print("hogeb:"+str(p[j])+"&"+ str(p[i]))
if min >= p[j]:
min = p[j]
if min == p[i]:
counter += 1
print(str(counter))
|
p03778 | s837169705 | Accepted | W,a,b=map(int,input().split())
if b+W<a:
print(a-(b+W))
elif a+W<b:
print(b-(a+W))
else:
print(0) |
p02922 | s334231964 | Accepted | a, b = map(int, input().split())
n = 0
while (a*n-(n-1)) < b:
n+=1
print(n) |
p02971 | s727892636 | Accepted | n=int(input())
a=[int(input())for _ in range(n)]
b=sorted(a)
max_a=max(a)
second=b[-2]
for i in range(n):
if a[i] != max_a:
print(max_a)
else:
print(second)
|
p03359 | s460855247 | Wrong Answer | a,b = map(int, input().split())
if a < b:
print(a)
else:
print(a-1) |
p02796 | s934030397 | Accepted | n = int(input())
count = 0
X = []
for i in range(n):
x,l = map(int, input().split())
X.append((x+l,x-l))
X.sort()
coord = -float('inf')
for i in X:
if i[1] >= coord:
count += 1
coord = i[0]
print(count) |
p03778 | s685998664 | Accepted | W,a,b=map(int,input().split())
ans=0
if a+W<b:
ans=b-(a+W)
elif b+W<a:
ans=a-(b+W)
print(ans) |
p03767 | s289371955 | Accepted | N = int(input())
list = [int(i) for i in input().split()]
list.sort(reverse = True)
temp = 0
for i in range(N):
temp += list[1+2*i]
print(temp)
|
p03854 | s822068989 | Accepted | s=input()
while True:
for flag in ["erase","eraser","dream","dreamer"]:
if s.endswith(flag):
s=s[:-len(flag)]
break
else:
print("NO")
break
if len(s)==0:
print("YES")
break |
p03011 | s222983388 | Accepted | P,Q,R=map(int,input().split())
ans=[]
ans.append(P)
ans.append(Q)
ans.append(R)
sorted(ans)
print(P+Q+R-max(ans)) |
p03862 | s747945418 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
now = A[0]
if now > x:
ans += now - x
now = x
for i in range(1, N):
if now + A[i] > x:
y = now + A[i] - x
ans += y
A[i] = max(0, A[i] - y)
now = A[i]
print(ans)
|
p03417 | s414747148 | Wrong Answer | n,m=map(int,input().split())
if n<m:
n,m=m,n
if m==1:
print(n-2)
elif m==2:
print(0)
else:
print((m-2)*(n-2)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.