problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03555 | s001351077 | Accepted | import sys
import math
import bisect
def main():
s = input()
t = input()
if s == t[::-1]:
print('YES')
else:
print('NO')
if __name__ == "__main__":
main()
|
p02624 | s505210060 | Accepted | N = int(input())
ans = 0
if N == 1:
print(1)
exit()
if N == 2:
print(5)
exit()
if N == 3:
print(11)
exit()
for i in range(1, N//2+2):
last = N//i
ans += ((1+last) * last // 2 * i)
ans += (N//2+2 + N) * (N - N//2 - 1) // 2
print(ans) |
p02793 | s500323392 | Accepted | import fractions
N = int(input())
A = [int(i) for i in input().split()]
def lcm(a,b):
return a*b//fractions.gcd(a,b)
a_lcm = A[0]
for a in A[1:]:
a_lcm = lcm(a_lcm, a)
ans = 0
for a in A:
ans += a_lcm//a
print(ans%(10**9+7)) |
p03371 | s129414701 | Wrong Answer | a,b,c,x,y = map(int,input().split())
A_B = a*x+b*y
A_AB = a*x+2*c*y
AB_B = 2*c*x+b*y
AB = 2*c*max(x,y)
ans = min(A_B,A_AB,AB_B,AB)
print(ans)
|
p03644 | s610400987 | Wrong Answer | N=int(input())
ans=0
for i in range(0,N):
if 2**i>N:
ans=2**(i-1)
break
else:
continue
print(0 if N==1 else ans) |
p02761 | s548027323 | Wrong Answer | N,M = map(int,input().split())
A = ['a']*N
for _ in range(M):
s,c = map(int,input().split())
if A[s-1] !='a' and A[s-1] != c:
print(-1)
exit()
else:
A[s-1] = c
for i in range(N):
if A[0] == 'a' and N==3:
A[0] = 1
elif A[i] == 'a':
A[i] = 0
Answer = ''.join(map(str,A))
if Answer != '0' and len(Answer) != N:
Answer = -1
if Answer == '000':
Answer = -1
print(Answer)
|
p02598 | s152160697 | Accepted | N,K=map(int,input().split())
L=list(map(int,input().split()))
import math
MAX=10**9
MIN=0
for i in range(100):
Mid=(MAX+MIN)/2
cnt=0
for j in range(N):
cnt+=L[j]//Mid
if cnt<=K:
MAX=Mid
else:
MIN=Mid
#print(cnt)
print(math.ceil(Mid))
|
p03408 | s618911233 | Accepted | n=int(input())
s=[input() for _ in range(n)]
m=int(input())
t=[input() for _ in range(m)]
ans=0
for i in set(s):
ans=max(s.count(i)-t.count(i),ans)
print(ans) |
p03059 | s156976045 | Accepted | a, b, t = map(int, input().split())
print(int((t+0.5)//a*b)) |
p03457 | s385415472 | Accepted | N = int(input())
D = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]
for i in range(1, N + 1):
t = D[i][0] - D[i - 1][0]
d = D[i][1] - D[i - 1][1] + D[i][2] - D[i - 1][2]
if (t < d) or (t % 2 != d % 2):
print('No')
break
else:
print('Yes') |
p02987 | s778292638 | Wrong Answer | s = input()
a = sorted(s)
print("Yes" if a[0]==a[1] and a[2]==a[3] else "No")
|
p02783 | s592252540 | Accepted | h,a = map(int,input().split())
if h%a==0:
print(h//a)
else:
print(h//a+1)
|
p02576 | s834707477 | Accepted | i = list(map(int, input().split()))
ws = i[0]
cs1 = i[1]
cs2 = i[1]
t = i[2]
n = 1
while ws > cs1:
n += 1
cs1 += cs2
tt = n * t
print(tt)
|
p04020 | s004667483 | Accepted | N = int(input())
A = [int(input()) for _ in range(N)]
cnt = 0
remain = 0
for a in A:
if a == 0:
remain = 0
continue
cnt += (a+remain)//2
remain = (a+remain)%2
print(cnt) |
p02748 | s301968917 | Accepted | 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 _ in range(m)]
ans = float('inf')
for x, y, c in xyc:
ans = min(ans, a[x-1] + b[y-1] - c)
print(min(min(a) + min(b), ans))
|
p03455 | s290351460 | Wrong Answer | a, b = map(int, input().split())
c = (a*b)%2
if c == 0:
print("even")
else:
print("odd") |
p03971 | s906687892 | Accepted | N, A, B = map(int, input().split())
S = input()
n_pass = 0
n_overseas = 0
for s in S:
if s == "a":
if n_pass < A+B:
print("Yes")
n_pass += 1
else:
print("No")
elif s == "b":
if n_pass < A+B and n_overseas < B:
print("Yes")
n_pass += 1
n_overseas += 1
else:
print("No")
else:
print("No")
|
p03645 | s354286049 | Wrong Answer | N, M = map(int, input().split())
ab = []
for i in range(M):
a, b = map(int, input().split())
if a == 1 or b == N:
ab.append([int(a), int(b)])
flag = False
for i in range(len(ab)):
for k in range(len(ab)-i):
if len(list(set(ab[i])&set(ab[k])))==1:
print('POSSIBLE')
flag = True
break
if flag:
break
else:
print('IMPOSSIBLE') |
p03814 | s596599679 | Wrong Answer | s = list(input())
start = 0
end = 0
for i in range(len(s)):
if s[i] == "A":
start = i
for i in reversed(range(len(s))):
if s[i] == "Z":
end = i
print(end - start + 1) |
p02631 | s000515808 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = []
max_length = len('{:b}'.format(max(a)))
for i in range(n):
bit = '{:b}'.format(a[i]).rjust(max_length, '0')
num = 0
for j in range(max_length):
if bit[j] == '0':
num += pow(2, max_length - j - 1)
ans.append(num)
for i in range(n):
print(ans[i])
|
p02772 | s989592517 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
count=0
for n in A:
if (n % 2) == 0:
count += 1
if (n % 3) != 0 and (n % 5) != 0:
print("DENIED")
exit()
if count == 0:
print("DENIED")
else:
print("APPROVED") |
p02854 | s301419569 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
sm=sum(a)
i=0
han=0
while sm/2>han:
if i==n-1:
break
han+=a[i]
i+=1
nhan=sm-han
print(abs(han-nhan)) |
p03274 | s435635509 | Accepted | import numpy as np
N, K = map(int, input().split())
X = np.array(list(map(int, input().split())))
idx = np.searchsorted(X, 0)
# print('idx', idx)
ans = 10**10
for i in range(N - K + 1):
l = i
r = i + K - 1
d1 = np.abs(X[l]) + np.abs(X[r] - X[l])
d2 = np.abs(X[r]) + np.abs(X[r] - X[l])
d = min(d1, d2)
ans = min(ans, d)
print(ans)
|
p02690 | s703094568 | Wrong Answer | X = int(input())
for a in range(-5, 5):
for b in range(-5, 5):
#print(a,b)
if a**5 - b**5 == X:
print(a, b)
exit() |
p02753 | s234702101 | Wrong Answer | S = input()
if S == "AAA" or S == "BBB":
print("no")
else:
print("yes")
|
p03067 | s372703906 | Wrong Answer | A, B, C = map(int, input().split())
if A <= C <= B and A >= B >= C:
print("Yes")
else:
print("No") |
p02971 | s970350369 | Wrong Answer | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
a = [int(input()) for _ in range(n)]
m = max(a)
s = sorted(a)[1]
for i in a:
if i == m:
print(s)
else:
print(m)
if __name__=="__main__":
main()
|
p03951 | s518076352 | Wrong Answer | n = int(input())
s = input()
t = input()
if s == t:
print(n)
exit()
ss = s+t
ans = ''
slen = len(s)
for i in range(slen):
k = slen - i -1
l = slen + i
if ss[k] == ss[l]:
ans = ss[:k]+ss[l:]
if len(ans) == 0:
print(len(ss))
else:
print(len(ans))
|
p02701 | s649001206 | Accepted | N = int(input())
S = []
for i in range(N):
s = str(input())
S.append(s)
S = set(S)
print(len(S))
|
p02584 | s612131548 | Accepted | X, K, D = map(int, input().split())
x = abs(X)
if X == 0:
cnt = K
if cnt % 2 == 0:
ans = 0
else:
ans = D
elif x >= D:
cnt = K - x//D
if x- K*D >= 0:
ans = x - K*D
elif x - K*D < 0 and cnt % 2 == 0:
ans = abs(x%D)
else:
ans = abs(D - x%D)
elif x < D:
cnt = K
if cnt % 2 == 0:
ans = abs(x)
else:
ans = abs(x-D)
print(ans) |
p03035 | s545405083 | Accepted | A,B = map(int, input().split())
if A >= 13:
print(B)
elif A >= 6:
print(B // 2)
else:
print(0) |
p03419 | s780692745 | Wrong Answer | n,m = map(int,input().split())
if n == 1 and m == 1:
print(1)
elif n == 1:
print(m-2)
elif m == 1:
print(n-2)
elif n == 2:
print((m-2)*2)
elif m == 2:
print((n-2)*2)
else:
print(n*m-(n*2 + m*2 - 4)) |
p03162 | s564055583 | Accepted | n = int(input())
h = []
for _ in range(n):
h.append(list(map(int, input().split())))
res = h[0]
for i in range(1, n):
tmp = res[:]
for j in range(3):
res[j] = h[i][j] + max(tmp[(j + 1) % 3], tmp[j - 1])
print(max(res)) |
p03250 | s428935882 | Wrong Answer | a,b,c=input().split()
print(max(a,b,c)*9+a+b+c) |
p03698 | s794651420 | Accepted | S = list(input())
S_s = set(S)
if len(S) == len(S_s):
print('yes')
else:
print('no') |
p03774 | s604763264 | Accepted | import numpy as np
n, m = map(int, input().split())
ab = []
for _ in range(n):
a, b = map(int, input().split())
ab.append((a, b))
result = np.zeros([m, n], dtype=np.int64)
cd = []
for i in range(m):
c, d = map(int, input().split())
for j, (a, b) in enumerate(ab):
result[i, j] = abs(a - c) + abs(b - d)
print(*result.argmin(axis=0) + 1, sep="\n") |
p02695 | s281174812 | Accepted | N,M,Q = map(int,input().split())
abcd = [list(map(int,input().split())) for i in range(Q)]
import itertools
A = list(itertools.combinations_with_replacement(range(1,M+1),N))
answer = 0
for i in range(len(A)):
ans = 0
for j in range(Q):
if A[i][ abcd[j][1]-1 ] - A[i][ abcd[j][0]-1 ] == abcd[j][2]:
ans += abcd[j][3]
answer = max(answer,ans)
print(answer) |
p02570 | s320870683 | Wrong Answer | x,y ,z= map(int,input().split())
ans=x/z
if ans>=y:
print('Yes')
else:
print('No') |
p03681 | s879470357 | Wrong Answer | N,M=map(int,input().split())
MOD=10**9+7
s=1
for i in range(2,N+1):
s=s*i
t=1
for j in range(2,M+1):
t=t*j
if N-1==M:
print((s*t)%MOD)
if N==M-1:
print((s*t)%MOD)
if N==M:
print((2*s*t)%MOD)
else:
print(0) |
p03471 | s650059933 | Accepted | from itertools import *
N,Y = map(int,input().split())
if 10000*N < Y:
print(-1,-1,-1)
exit()
for i in range(N):
for j in range(N-i):
k = N-i-j
for xyz in permutations([i,j,k],3):
x,y,z = xyz
if 10000*x + 5000*y + 1000*z == Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03211 | s735887313 | Accepted | s = input()
ans=999
for i in range(len(s)-2):
ans = min(ans,abs(753-int(s[i:i+3])))
print(ans) |
p03544 | s661398847 | Accepted | L = [2,1]
n = int(input())
for i in range(2,n+1):
L.append(L[i-1]+L[i-2])
print(L[n]) |
p02711 | s332596706 | Accepted | N = input()
if '7' in N:
print('Yes')
else:
print('No') |
p03317 | s606727605 | Accepted | N,K = map(int, input().split())
A = list(map(int, input().split()))
print((N+K-3)//(K-1)) |
p02796 | s814829456 | Wrong Answer |
N = int(input())
robots = []
for i in range(N):
robots.append(list(map(int, input().split(" "))))
robots.sort()
new = []
for robot in robots:
if len(new) == 0:
new.append(robot)
if (new[-1][0] + new[-1][1]) <= (robot[0] - robot[1]):
new.append(robot)
continue
print(len(new)) |
p03103 | s847389663 | Wrong Answer | import numpy as np
N, M = map(int, input().split())
AB = np.zeros(0, dtype=int)
for i in range(N):
a, b = map(int, input().split())
AB = np.concatenate([AB, np.full(b, a)])
AB = np.sort(AB)
print(AB[:M].sum()) |
p02553 | s792347336 | Accepted | a,b,c,d=map(int,input().split())
print(max(a*c,a*d,b*c,b*d)) |
p03493 | s933967052 | Accepted | s = input()
print(s.count("1"))
|
p02677 | s491914827 | Wrong Answer | import math
in1 = input().split()
A = float(in1[0])
B = float(in1[1])
H = float(in1[2])
M = float(in1[3])
aH = 0.5 * (H * 60 + M)
aM = 6*M
ra = abs(aH-aM)
ra1 = min(360 - ra, ra)
C2 = ((A*A)+(B*B))- (2*(A*B))*(math.cos(math.radians(ra1)))
print(math.sqrt(C2))
print(ra1)
|
p03059 | s654403986 | Accepted | a,b,t = map(int, input().split())
print((t // a) * b) |
p03951 | s460793607 | Wrong Answer | N = int(input())
s = input()
t = input()
index = 0
for i in s:
if i == t[index]:
index += 1
else:
continue
print(s + t[index:]) |
p03543 | s346044684 | Wrong Answer | N=input()
if N[0]==N[1]==N[2]:
print("Yes")
elif N[1]==N[2]==N[3] and N[0]==N[1]==N[2]==N[3]:
print("Yes")
else:
print("No") |
p02678 | s537146519 | Accepted | from collections import deque
N,M=map(int,input().split(' '))
chk = [0 for i in range(N+1)]
chk[0]=chk[1]=1
maze = [[] for i in range(N+1)]
for i in range(M):
a,b=list(map(int,list(input().split(' '))))
maze[a].append(b)
maze[b].append(a)
l = deque([1])
while l:
n = deque.popleft(l)
for i in maze[n]:
if not chk[i]:
chk[i]=n
l.append(i)
if 0 in chk:
print('No')
exit()
print('Yes')
for i in chk[2:]:
print(i) |
p02547 | s883567761 | Wrong Answer | import itertools
n = int(input())
count = 0
line = [input().split() for i in range(n)]
line = list(itertools.chain.from_iterable(line))
for j in range(len(line)-2):
if line[j] == line[j+1]:
if line[j+2] == line[j]:
count += 1
print('Yes')
else:
continue
if count == 0:
print('No') |
p02693 | s816047169 | Accepted | k=int(input())
l=list(map(int, input().split(' ')))
a=l[0]
b=l[1]
if (b-a)+1>=k:
print('OK')
else:
maybe=(a//k)*k
ans=False
while maybe<=b:
if maybe>=a:
ans=True
break
else:
maybe+=k
if ans:
print('OK')
else:
print('NG')
|
p02957 | s241079117 | Accepted | a,b = map(int,input().split())
if abs(b-a)%2!=0:
print("IMPOSSIBLE")
else:
print((a+b)//2)
|
p02899 | s333040624 | Accepted | N=int(input())
A=list(map(int, input().split()))
ans=[0]*N
for i in range(N):
k=A[i]
ans[k-1]=i+1
print(*ans , sep=' ') |
p02755 | s027587965 | Wrong Answer | a, b = map(int, input().split())
xa = int(a/0.08)
xb = int(b/0.1)
if xa == xb:
print(xa)
else:
if int(xa*0.1) == b:
print(xa)
elif int(xb*0.08) == a:
print(xb)
else:
print(-1)
|
p03379 | s081657587 | Wrong Answer | n = int(input())
x = sorted(list(map(int, input().split())))
a = x[len(x)//2]
b = x[(len(x)//2) - 1]
for _ in range(len(x)//2):
print(a)
for _ in range(len(x)//2):
print(b)
|
p02598 | s250200717 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
l = 0
r = 10 ** 9
while r-l > 1:
m = (r+l) // 2
count = 0
for i in A:
if i > m:
count += i // m
if count > K:
l = m
else:
r = m
print(r) |
p02597 | s588498770 | Accepted | N = int(input())
c=list(input())
countR = c.count('R')
countW2 = 0
countR2 = 0
for i in range(countR):
if c[i]=="W":
countW2 += 1
print(countW2) |
p03069 | s883630224 | Accepted | n=int(input())
s=input()
ans=s.count('.')
cnt=ans
for i in s:
if i=='.':
cnt-=1
ans=min(ans,cnt)
else:
cnt+=1
ans=min(ans,cnt)
print(ans) |
p02665 | s628009016 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans, cnt, node = 0, sum(A), 1
for i in range(N + 1):
ans += node
cnt -= A[i]
node = min(cnt, (node - A[i]) * 2)
if node < 0:
print(-1)
break
else:
print(ans)
|
p02947 | s874627446 | Wrong Answer | from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
ans = 0
check_box = []
for s in S:
s = sorted(s)
s = ''.join(s)
check_box.append(s)
C = Counter(check_box)
for i in C:
if C[i] > 2:
ans += C[i]
elif C[i] == 1:
pass
else:
ans += 1
print(ans) |
p03239 | s206670375 | Accepted | (N, T), *D, = [list(map(int, s.split())) for s in open(0)]
min_cost = 1e10
idx = 0
for i in range(len(D)):
if T >= D[i][1] and D[i][0] < min_cost:
idx = i
min_cost = D[i][0]
if min_cost == 1e10:
print("TLE")
else:
print(min_cost) |
p02988 | s768062908 | Accepted | n=int(input())
p=[int(x) for x in input().split()]
result = 0
for i in range(1,n-1):
buf=[p[i-1],p[i],p[i+1]]
if sorted(buf).index(p[i]) == 1:
result+=1
print(result)
|
p03705 | s620547238 | Wrong Answer | N, A, B=map(int, input().split())
if N==1:
if A==B:
print(A)
else:
print(0)
else:
if A>B:
print(0)
else:
n=N-2
ans=n*B-n*A+1
print(ans) |
p03161 | s791157853 | Accepted | def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
N, K = MAP()
h = LIST()
INF = 10**23
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
for j in range(1, K+1):
if i - j < 0:
continue
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print(dp[-1]) |
p02814 | s426910043 | Wrong Answer | from fractions import gcd
from functools import reduce
def lcm(x,y):
return (x*y)//gcd(x,y)
def lcm_list(nums):
return reduce(lcm,nums,1)
n,m=map(int,input().split())
A=list(map(int,input().split()))
A=[i//2 for i in A]
ans=lcm_list(A)
print((m-ans)//(ans*2)+1) |
p03773 | s607158847 | Wrong Answer | A, B = map(int, input().split())
print(A + B if A + B <= 24 else A + B - 24) |
p03723 | s460211923 | Accepted | nums = map(int, input().split())
nums = sorted(nums)
A, B, C = nums
if A == B and B == C and A % 2 == 0:
print(-1)
exit()
count = 0
while True:
if A % 2 != 0 or B % 2 != 0 or C % 2 != 0:
print(count)
exit()
nA = (B + C) // 2
nB = (A + C) // 2
nC = (A + B) // 2
count += 1
A, B, C = nA, nB, nC |
p02682 | s921187855 | Wrong Answer | a, b, c, k = map(int, input().split())
s = 0
if a + b >= k:
s = a
elif a < k:
s = a - k
else:
s = a - (c - b)
print(s) |
p03448 | s643646213 | Wrong Answer | A = int(input())
B = int(input())
C = int(input())
X = int(input())
count = 0
a = 0
b = 0
for i in range(min(C, int(X/500)) + 1):
a = X - 500 * i
for j in range(min(B, int(a/100)) + 1):
b = a - 100 * j
if int(b/50) <= C:
count += 1
print(count)
|
p02786 | s045856188 | Wrong Answer | HP = int(input())
if HP == 1:
print("1")
else:
#print(bin(HP))
print(pow(2,len(bin(HP))-3)) |
p03127 | s363546380 | Accepted | from heapq import heapify, heappop, heappush
N = int(input())
Alist = list(map(int, input().split()))
heapify(Alist)
while len(Alist) > 1:
atk = heappop(Alist)
Alist = [A % atk for A in Alist if (A % atk != 0)]
heapify(Alist)
heappush(Alist, atk)
print(Alist[0])
|
p03339 | s367021858 | Accepted | n = int(input())
s = list(input())
lft = [0]
rgt = [0]
cnt = 0
for i in range(1,n):
if s[i-1] == "W":
cnt += 1
lft.append(cnt)
cnt = 0
for i in range(1,n):
if s[(i)*(-1)] == "E":
cnt += 1
rgt.append(cnt)
ans = 10**9
for i in range(n):
ans = min(ans,lft[i]+rgt[(i+1)*(-1)])
print(ans) |
p03998 | s462337324 | Accepted | s={c:list(input()) for c in "abc"}
i="a"
while s[i]:
i = s[i].pop(0)
print(i.upper()) |
p02882 | s229438944 | Accepted | import math
a,b,x=map(int,input().split())
if 2*x>=a*a*b:
y=a*a*b-x
bb=(2*y)/(a*a)
ans=math.degrees(math.atan(bb/a))
else:
bb=2*x/(a*b)
ans=math.degrees(math.atan(b/bb))
print(ans)
|
p03331 | s837269465 | Wrong Answer | # AGC 025 A - Digits Sum
N = int(input())
def sum_of(num): #ๅไฝใฎๅ่จๅคใ่ฟใ
list_b = []
k = 0
while num > 0:
list_b.append(num % 10)
num = num // 10
for i in range(len(list_b)):
k += list_b[i]
return k
list_a =[]
for i in range(N//2+1):
A = i
B = N - i
list_a.append(sum_of(A) + sum_of(B))
print(str(min(list_a))) |
p03456 | s203171068 | Wrong Answer | import sys
a, b = map(str, input().split())
ab = int(a + b)
for i in range(1, 101):
if i**2 == ab:
print("Yes")
sys.exit()
print("No") |
p02596 | s665868793 | Accepted | k, R, a = int(input()), 7, -1
for i in range(1, k+1):
if not R%k:
a = i
break
R = (R * 10 + 7) % k
print(a) |
p03679 | s868844719 | Wrong Answer | X, A, B = map(int, input().split())
if B <= A:
print("delicious")
elif B <= A + X:
print("safe")
else:
print("dengerous") |
p03719 | s970905958 | Wrong Answer | integer1, integer2, integer3 = map(int, input().split())
if integer1 <= integer3 <= integer2:
print('YES')
else:
print('NO') |
p02595 | s477658892 | Accepted | n,m=map(int,input().split())
k=0
for i in range(n):
p,q=map(int,input().split())
p1=abs(p**2)
q1=abs(q**2)
q2=q1+p1
if q2<=m**2:
k+=1
print(k) |
p02657 | s186108950 | Wrong Answer | # 169
# ๅ
ฅๅใๅใๅใใใจ
a, b = map(int, input().split())
print(a)
print(b)
# ๅใๅใฃใ็ตๆใไฝฟใฃใฆ่จ็ฎใใ
answer = a * b
# ๅบๅใใใใจ
print(answer)
|
p03962 | s712109799 | Accepted | a=[int(i) for i in input().split()]
b=[]
for i in a:
if i not in b:
b.append(i)
print(len(b)) |
p03623 | s152951959 | Accepted | x, a, b = map(int, input().split())
if abs(x-a) > abs(x-b):
print('B')
else:
print('A')
|
p02785 | s651991240 | Accepted | N, K = map(int,input().split())
H = list(map(int, input().split()))
if(K >= N):
print(0)
else:
Hs = sorted(H)
if(K != 0):
print(sum(Hs[0:-K]))
else:
print(sum(Hs)) |
p03377 | s235699141 | Accepted | a,b,x =map(int,input().split())
s = x-a
if 0<=s and s<=b:
print("YES")
else:
print("NO") |
p03469 | s176261300 | Accepted | s= input()
res = "2018"+s[4:len(s)]
print(res) |
p03448 | s079825145 | Wrong Answer | A,B,C,X=[int(input()) for i in range(4)]
cnt = 0
for a in range(1,A+1):
Y = X - 500*a
for b in range(1,B+1):
Z = Y - 100*b
for c in range(1,C+1):
W = Z - 50*c
if W == 0:
cnt += 1
print(cnt) |
p02951 | s657192995 | Accepted | a, b, c = map(int, input().split())
ans = max(0, c - (a - b))
print(ans)
|
p02859 | s870761789 | Accepted | a = int(input())
print(a * a) |
p02760 | s096158445 | Accepted | A = []
A += map(int, input().split())
A += map(int, input().split())
A += map(int, input().split())
N = int(input())
for _ in range(N):
b = int(input())
try:
A[A.index(b)] = 0
except ValueError:
pass
res = (
(A[0]+A[1]+A[2])*(A[3]+A[4]+A[5])*(A[6]+A[7]+A[8])*
(A[0]+A[3]+A[6])*(A[1]+A[4]+A[7])*(A[2]+A[5]+A[8])*
(A[0]+A[4]+A[8])*(A[2]+A[4]+A[6])
)
print("Yes" if res == 0 else "No")
|
p03210 | s372575459 | Wrong Answer | X=input()
if X== 3 or 5 or 7:
print("YES")
else:
print("NO") |
p02582 | s447925938 | Accepted | # a,b = map(int, input().split())
s = input()
c = s.count("R")
if c == 1:
print(c)
elif c == 2:
if s[0] == s[1]:
print(c)
elif s[1] == s[2]:
print(c)
else:
print(1)
elif c == 3:
print(3)
elif c == 0:
print(0) |
p03817 | s771361530 | Wrong Answer | x = int(input())
n_11 = x // 11
x_tmp = x % 11
if x_tmp >= 6:
ans = 2 * n_11 + 2
else:
ans = 2 * n_11 + 1
print(ans) |
p02951 | s842187263 | Accepted | a, b, c = map(int, input().split())
print(max(0, c - (a-b))) |
p03035 | s429129842 | Wrong Answer | A,B = map(int, input().split())
if A >= 13:
print(B)
elif A <= 5:
print(0)
else:
print(B/2) |
p02970 | s356988559 | Accepted | import math
n, d = map(int, input().split())
tree = n/(2 * d + 1)
print(math.ceil(tree)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.