problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03449 | s233093520 | Accepted | import numpy as np
n = int(input())
a1 = np.array(list(map(int, input().split())))
a2 = np.array(list(map(int, input().split())))
a1_cumsum = np.cumsum(a1)
a2_cumsum = np.cumsum(a2)
#print(a1)
#print(a1_cumsum)
#print(a2)
#print(a2_cumsum)
ans = 0
for i in range(n) :
sum = a1_cumsum[i] + a2_cumsum[n-1]
if ... |
p03145 | s335645852 | Accepted | a,b,_=sorted(map(int,input().split()))
print(a*b//2) |
p02628 | s338607747 | Accepted | (N,K)= map(int,input().split())
p = list(map(int,input().split()))
p.sort()
total = 0
for i in range(K):
total += p[i]
print(total) |
p03986 | s382520937 | Accepted | S = input()
s_cnt =0
t_cnt =0
for s in S:
if s == 'S':
s_cnt += 1
else:
if s_cnt >0:
s_cnt -= 1
else:
t_cnt += 1
print(t_cnt + s_cnt)
|
p02989 | s585757255 | Wrong Answer | import sys
input = sys.stdin.readline
N = int(input())
d = list(map(int, input().split()))
d.sort()
K = 0
for i in range(N):
if d[i] < N / 2:
K += 1
print(K) |
p03779 | s522626539 | Accepted | x=int(input())
ans=0
cnt=1
while 1:
ans+=1
x-=cnt
if x<=0:
print(ans)
exit()
else:
cnt+=1 |
p02772 | s745377289 | Accepted | n = int(input())
l = {int(i) for i in input().split() if int(i)%2 == 0}
cnt = 0
for i in l:
if (i%3 == 0) or (i%5 == 0):
pass
else:
cnt += 1
if cnt == 0:
print("APPROVED")
else:
print("DENIED") |
p03105 | s061125251 | Wrong Answer | A, B, C = map (int, input().split())
if A * C < B:
print(C)
elif A * C > B:
print(B // A)
|
p02958 | s001825719 | Wrong Answer | n=int(input())
c=list(range(1,n+1))
p=list(map(int,input().split()))
cnt=0
for i in range(n):
cnt += 1 if c[i]!=p[i] else 0
print('Yes' if cnt==2 or cnt==0 else 'No') |
p03910 | s050466061 | Accepted | n = int(input())
for i in range(1, n+1):
if n <= (i+1)*i//2:
x = (i+1)*i//2 - n
for j in range(1, i+1):
if j != x:
print(j)
exit() |
p02714 | s583497992 | Accepted | n = int(input())
s = input()
r = 0
g = 0
b = 0
for i in range(n):
if s[i] == "R":
r += 1
elif s[i] == "G":
g += 1
else:
b += 1
ans = r * g * b
for i in range(n):
for j in range(min(i, n - 1 - i)):
if s[i]!=s[i+j+1] and s[i]!=s[i-j-1] and s[i+j+1]!=s[i-j-1]:
... |
p02993 | s802438714 | Wrong Answer |
S=input()
for i in range(len(S)-1):
if S[i]==S[i+1]:
flag=1
else:
flag=0
if flag==0:
print("Good")
else:
print("Bad") |
p03286 | s650211357 | Wrong Answer | s=int(input())
s=0
x=s
list=[]
for i in range(1000000000000000000):
y=x%(-2)
if y == -1:
x = (x-1)//(-2)
y = 1
else:
x=x//(-2)
list.insert(0, y)
if x == 0:
print(*list, sep="")
break |
p02633 | s763006949 | Accepted | a = int(input())
for i in range(1,361):
if i * a % 360 == 0:
print(int(i))
break
|
p03293 | s136020575 | Accepted | def resolve():
s = input()
t = input()
s += s
if t in s:
print("Yes")
else:
print("No")
return
if __name__ == "__main__":
resolve()
|
p02723 | s312577492 | Accepted | s = input()
if s[2:3] == s[3:4] and s[4:5] == s[5:6]:
print("Yes")
else:
print("No") |
p02577 | s781246108 | Accepted | s = list(input())
a = 0
for i in s:
a += int(i)
if a%9==0:
print('Yes')
else:
print('No') |
p03478 | s357111678 | Wrong Answer | li = list(map(int, input().split()))
ans = 0
for i in range(li[0]):
i += 1
s = sum(list(map(int, str(i))))
if s >= li[1] and s <= li[2]: ans += s
print(ans) |
p03612 | s363645324 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
if a[i]==i+1:
a[i],a[i+1]=a[i+1],a[i]
ans+=1
print(ans) |
p03408 | s623425685 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N=int(input())
s=[input() f... |
p02640 | s703236133 | Accepted | x,y=list(map(int,input().split()))
import sys
for i in range(0,x+1):
if 2*i+4*(x-i)==y:
print("Yes")
sys.exit()
print("No")
|
p02838 | s234590280 | Wrong Answer | N = int(input())
A = [int(a) for a in input().split()]
mod = 10**9+7
SUM = 0
maxA = max(A)
d = 0
while 1:
if maxA < 2**d:
break
d += 1
BitA = [[0]*d for _ in range(N)]
for i in range(N):
for j in range(d):
BitA[i][j] = int(bin(A[i]|2**d)[3+j])
BitSumB = 0
for i in range(d):
tmp = sum(... |
p02882 | s547002058 | Accepted | import math
a, b, x = map(int, input().split())
if a*a*b==x:
print(0)
elif a*a*b<=2*x:
print(90-math.degrees(math.atan(a**3/(2*b*a*a-2*x))))
else:
print(90-math.degrees(math.atan(2*x/(a*b*b)))) |
p03478 | s724324746 | Accepted | n,a,b = map(int,input().split())
ans = 0
for i in range(n+1):
if a <= sum(list(map(int,list(str(i))))) <= b:
ans += i
print(ans)
|
p02547 | s211718590 | Accepted | N = int(input())
D = [list(map(int,input().split())) for x in range(N)]
flag = ""
for p in range(N):
if D[p][0] == D[p][1]:
flag += "1"
else:
flag += "0"
if "111" in flag:
print("Yes")
else:
print("No")
|
p02640 | s270690346 | Accepted | x,y = map(int, input().split())
i = 'Yes' if x * 2 <= y <= x * 4 and y % 2 == 0 else 'No'
print(i) |
p03274 | s049919576 | Wrong Answer | n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = 10 ** 8
for i in range(n-k+1):
if x[i] <= 0:
if x[i+k-1] > 0:
a = min(abs(x[i]), abs(x[i+k-1])) * 2 + max(abs(x[i]), abs(x[i+k-1]))
else:
a = abs(x[i])
else:
a = abs(x[i+k-1])
if ans ... |
p02923 | s172242976 | Accepted | N = int(input())
*H, = map(int, input().split())
ans = 0
l, r = 0, 1
while l < N:
v = H[l]
a = 0
while r < N:
if H[r]<=v:
a += 1
v = H[r]
r += 1
else:
l = r-1
r = l+2
break
ans = max(ans, a)
l+=1
print(ans) |
p02622 | s902556970 | Accepted | S = input()
T = input()
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count) |
p02695 | s541770054 | Accepted | import itertools
n,m,q = map(int, input().split())
a,b,c,d = [0]*q,[0]*q,[0]*q,[0]*q
for i in range(q):
a[i],b[i],c[i],d[i] = map(int, input().split())
ans = 0
for C in itertools.combinations_with_replacement(range(1,m+1),n):
x = 0
for i in range(q):
if C[b[i]-1] - C[a[i]-1] == c[i]:
... |
p03274 | s260754479 | Accepted | import bisect
n,k = map(int,input().split())
l = list(map(int,input().split()))
ans = 10**10
for i in range(n-k+1):
count = 0
left = l[i]
right = l[i+k-1]
if left <= 0 and right > 0:
count = min(abs(left),abs(right))*2+max(abs(left),abs(right))
elif right <= 0:
count = abs(left)
... |
p02767 | s835189986 | Accepted | N = int(input())
X = list(map(int, input().split()))
candidates = [sum(X) // N, sum(X) // N + 1]
ans = 0
a = 0
b = 0
for x in X:
a += (x - candidates[0]) ** 2
b += (x - candidates[1]) ** 2
if a < b:
print(a)
else:
print(b)
|
p03103 | s258480042 | Wrong Answer | n, m= map(int, input().split())
got=0
sell={}
buy=0
for i in range(n):
a,b=map(int,input().split())
if a not in sell:
sell[a]=0
sell[a]+=b
if n==1:
print(m*a)
exit()
sell=sorted(sell.items())
for lis in sell:
got+=lis[1]
if got>m:
buy+=(m-got+lis[1])*lis[0]
print(buy)
exit()
else:
bu... |
p02813 | s157278512 | Accepted | import itertools
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
data = []
for i in range(1, N+1):
data.append(i)
list_data = []
for val in itertools.permutations(data):
list_data.append(val)
list_data.sort()
a = 0
b = 0
i = 1
for val in list_data:
if val == P... |
p03986 | s053836279 | Accepted | k = 0
for i in input():
k += i=="S" or -(k>0)
print(k*2) |
p03351 | s819882796 | Accepted | a, b,c, d = list(map(int, input().split()))
if (abs(a-b)<=d) and (abs(b-c)<=d) or (abs(a-c)<=d):
print("Yes")
else:
print("No") |
p02645 | s737490663 | Wrong Answer | a = input()
print(a[:2]) |
p04030 | s098515190 | Wrong Answer | s = input()
txt = []
for c in s:
if c == 'B' and len(txt) > 0:
txt.pop()
else:
txt.append(c)
print(''.join(txt))
|
p03013 | s342771237 | Wrong Answer | n, m = map(int, input().split())
a = list(int(input()) for _ in range(m))
dp = [0] * (n+1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, n+1):
if i in a:
continue
dp[i] = dp[i-1] + dp[i - 2]
dp[i] %= 1000000007
print(dp)
|
p02714 | s079226525 | Accepted | N=int(input())
S=input()
R,G,B=0,0,0
ans=0
for i in range(N):
if S[i]=='R':
R+=1
elif S[i]=='G':
G+=1
else:
B+=1
ans+=R*G*B
f,s,t=0,1,2
while t<=N-1:
i=0
while i+t<=N-1:
if S[f+i]!=S[s+i] and S[f+i]!=S[t+i] and S[s+i]!=S[t+i]:
ans-=1
i+=1
s+=1
... |
p02916 | s851728243 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
if i == 0:
ans += b[a[i]-1]
else:
ans += b[a[i]-1]
if a[i]-a[i-1] == 1:
ans += c[a[i]-2]
print(ans) |
p02631 | s662502819 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = []
for i in range(N):
now = 0
for j in range(N):
if(i!=j):
now = now ^ A[j]
ans.append(now)
print(ans) |
p02767 | s309059586 | Accepted | n = int(input())
x = list(map(int, input().split(' ')))
p = int(round(sum(x) / n))
r = 0
for i in x:
r += (i - p) * (i - p)
print(r) |
p02765 | s165252564 | Accepted | N, R = map(int, input().split())
if N < 10:
print(R + 100*(10-N))
else:
print(R) |
p02778 | s195745304 | Accepted | s=input()
a=len(s)
s=[]
for n in range(0,a):
s.append("x")
s="".join(s)
print(s)
|
p02795 | s679841551 | Accepted | H,W,N=int(input()),int(input()),int(input())
print(-(-N//max(H,W))) |
p03012 | s049290028 | Wrong Answer | n=int(input())
w=list(map(int,input().split()))
a=[]
for i in range(0,n):
ans=(w[:i])
if 2*sum(ans)-sum(w)>=0:
a.append(2*sum(ans)-sum(w))
print(min(a)) |
p04033 | s336685421 | Accepted | x=input().split()
a=int(x[0])
b=int(x[1])
if a>0:
print('Positive')
else:
if b<0:
if (b-a)%2==0:
print('Negative')
else:
print('Positive')
else:
print('Zero') |
p03815 | s959709501 | Wrong Answer | import sys
input = sys.stdin.readline
x = int(input())
print(x * 2 // 11 + 1) |
p02923 | s527402924 | Accepted | n = int(input())
hn = [int(i) for i in input().split()]
max_cnt, cnt = 0, 0
for i in range(1, n):
if hn[i - 1] - hn[i] >= 0:
cnt += 1
else:
cnt = 0
if max_cnt < cnt:
max_cnt = cnt
print(max_cnt) |
p03136 | s173330787 | Accepted | n = int(input())
l = list(map(int, input().split()))
tot = sum(l)
flag = True
for l_i in l:
if 2 * l_i >= tot:
flag = False
break
if flag:
print('Yes')
else:
print('No') |
p03062 | s340824513 | Accepted | def solve(n, A):
if A.count(0) > 0:
return sum(map(abs, A))
total = 0
minval = 10 ** 9
count = 0
for a in A:
total += abs(a)
if a < 0:
count += 1
if abs(a) < minval:
minval = abs(a)
return total - (2 * minval if count % 2 == 1 else 0)
_n =... |
p02780 | s561564803 | Accepted | x,y = map(int,input().split())
li = list(map(int,input().split()))
from collections import deque
l = []
for i in range(len(li)):
l.append((1+ li[i])/2)
from itertools import accumulate
a = list(accumulate(l))
M = a[y-1]
for i in range(len(a)-y):
m = a[i+y] - a[i]
if m > M:
M = m
print(M) |
p03495 | s246537573 | Accepted | from collections import Counter
N,K = map(int,input().split())
A = list(map(int,input().split()))
C = Counter(A).most_common()
ans = 0
for i in range(len(C)):
if i >= K:
ans += C[i][1]
print(ans) |
p03073 | s146384745 | Accepted | S = list(input())
f = False
c = 0
for i in range(len(S) - 1):
# if i == len(S) - 2:
# break
if S[i] != S[i + 1]:
continue
else:
if S[i] == "0":
S[i+1] = "1"
c += 1
else:
S[i+1] = "0"
c += 1
print(c) |
p03076 | s992498785 | Wrong Answer | sum=0
minb=124
for i in range(5):
a=int(input())
sum += a//10*10 if a%10==0 else a//10*10+10
b=a%10
minb = min(minb,b) if b!=0 else minb
print(sum-10+minb)
|
p03377 | s219711235 | Wrong Answer | a,b,c=map(int,input().split())
print("YES" if c-a<=b else "NO") |
p02612 | s558596018 | Accepted | import numpy
N = int(input())
a = int(numpy.ceil(N / 1000) * 1000 - N)
print(a) |
p03131 | s837252950 | Wrong Answer | k, a, b = map(int, input().split())
if k == 1:
print(2)
elif k < a + 2 or b - a <= 2:
print(1 + k)
else:
cnt = (k - (a - 1)) // 2
mod = (k - (a - 1)) % 2
ans = (b - a)*cnt + a + mod
print(ans) |
p02778 | s429743792 | Accepted | s = input()
print('x'*len(s)) |
p03109 | s599604771 | Accepted | import datetime
date_str = "2019/04/30"
date_formatted = datetime.datetime.strptime(date_str, "%Y/%m/%d")
s = input()
s = datetime.datetime.strptime(s, "%Y/%m/%d")
if s <= date_formatted:
print('Heisei')
else:
print('TBD') |
p03633 | s378323234 | Wrong Answer | def gcd(a, b):
if a < b:
a, b = b, a
if b == 0:
return a
return gcd(b, a % b)
N = int(input())
T = [0] * N
for i in range(N):
T[i] = int(input())
ans = 1
for i in range(N-1):
ans *= (T[i] * T[i+1] // gcd(T[i], T[i+1]))
print(ans) |
p03774 | s400899573 | Accepted | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(n)]
cd=[list(map(int,input().split())) for i in range(m)]
def dist(list1,list2):
return abs(list1[0]-list2[0])+abs(list1[1]-list2[1])
for human in ab:
for i in range(m):
if i==0:
d=dist(human,cd[0])
index=1
else:
... |
p02772 | s494651015 | Accepted | N = int(input())
alist = list(map(int, input().split()))
flag = 0
for i in range(0,N):
if alist[i]%2 == 1:
continue
else:
if alist[i]%3 == 0 or alist[i]%5 == 0:
continue
else:
print("DENIED")
flag = 1
break
if flag == 0:
print("APPROVED... |
p02598 | s289417707 | Accepted | import copy
import math
n, k = map(int,input().split())
a = list(map(int,input().split()))
ub = 10**9
lb = 0
while ub - lb > 10**-6:
x = (ub + lb) / 2
cnt = 0
for i in a:
cnt += math.ceil(i/x)
if cnt <= n+k:
ub = copy.deepcopy(x)
else:
lb = copy.deepcopy(x)
ans = round(ub,... |
p02719 | s137104781 | Wrong Answer | n,k = map(int,input().split())
l = n%k
if k !=1 and l == 0:
if l >= abs(l-k):
print(abs(l-k))
else:
print(l)
else:
print(0) |
p02786 | s079677461 | Accepted | import math
H = int(input())
a = int(math.log(H,2))
print((2**(a+1))-1)
|
p02696 | s933798267 | Accepted | a,b,n = map(int,input().split())
if n%b==0:n-=1
x = max((n//b)*b-1,n%b)
print(((a*x)//b)-(a*(x//b))) |
p02912 | s703813730 | Accepted | import bisect
import heapq
import numpy as np
N, M = map(int,input().split())
a = list(map(int,input().split()))
a = list((np.array(a))*(-1))
heapq.heapify(a)
for m in range(M):
tgt = -heapq.heappop(a)
heapq.heappush(a,-(tgt//2))
res = 0
for n in range(N):
res += int(heapq.heappop(a))
print(-res)
|
p02658 | s695127974 | Accepted | import itertools
import copy
from collections import deque
import heapq
n = int(input())
a = list(map(int,input().split()))
a.sort()
a = a[::-1]
ans = 1
if a[-1] == 0:
print(0)
exit()
for i in a:
ans *= i
if ans > 10**18:
print(-1)
exit()
print(ans)
|
p03997 | s921771395 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
result = (a + b) * h / 2
print(result)
|
p02677 | s116199812 | Accepted | import math as ma
a,b,h,m = map(int,input().split())
al = 360 * (h + m /60) /12
bl = m*6
rad = ma.radians(min(abs(bl - al), 360 - abs(bl - al)))
r = ma.sqrt(a**2 + b**2 -2*a*b*ma.cos(rad))
print(r)
|
p02785 | s116192116 | Accepted | n, k = map(int, input().split())
ls = list(map(int, input().split()))
ls.sort()
if k == 0:
print(sum(ls))
else:
print(sum(ls[:(-1) * k])) |
p02663 | s492101310 | Wrong Answer | H1,M1,H2,M2,K = map(int,input().split())
tmp = K
if (M1 < M2):
H = H2 - H1 - 1
M = M1 - M2
if M < 0:
M = 60 - M
else:
H = H2 - H1
M = M2 - M1
T = H * 60 + M
ans = 0
while T > tmp:
T = T - K
ans += K
print(ans) |
p03241 | s432965403 | Accepted | n,m=map(int,input().split())
ans=0
for i in range(1,int(m**0.5)+1):
if m%i>0:continue
a=i
b=m//i
if a*n<=m:ans=max(ans,a)
if b*n<=m:ans=max(ans,b)
print(ans)
|
p03852 | s340265757 | Accepted | c = input()
vowel_list = ['a', 'i', 'u', 'e', 'o']
if (c in vowel_list):
print('vowel')
else:
print('consonant') |
p03352 | s206357767 | Accepted | x = int(input())
ans = 0
for i in range(1,100)[::-1]:
for j in range(2,11)[::-1]:
if i**j <= x:
ans = max(ans, i**j)
print(ans)
|
p04012 | s835785651 | Accepted | strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
if strlist.count(a) % 2:
flag = "No"
print(flag)
|
p03699 | s880046745 | Wrong Answer | N = int(input())
inputs = [int(input()) for i in range(N)]
points = [int(s) for s in inputs]
points_sorted = sorted(points)
get_point = sum(points)
non_10 = [x for x in points_sorted if (x % 10 != 0)]
if get_point % 10 != 0:
print(get_point)
elif non_10 == []:
print(0)
else:
print(get_point - min(points_... |
p03698 | s881584323 | Accepted | S = list(input())
ans = "yes"
for i in range(len(S)):
ch = S[i]
S[i] = "-1"
if ch in S:
ans = "no"
break
print(ans) |
p03759 | s187488829 | Accepted | a,b,c=map(int,input().split())
print('YES' if b-a == c-b else 'NO')
|
p02957 | s084288014 | Wrong Answer | a,b = map(int,input().split())
if a+b % 2 == 1:
print("IMPOSSIBLE")
else:
print(int((a+b)/2)) |
p02723 | s215333854 | Accepted | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.... |
p03239 | s224062589 | Accepted | N,T = map(int,input().split())
CT = [list(map(int,input().split())) for i in range(N)]
CT = list(filter(lambda x:x[1]<=T,CT))
if len(CT)==0:
print('TLE')
else:
print(min(CT)[0]) |
p03711 | s968545643 | Wrong Answer | f_1 = {1,3,5,7,8,10,12}
f_2 = {4,6,9,11}
x, y = map(int, input().split())
if (x in f_1) and (y in f_2):
print("Yes")
elif (x in f_2) and (y in f_2):
print("Yes")
else:
print("No") |
p02765 | s533804194 | Accepted | N,R = map(int,input().split())
if N < 10:
print(100*(10-N)+R)
else:
print(R) |
p03109 | s882218079 | Wrong Answer | S = input()
T = ("2019/05/01")
if S[0:-1] == T:
print("TBD")
else:
print("Heisei") |
p02696 | s598775918 | Accepted | import math
def f(x):
return math.floor(a*x/b) - a*math.floor(x/b)
a, b, n=map(int, input().split())
if b-1<=n:
ans=f(b-1)
print(ans)
else:
ans=f(n)
print(ans) |
p02724 | s080164949 | Accepted | x = int(input())
ans = 1000 * (x // 500)
ans += 5 * ((x % 500) // 5)
print(ans) |
p02621 | s485151591 | Accepted | n = int(input())
print(n + (n * n) + (n * n * n)) |
p02677 | s740048485 | Accepted | import math
a,b,h,m = map(int,input().split())
c = (h * 60 * 0.5) + (m * 0.5)
d = m * 6
if c > d:
e = c - d
else:
e = d - c
ans = (a * a) + (b * b) - 2 * a * b * math.cos(math.radians(e))
print(math.sqrt(ans)) |
p03548 | s981467731 | Accepted | X, Y, Z = map(int,input().split())
X = X - Z
print(X//(Y + Z)) |
p03673 | s556751572 | Accepted | n = int(input())
a = list(map(int, input().split()))
odd = a[0::2]
even = a[1::2]
ans = []
if n%2 == 0:
even.reverse()
ans.extend(even)
ans.extend(odd)
print (*ans)
else:
odd.reverse()
ans.extend(odd)
ans.extend(even)
print (*ans) |
p02880 | s941568867 | Wrong Answer | N = int(input())
for i in range(1,10):
for j in range(1,10):
if N == i*j:
print("Yes")
elif i*j ==81:
print("No")
|
p02861 | s280143375 | Accepted | import itertools
n = int(input())
lis = []
for i in range(n):
x, y = map(int, input().split())
lis.append((x, y))
LIS = [i for i in range(n)]
big_lis = list(itertools.permutations(LIS))
L = len(big_lis)
def sai(i, j):
return (lis[A[i + 1]][j] - lis[A[i]][j]) ** 2
keep = 0
ANS = 0
for i in range(L):
... |
p03485 | s245323377 | Wrong Answer | a,b=map(int,input().split())
print(((a+b)+2-1)/2) |
p03106 | s064955559 | Accepted | A, B, K = map(int, input().split())
cd = []
if A > B:
nums = [i for i in range(1, B+1)]
elif A < B:
nums = [i for i in range(1, A+1)]
else:
nums = [i for i in range(1, A+1)]
for i in nums:
if A % i == 0 and B % i == 0:
cd.append(i)
print(cd[-K]) |
p03479 | s582744077 | Accepted | x,y = map(int, input().split())
ans=0
i=x
while i<=y:
ans+=1
i*=2
print(ans)
|
p03379 | s207488519 | Accepted | n = int(input())
x = list(map(int, input().split()))
x_sorted = sorted(x)
cs = x_sorted[n // 2 - 1]
cb = x_sorted[n // 2]
for i, v in enumerate(x):
if v <= cs:
print(cb)
else:
print(cs) |
p02796 | s729947016 | Wrong Answer | n = int(input())
wk =[]
for i in range(n):
wk.append(list(map(int,input().split())))
xl = sorted(wk, key=lambda x:x[0])
xx = []
ll = []
cnt = 0
for i in range(n):
x,l = xl[i][0],xl[i][1]
if i == 0 or xx[cnt-1] + ll[cnt-1] -1 < x - l:
xx.append(x)
ll.append(l)
cnt +=1
print(len(... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.