problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03206 | s584797121 | Accepted | D = int(input())
print("Christmas" + " Eve" * (25 - D)) |
p02743 | s646539409 | Wrong Answer | import math
a, b, c = map(int, input().split())
sa = a ** 0.5
sb = b ** 0.5
sc = c ** 0.5
if sa + sb < sc:
print("Yes")
else:
print("No") |
p03860 | s236822217 | Wrong Answer | print("AtCoder "+input()[0]+" Contest") |
p02606 | s582996285 | Accepted | l,r,d = map(int,input().split())
cnt=0
for i in range(l,r+1):
if i % d == 0:
cnt += 1
print(cnt) |
p02753 | s494120036 | Accepted | s = input()
if len(set(s)) == 1:
print('No')
else:
print('Yes') |
p02959 | s092552341 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[26]:
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# In[28]:
ans = 0
for i in range(N):
ans += min(A[i], B[i])
B[i] = max(B[i]-A[i], 0)
ans += min(A[i+1], B[i])
A[i+1] = max(A[i+1]-B[i], 0)
print(ans)
# In[ ]:
|
p02842 | s565554724 | Wrong Answer | N = int(input())
X = N / 1.08
behind_point = X - int(X)
cond = behind_point == 0.0 or behind_point >= 0.5
if behind_point == 0.0:
ans = int(X)
elif behind_point >= 0.5:
ans = int(X) + 1
else:
ans = ':('
print(ans) |
p03494 | s136934123 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for _ in range(31623):
if all(i % 2 == 0 for i in a):
cnt += 1
a = [i//2 for i in a]
print(cnt)
|
p03814 | s291508770 | Accepted | S = input()
a = []
z = []
for i, s in enumerate(S):
if s == 'A':
a.append(i + 1)
elif s == 'Z':
z.append(i + 1)
print(max(z) - min(a) + 1) |
p02659 | s998721007 | Wrong Answer | a, b = map(float, input().split())
a = int(a)
b1 = int(b * 100)
print(int((a*b1)//100))
|
p02793 | s280889889 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
mod=10**9+7
import fractions
a=l[0]
for i in range(1,n):
l[i]%=mod
a=(a*l[i]//(fractions.gcd(a,l[i])))
print(a)
list=[(a//l[i])%mod for i in range(n)]
print(list)
print(sum(list)%mod) |
p02706 | s151667636 | Accepted | N, M = map(int, input().split())
A = sum(map(int, input().split()))
print(N - A) if N - A >= 0 else print(-1) |
p02982 | s501541259 | Accepted | N,D = map(int,input().split())
X = []
for i in range(N):
X.append(list(map(int,input().split())))
ans = 0
for i in range(N):
for j in range(i+1,N):
d = 0
for k in range(D):
d += (X[i][k] - X[j][k])**2
d = d**(1/2)
if int(d) == d:
ans +=1
print(ans) |
p02717 | s240503163 | Accepted | x,y,z=map(int,input().split())#整数を複数の変数に格納
print(z,x,y) |
p02831 | s921198433 | Wrong Answer | import sys
import math
A,B=map(int,input().split())
if A<B:
A,B=B,A
if A%B==0:
print(B)
sys.exit()
L=[]
for i in range(1,math.ceil(A/2)):
if A%i==0 and B%i==0:
L.append(i)
print(int((A*B)/L[-1])) |
p02995 | s639238758 | Wrong Answer | import math
A,B,C,D=map(int,input().split())
E=C*D/math.gcd(C,D)
c=B//C-(A-1)//C
d=B//D-(A-1)//D
e=B//E-(A-1)//E
print(int(B-A+1-c-d+e)) |
p02708 | s032953233 | Wrong Answer | NK = list(map(int, input().split()))
N = NK[0]
K = NK[1]
ans=0
for k in range(K,N+2):
MIN = (k-1)*k/2
MAX = N*(N+1)/2 - (N-k)*(N-k+1)/2
ans += (MAX-MIN+1)
print(int(ans)) |
p02888 | s975706913 | Accepted | import sys
from bisect import bisect_left
N=int(input())
L=list(map(int,input().split()))
L.sort()
total = 0
for i in range(N):
for j in range(i + 1, N):
a = L[i] + L[j]
total += max(bisect_left(L, a) - j - 1, 0)
print(total) |
p04005 | s975636323 | Accepted | a,b,c = map(int,input().split())
if a%2==0 or b%2 == 0 or c%2 == 0:
print(0)
exit()
dum_li = [a,b,c]
dum_li.sort()
print(dum_li[0]*dum_li[1]) |
p04033 | s017547988 | Accepted | a,b = map(int, input().split())
if a> 0:
print("Positive")
elif b< 0 :
if (b-a) % 2 == 0:
print("Negative")
else :
print("Positive")
else :
print("Zero") |
p02658 | s444610463 | Wrong Answer | import numpy as np
n = input()
a = list(map(int, input().split()))
suma = np.prod(a)
if suma > 10**18:
print(-1)
else:
print(suma) |
p02584 | s372978198 | Accepted | X, K, D = map(int, input().split())
A= abs(X)%D
B = abs(X)//D
if abs(X) - K*D > 0:
print(abs(X)-K*D)
elif K%2 != B%2:
print(min(abs(A+D),abs(A-D)))
else:
print(A) |
p02953 | s573163349 | Wrong Answer | n = int(input())
h =list(map(int, input().split()))
for i in range(n-1):
if h[i] > h[i+1] and h[i]-1 <= h[i+1]:
h[i] -= 1
elif h[i]-1 > h[i+1]:
print("No")
exit()
for i in range(n-1):
if h[i] > h[i+1]:
print("No")
exit()
print("Yes") |
p04005 | s203061950 | Wrong Answer | BOX = [int(j) for j in input().split(' ')]
BOX.sort(reverse=True)
print(int(((BOX[0] / 2 + BOX[0] % 2) * BOX[1] * BOX[2]) - (BOX[0] / 2 * BOX[1] * BOX[2])))
|
p03799 | s468387994 | Accepted | n,m = map(int,input().split())
ans = 0
x = min(n,m//2)
n -= x
m -= x*2
ans += x
print(ans+m//4) |
p02556 | s919225662 | Wrong Answer | n=int(input())
XY=[list(map(int,input().split())) for i in range(n)]
minxy = [XY[0][0],XY[0][1]]
maxxy = [XY[0][0],XY[0][1]]
for xy in XY:
if xy[0]+xy[1] < sum(minxy):
minxy = xy[0],xy[1]
if xy[0]+xy[1] > sum(maxxy):
maxxy = xy[0],xy[1]
print(abs(minxy[0]-maxxy[0])+abs(minxy[0]-maxxy[1])) |
p02682 | s359148889 | Accepted | A,B,C,D=list(map(int,input().split()))
ans = 0
if D-A>0:
ans+=A
D-=A
else:
print(D)
exit()
if D-B>0:
D-=B
else:
print(ans)
exit()
print(ans-D) |
p04043 | s585131399 | Wrong Answer | val1=list(map(int,input().split()))
if sum(val1)==17:
print("OK")
else:
print("NO") |
p03162 | s222888928 | Wrong Answer | N=int(input())
L = [list(map(int, input().split())) for i in range(N)]
dp=[[0 for j in range(3)] for i in range(N)]
for i in range(N):
for P in range(3):
for PY in range(3):
if P==PY:
continue
elif i==0:
dp[i][P]=L[i][P]
else:
dp[i][P]=max(dp[i][P],dp[i-1][PY]+L[i-1][P])
ans=0
for i in range(3):
ans=max(ans,dp[N-1][i])
print(ans) |
p02663 | s600554809 | Wrong Answer | H1, M1, H2, M2, K = map(int, input().split())
print((H2 * 60) + M2 - (H1 * 60) + M1 - K) |
p03854 | s667950796 | Accepted | s=input()
# dream dreamer erase eraser
while len(s)>0:
if (s[-1]=="r") & (s[-7:]=="dreamer"):
s=s[:-7]
elif (s[-1]=="r") & (s[-6:]=="eraser"):
s=s[:-6]
elif (s[-1]=="e") & (s[-5:]=="erase"):
s=s[:-5]
elif (s[-1]=="m") & (s[-5:]=="dream"):
s=s[:-5]
else:
break
if len(s)==0:
print("YES")
else:
print("NO")
|
p02578 | s560815092 | Accepted | n = int(input())
a = list(map(int, input().split()))
total = 0
for i in range(1, n):
if a[i-1] > a[i]:
total += a[i-1] - a[i]
a[i] = a[i-1]
print(total) |
p03485 | s415165373 | Accepted | import math
a,b=map(int,input().split(" "))
print(math.ceil((a+b)/2)) |
p03659 | s340389420 | Wrong Answer | def resolve():
n = int(input())
a = list(map(int, input().split()))
m = sum(a)
cnt = 0
ans = float('inf')
for i in range(len(a) - 1):
cnt = abs(cnt + a[i])
ans = min(ans, abs(m - cnt*2))
print(ans)
resolve() |
p02888 | s954751093 | Wrong Answer | #<D>
#n<2*10**3だとforまわしたら間に合わん
from itertools import combinations
n = int(input())
l = list(map(int,input().split()))
l = list(set(l))
ans = 0
if len(l) < 3:
print(0)
exit()
for i in combinations(l,3):
if abs(i[1] - i[2]) < i[0] and i[1] + i[2] > i[0]:
ans += 1
print(ans)
|
p02665 | s626081579 | Accepted | N = int(input())
A = list(map(int, input().split()))
def pow2(a):
return 1<<min(a, 63)
ans = 0
Cap = []
c = 1
for d, a in enumerate(A):
Cap.append(c)
c -= a
if c < 0:
print(-1)
exit()
c *= 2
if c >= 1<<63:
c = 1<<63
siz = 0
#print(Cap)
for d, a, cap in zip(range(N, -1, -1), A[::-1], Cap[::-1]):
#print(d, a, cap)
siz = min(siz+a, cap)
ans += siz
#print(siz)
print(ans)
|
p03624 | s853253112 | Wrong Answer | str = input()
list = list(str)
abc = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
i = 0
while abc[i] in str:
if i < 25:
i += 1
else:
break
if i < 26:
print(abc[i])
else:
print("None")
|
p03360 | s786082135 | Accepted | A=input().split()
A = [int(s) for s in A]
K=int(input())
A.sort()
print(A[2]*2**K+A[0]+A[1]) |
p03774 | s757376485 | Accepted | n, m = map(int, input().split())
T1 = [list(map(int, input().split())) for i in range(n)]
T2 = [list(map(int, input().split())) for i in range(m)]
for i in range(n):
ans = 0
man = 10 ** 9
for j in range(m):
tmp = abs(T1[i][0] - T2[j][0]) + abs(T1[i][1] - T2[j][1])
if man > tmp:
man = tmp
ans = j + 1
print(ans) |
p02911 | s877062869 | Accepted | N,K,Q = map(int,input().split())
# ans_list = [list(map(int,input().split())) for i in range(Q)]
ans_list = []
for i in range(Q):
a = int(input())
ans_list.append(a)
point_list = [K -Q]*N #[i*0 for i in range(N)]
for i in range(Q):
tem = ans_list[i] - 1
point_list[tem] += 1
for i in range(N):
if point_list[i] >0:
print("Yes")
else:
print("No") |
p03161 | s720804955 | Wrong Answer | N,K = [int(_n) for _n in input().split()]
h = [int(_n) for _n in input().split()]
dp = [0]*N
dp[1] = abs(h[1]-h[0])
for i in range(1,N):
dp[i] = 1000000
for j in range(max(i-K,0), i):
dp[i] = min(dp[i], dp[j]+abs(h[j]-h[i]))
print(dp[N-1])
|
p02712 | s235672501 | Accepted | n =int(input())
ans = 0
for i in range(n+1):
if i % 15 != 0 and i % 3 != 0 and i % 5 !=0:
ans += i
print(ans) |
p02603 | s615765620 | Wrong Answer | n = int(input())
list_A = list(map(int, input().split()))
list_N = [0]
money = 1000
for i in range(1, n):
if list_A[i-1] < list_A[i]:
list_N.append(1)
else:
list_N.append(0)
k = 0
while True:
if k == n-1:
break
k += 1
if list_N[k-1] == 0 and list_N[k] == 1:
l = k-1
roll = money // list_A[l]
money = money % list_A[l]
money += list_A[k]*roll
print(money) |
p03730 | s947328424 | Wrong Answer |
a,b,c = map(int,input().split())
l = []
if a % 2 == 0:
print("NO")
else:
for i in range(1,b+1):
l.append((a * i) % b)
# print(l)
if l.count(c) != 0:
print("YES")
else:
print("NO")
|
p03281 | s526959294 | Wrong Answer | n=int(input())
if n<105:
print(0)
elif 105<=n and n<135:
print(1)
elif 135<=n and n<189:
print(2)
elif 165<=n and n<189:
print(3)
elif 189<=n and n<195:
print(4)
else:
print(5)
|
p03548 | s438822128 | Accepted | X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z)) |
p02642 | s400485715 | Accepted | N=int(input())
A=list(map(int,input().split()))
D=set()
S=set()
for i in range(N):
if A[i] in S:
D.add(A[i])
else:
S.add(A[i])
M=max(S)
X=[1 for i in range(M+1)]
for a in S:
if a in D:
X[a]=0
for i in range(2*a,M+1,a):
X[i]=0
ans=0
for i in range(N):
if X[A[i]]==1:
ans+=1
print(ans) |
p03795 | s695997242 | Wrong Answer | N = int(input())
x = 800 * N
y = 0
for i in range(N):
if i % 15 == 0:
y += 200
print (x - y) |
p03211 | s519273662 | Accepted | import math
s=input()
ans=1000000000
for i in range(len(s)-2):
ans=min(ans,abs(int(s[i]+s[i+1]+s[i+2])-753))
print(ans)
|
p02777 | s644512707 | Accepted | s, t = map(str, input().split())
a, b = map(int, input().split())
u = str(input())
if u == s:
a -= 1
if u == t:
b -= 1
print(a,b) |
p03494 | s591659860 | Accepted | N = int(input())
A = list(map(int, input().split()))
count = 0
while all(a%2 == 0 for a in A):
A = [a/2 for a in A ]
count += 1
print(count)
|
p03799 | s855967938 | Accepted | s,c = map(int, input().split())
if s*2 >= c:
print(c//2)
else:
ans = s
rem = c-s*2
ans += rem//4
print(ans) |
p03672 | s183625050 | Wrong Answer | s = input()
D = {}
for c in s:
if c in D.keys():
D[c] += 1
else:
D[c] = 1
for i in range(1,len(s)+1):
D[s[len(s)-i]] -= 1
for k in D.values():
if k % 1:
break
else:
ans = len(s)-i
break
print(ans) |
p02972 | s578352819 | Accepted | import sys
sys.setrecursionlimit(10000000)
input=sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
b=[0]*n
for i in range(n-1,-1,-1):
if sum(b[i:n:i+1]) %2 ^ a[i]:
b[i] = 1
print(sum(b))
print(" ".join([str(k+1) for k,v in enumerate(b) if v== 1])) |
p03037 | s609734010 | Accepted | N, M = map(int, input().split())
L = list()
R = list()
for i in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
num = 0
for j in range(maxL,minR+1):
num +=1
print(num) |
p02661 | s102274714 | Accepted | n=int(input())
m=[];M=[]
for i in range(n):
a,s=map(int,input().split())
m.append(a);M.append(s)
m.sort();M.sort()
if n%2:
print(M[n//2]-m[n//2]+1)
else:
print(M[n//2]+M[n//2-1]-m[n//2]-m[n//2-1]+1) |
p02615 | s124986314 | Accepted | N = int(input())
A = sorted(map(int, input().split()), reverse=True)
if N % 2:
print(sum(A[: N // 2]) + sum(A[1 : N // 2 + 1]))
else:
print(sum(A[: N // 2 - 1]) + sum(A[1 : N // 2]) + A[N // 2 - 1])
|
p03417 | s003234481 | Accepted | N,M = map(int,input().split())
"""
mat = [[0]*M for _ in range(N)]
dx = [-1,0,1,-1,0,1,-1,0,1]
dy = [1,1,1,0,0,0,-1,-1,-1]
for i in range(N):
for j in range(M):
for k in range(9):
if 0 <= i+dy[k] <= (N-1) and 0 <= j+dx[k] <= (M-1):
mat[i+dy[k]][j+dx[k]] += 1
print(mat)
"""
if N == M == 1:
print(1)
elif N == 1 or M == 1:
print(N*M-2)
else:
print(N*M-2*(N+M-2)) |
p03721 | s925046517 | Accepted | N,K = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(N)]
ab.sort()
count = 0
for i in range(N):
count+=ab[i][1]
if count >= K:
print(ab[i][0])
exit() |
p03105 | s985608471 | Accepted | a,b,c = map(int, input().split())
if b >= a*c:
print(c)
elif b < a*c:
print(b//a) |
p03779 | s165088488 | Wrong Answer | x = int(input())
index = 0
for i in range(1,x+1):
if i*(i+1) < (x-index):
index+=i
else:
ans = x-index
break
# print(i,index)
print(ans) |
p02628 | s913264427 | Wrong Answer | n,k = map(int, input().split())
l = list(map(int, input().split()))
l1 = sorted(l, reverse= False)
sum = sum(l1[0:3])
print(sum) |
p03633 | s871905026 | Accepted | import math
n=int(input())
ans=1
for i in range(n):
a=int(input())
ans=a*ans//math.gcd(a,ans)
print(ans) |
p02641 | s335712568 | Wrong Answer | import collections
X, N = map(int, input().split())
list = list(map(int, input().split()))
c = collections.Counter(list)
res1=-1000
res2=-1000
for i in range (0, 100):
if(c[X+i]==0):
res1=X+i
if(c[X-i]==0):
res2=X-i
break
if(abs(X-res1)<abs(X-res2)):
print(res1)
else:
print(res2) |
p03672 | s389564985 | Wrong Answer | s = input()
n = len(s)
for i in range(1,n):
ss = s[:-i]
if len(ss)% 2 ==0:
if ss[:(n-i)//2] == ss[(n-i)//2:]:
print(len(ss)) |
p03075 | s280427789 | Wrong Answer | l=[]
for i in range(5):l.append(int(input()))
k=int(input())
c=0
for i in l:
for j in l:
if abs(i-j)>k: c+=1
print('yay!' if c==0 else ':(') |
p02624 | s698971265 | Accepted | import sys
import numba as nb
input = sys.stdin.readline
@nb.njit("i8(i8)")
def solve(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
ans = 0
for i, v in enumerate(table):
ans += i * v
return ans
def main():
N = int(input())
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
|
p02684 | s773177242 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
l = [1]
for i in range(n):
l.append(a[l[i] - 1])
p = l.index(l[n])
if k <= n:
print(l[k])
else:
x = (k - n + 1) % (n - p)
if x == 0:
print(l[n - 1])
else:
print(l[x + p - 1]) |
p02681 | s255177480 | Wrong Answer | S = input()
T = input()
if S in T:
print('Yes')
else:
print('No')
|
p03317 | s806972575 | Wrong Answer | N, K = map(int,input().split())
list_ai = map(int,input().split())
print(((N-1)//(K-1))+1)
|
p02790 | s013692769 | Wrong Answer | a, b = input().split()
an, bn = int(a), int(b)
ab = a * bn
ba = b * an
if ab >= ba:
print(ab)
else:
print(ba)
|
p03163 | s516294871 | Accepted | n, w = map(int, input().split())
wv = [list(map(int, input().split())) for _ in range(n)]
dp = [[0]*(w+1) for _ in range(n)]
for i in range(n):
for j in range(w+1):
if j >= wv[i][0]:
dp[i][j] = max(dp[i-1][j], wv[i][1] + dp[i-1][j-wv[i][0]])
else:
dp[i][j] = dp[i-1][j]
print(dp[-1][-1]) |
p03136 | s804608762 | Accepted | n=int(input())
L=list(map(int,input().split()))
if max(L)<(sum(L)-max(L)) :
ans ="Yes"
else:
ans ="No"
print(ans)
|
p02789 | s290583168 | Wrong Answer | H, A=map(int,input().split())
cnt =0
while H > 0:
H -= A
cnt += 1
print(cnt) |
p02606 | s991387770 | Wrong Answer | import math
L, R, D = map(int, input().split())
if math.floor(R / D) - math.ceil(L / D) + 1 > 0:
print(math.floor(R / D) - math.floor(L / D))
else:
if R % D == 0 or L % D == 0:
print(1)
else:
print(0) |
p02665 | s739514701 | Accepted | from itertools import accumulate
N = int(input())
As = list(map(int, input().split()))
accR = reversed(list(accumulate(reversed(As))))
num = 1
MAX = 10 ** 13
ans = 0
for a, limit in zip(As, accR):
tmp = min(num, limit)
if a > tmp:
print(-1)
exit()
ans += tmp
num = (tmp - a) * 2
if num >= MAX:
num = MAX
print(ans)
|
p02675 | s281364331 | Accepted | n = int(input())
n = n % 10
if n in [2,4,5,7,9]:
print("hon")
elif n in [0,1,6,8]:
print("pon")
else:
print("bon") |
p02756 | s301226248 | Accepted | s=input()
q=int(input())
que=[list(map(str,input().split())) for i in range(q)]
count=0
for i in que:
if i[0]=="1":
count+=1
ans=[[],[]]
ak=count
for i in que:
if i[0]=="1":
count-=1
else:
if i[1]=="1":
ans[count%2].append(i[2])
else:
ans[(count+1)%2].append(i[2])
if ak%2==0:
print("".join(reversed(ans[0]))+s+"".join(ans[1]))
else:
print("".join(reversed(ans[0]))+"".join(reversed(list(s)))+"".join(ans[1])) |
p02583 | s432140475 | Wrong Answer | N=int(input())
import itertools
A = list(map(int, input().split()))
count=0
if N<=2:
print(0)
else:
for ｔ in itertools.combinations(A, 3):
if t[2]<t[0]+t[1] and t[1]<t[0]+t[2] and t[0]<t[1]+t[2] and t[0]!=t[1]!=t[2]!=t[0]:
print(t)
count+=1
print(count) |
p03013 | s311186608 | Wrong Answer | n,m = map(int, input().split())
a = [int(input()) for _ in range(m)]
large = 10**9 +7
count = [0]*(n+1)
itr = 0
count[0] = 1
if m >0 and a[0] != 1 :
count[1] = 1
else:
count[1] = 0
itr = 1
if n >=2:
for i in range(2,n+1):
if m > 0 and itr<len(a) and a[itr] == i:
itr +=1
continue
else:
count[i] = (count[i-1] + count[i-2])%large
print(count[n])
|
p02833 | s190316546 | Wrong Answer | N = int(input())
if N % 2 == 1:
print(0) |
p03632 | s706053486 | Accepted | a,b,c,d = map(int,input().split())
if b <= c or d <= a:
print(0)
elif a <= c:
if b <= d:
print(b - c)
else:
print(d - c)
else:
if b <= d:
print(b - a)
else:
print(d - a) |
p03623 | s103092475 | Accepted | x,a,b = map(int, input().split())
print("A") if abs(x-a) < abs(x-b) else print("B") |
p03804 | s578175817 | Accepted | n, m = map(int, input().split())
A = []
B = []
for i in range(n):
A.append(input())
for i in range(m):
B.append(input())
ok = 0
for i in range(n - m + 1):
for j in range(n - m + 1):
from_n = [l[j:j+m] for l in A[i:i+m]]
ok += from_n == B
print('Yes' if ok > 0 else 'No') |
p03386 | s846389286 | Accepted | a,b,k = map(int,(input().split()))
ans = []
for i in range(a,min(a+k,b)):
ans.append(i)
for i in range(max(b+1-k,a),b+1):
ans.append(i)
ans = list(set(ans))
ans.sort()
for i in ans:
print(i) |
p04020 | s788807196 | Accepted | n = int(input())
total = 0
remain = 0
c = 0
for i in range(n):
m = int(input())
if i > c + 1:
remain = 0
all_ = remain + m
total += all_//2
if all_ % 2 != 0 and all_//2 > 0:
remain = all_ % 2
c = i
print(total) |
p02664 | s285505327 | Accepted | T=input()
res = ""
for i in range(len(T)) :
if (T[i] != "?") :
res += T[i]
continue
res += "D"
# if (i != 0) :
# if (T[i-1] == "P") :
# res += "D"
# else :
# res += "D"
print(res)
|
p02911 | s884734589 | Wrong Answer | N, K, Q = map(int, input().split())
A = [int(input())-1 for _ in range(Q)]
Point = [K]*N
print(A)
for i in range(Q):
Point[A[i]] += 1
for j in range(N):
Point[j] -= 1
for p in Point:
if p>0:
print('Yes')
else:
print('No') |
p03379 | s739507249 | Accepted | n = int(input())
x = [int(t) for t in input().split()]
d = sorted(x)
m1 = d[n//2-1]
m2 = d[n//2]
for i in range(n):
if m1 < x[i]:
print(m1)
else:
print(m2)
|
p03150 | s949152848 | Accepted | S = input()
for i in range(len(S)):
for j in range(i,len(S)+1):
if S[:i]+S[j:] == "keyence":
print("YES")
exit()
for k in range(len(S)):
if S[i::i+8] == "keyence":
print("YES")
exit()
print("NO") |
p02768 | s276677531 | Accepted | n, a, b = map(int, input().split())
mod = 10**9 + 7
def comb(n, r, mod) :
ans1 = 1
ans2 = 1
for i in range(r) :
ans1 = (ans1 * (n-i)) % mod
ans2 = (ans2 * (i+1)) % mod
return ans1 * pow(ans2, mod-2, mod)
ans = pow(2, n, mod) - comb(n, a, mod) - comb(n, b, mod) - 1
print(ans%mod) |
p02786 | s285281530 | Accepted | resd = {}
def A(h):
if h == 1:
return 1
else:
if h in resd:
return resd[h]
else:
resd[int(h/2)] = A(int(h/2))*2+1
return resd[int(h/2)]
H = int(input().strip())
print(A(H)) |
p02613 | s047422443 | Wrong Answer | N = int(input())
C = 0
D = 0
E = 0
F = 0
S = ''
for i in range(N):
S = input()
if S == 'AC':
C += 1
elif S == 'WA':
D += 1
elif S == 'TLE':
E += 1
elif S == 'RE':
F += 1
print('AC × '+ str(C))
print('WA × '+ str(D))
print('TLE × '+ str(E))
print('RE × '+ str(F))
|
p02789 | s645799938 | Accepted | N,M=map(int,input().split())
if (N==M):
print('Yes')
else:
print('No') |
p02697 | s463946735 | Accepted | N, M = map(int, input().split())
# 左パート
l, r = 1, N // 2
while M and l < r :
print(l, r)
l += 1
r -= 1
M -= 1
# 右パート
l, r = N // 2 + 2 - N % 2, N
while M :
print(l, r)
l += 1
r -= 1
M -= 1 |
p03469 | s537992771 | Wrong Answer | S = input()
print("2017" + S[4:]) |
p03208 | s153070613 | Accepted | N,K=map(int,input().split())
H=[int(input()) for _ in range(N)]
H.sort()
import numpy as np
H=np.array(H)
print((H[K-1:]-H[:-K+1]).min())
|
p03814 | s059304644 | Wrong Answer | s=input()
r_s=s[::-1]
a=0
b=0
n=len(s)
for i in range(n):
if s[i]=="A":
a=i
break
for j in range(n):
if r_s[j]=="Z":
z=j
break
print(len(s[a:-z])) |
p03779 | s814281553 | Accepted | import sys
X=int(input())
if not ( 1 <= X <= 10**9 ): sys.exit()
res=0
count=0
for I in range(1,X+1):
count += 1
res += count
if res >= X:
print(count)
sys.exit() |
p02842 | s554556529 | Wrong Answer | import math
N = int(input())
if math.ceil(N / 1.08) * 1.08 == N:
print(math.ceil(N / 1.08))
else:
print(':(') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.