problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02743 | s052777470 | Accepted | #!python3
# import numpy as np
# input
a, b, c = list(map(int, input().split()))
def main():
x = 4 * a * b
y = c - a - b
if y >= 0 and x < y ** 2:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p02731 | s483657505 | Accepted | L = int(input())
l = L / 3
print(l ** 3) |
p03495 | s868650353 | Wrong Answer | N,K=map(int,input().split())
a=list(map(int,input().split()))
d=[0]*N
ans=0
for i in range(N):
d[a[i]-1]+=1
d.sort(reverse=True)
if len(d)>K:
ans =sum(d[K:-1])
print(ans) |
p03962 | s715249906 | Wrong Answer | s = input()
l = s.split()
count = 0
if l[0] != l[1]:
count += 1
if l[1] != l[2]:
count += 1
if l[2] != l[0]:
count += 1
print(int(count/2))
|
p03285 | s418474750 | Wrong Answer | n = input()
for i in range(1,25):
for j in range(1,15):
if i*4+j*7==n:
print("Yes")
exit()
print("No") |
p02817 | s748379067 | Wrong Answer | S, T = map(str, input().split())
print(S+T)
|
p02989 | s666485943 | Accepted | N = int(input())
d = list(map(int, input().split()))
d.sort()
n = N // 2 -1
print(d[n+1] - d[n]) |
p03494 | s155831214 | Accepted | n = int(input())
a = list(map(int, input().split()))
flag = True
count = 0
while 1:
for i in range(n):
if a[i] % 2 != 0:
flag = False
break
a[i] /= 2
if not flag:
break
count += 1
print(count) |
p03698 | s888647841 | Accepted | S = input()
s = set(S)
if len(S) == len(s):
print("yes")
else:
print("no")
|
p03971 | s676906098 | Wrong Answer | n,a,b=map(int,input().split())
ca,cb=0,0
s=input()
for i in range(n):
if s[i]=="a":
if ca<a+b:
print("Yes")
ca+=1
elif s[i]=="b":
if ca<a+b and cb<b:
print("Yes")
ca+=1;cb+=1
else: print("No")
else: print("No") |
p02768 | s597689638 | Accepted | mod = 10**9+7
n, a, b = map(int, input().split())
def comb(n, r):
c = 1
for i in range(r):
c *= n-i
c %= mod
d = 1
for i in range(1, r+1):
d *= i
d %= mod
return (c * pow(d, mod-2, mod)) % mod
ans = pow(2, n, mod) - 1 - comb(n, a) - comb(n, b)
ans %= mod
print(... |
p03000 | s510111756 | Wrong Answer | n, x = map(int, input().split())
l = input().split()
for i in range(n):
l[i] = int(l[i])
cnt = 1
sum = 0
for i in range(n):
if sum > x:
break
sum += l[i]
cnt += 1
print(cnt)
|
p03835 | s472213576 | Wrong Answer | K,S=map(int,input().split())
ans=1
a=max(0,S-2*K)
for i in range(a,K+1):
if i>S:
break
for j in range(a,K+1):
if i+j>S :
break
if S-i+j<=K :
ans+=1
print(ans) |
p03951 | s370948915 | Accepted | n = int(input())
s = input()
t = input()
for i in range(n, 2*n+1):
if s[n - (2*n-i):] == t[:2*n-i]:
print(i)
exit()
|
p03319 | s968369114 | Accepted | import math
n, k = map(int, input().split())
al = list(map(int, input().split()))
ans = math.ceil((n-1)/(k-1))
print(ans) |
p02661 | s785145759 | Accepted | N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
AB = list(map(list, (zip(*AB))))
A = sorted(AB[0])
B = sorted(AB[1])
if N % 2 == 0:
m = N // 2
left = (A[m] + A[m-1])
right = (B[m] + B[m-1])
print(right - left + 1)
else :
m = N // 2
print((B[m] - A[m]) + 1)
|
p02982 | s628320043 | Accepted | import math
N, D = map(int, input().split())
X = [[int(x) for x in input().split()] for i in range(N)]
count = 0
for i in range(N):
for j in range(i+1, N):
sum = 0
for d in range(D):
sum += pow(X[i][d]-X[j][d], 2)
if math.sqrt(sum)%1==0:
count += 1
print(count) |
p03469 | s284169708 | Wrong Answer | S = list(input())
S[3] = "8"
print(S[::])
|
p03012 | s843828921 | Accepted | # 129 B-Balance
N = int(input())
W =list(map(int, input().split()))
ans = abs((W[0]-sum(W[1:N])))
for i in range(2,N):
if abs(sum(W[0:i])-sum(W[i:N])) < ans:
ans = abs(sum(W[0:i])-sum(W[i:N]))
print(ans) |
p03625 | s751342537 | Wrong Answer | input()
from collections import *
c=Counter(map(int,input().split()))
l=sorted(-k for k,v in c.items() if v>1)
print(0 if len(l)<2 else l[0]*l[1]) |
p02882 | s657862415 | Wrong Answer | import math
a,b,x=map(int,input().split())
aa=min(0,2*a**2*b-2*x)
bb=a**3
print(math.degrees(math.atan2(aa,bb)))
|
p03416 | s622536142 | Wrong Answer | def resolve():
a, b = map(int, input().split())
ans = 0
for i in range(a, b):
v = str(i)
if v == v[::-1]:
ans += 1
print(ans)
resolve() |
p03548 | s601472283 | Wrong Answer | X,Y,Z=map(int,input().split())
for i in range(1,X):
if (Y+Z)*i+Z > X:
print(i)
break |
p02959 | s402557975 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
if len(A) == 1:
print(min(A, B))
exit()
m = A[-1]+A[-2]
i = 0
j = -2
while i != N*-1:
i -= 1
j -= 1
if m > B[i]:
m -= B[i]
ans += B[i]
else:
ans += m
m = 0
try:
... |
p03309 | s821850335 | Accepted | N = int(input())
A = list(map(int, input().split()))
for i in range(N):
A[i] = A[i] - i - 1
A = sorted(A)
if N % 2 == 1:
m = A[N//2]
else:
m = (A[N//2] + A[N//2 - 1]) // 2
ans = 0
for i in range(N):
ans += abs(A[i] - m)
print(ans) |
p02712 | s602737707 | Accepted | N = int(input())
n = 0
for i in range(1, N+1):
if i % 5 != 0 and i % 3 != 0:
n += i
print(n) |
p03804 | s914174124 | Accepted | N, M = map(int, input().split())
mp1 = [input() for _ in range(N)]
mp2 = [input() for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1):
f = 1
for k in range(M):
for l in range(M):
if mp2[k][l] != mp1[i+k][j+l]:
f = 0
break
if f == 0:
break
if f =... |
p02660 | s828805013 | Accepted | # input()
# int(input())
# map(int,input().split())
# list(map(int,input().split()))
# [input() for _ in range(n)]
import collections
import math
n = int(input())
c = collections.Counter()
i=2
nn = n
while nn!=1:
#print(i)
if i>math.sqrt(nn):
c[nn]+=1
break
if nn%i==0:
c[i]+=1
nn = nn // i
el... |
p02646 | s930528757 | Accepted | A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())
if V*T >= W*T+abs(B-A):
print("YES")
else:
print("NO") |
p03146 | s094565632 | Wrong Answer | s = int(input())
tmp = s
MAX_m = 1000001
ans = [0] * MAX_m
for i in range(1, MAX_m):
if tmp % 2 == 0:
tmp /= 2
else:
tmp = 3*tmp + 1
if tmp in ans:
print(i+1)
exit()
else:
ans[i] = tmp |
p03285 | s194670208 | Wrong Answer | import sys
N = int(input())
ans = 0
def dfs(n):
print(n)
if n == N:
sys.exit()
if n > N:
return
dfs(n+4)
dfs(n+7)
dfs(0)
print('No') |
p02660 | s080355533 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
N = int(input())
def prime_factorize(n):
ret = []
for i in range(2, int(n ** (1 / 2)) + 1):
if i > n:break
while n % i == 0:
n //= i
ret.append(i)
if n != 1:
ret.append(n)
return ret
dic = def... |
p03331 | s333843540 | Accepted | n = sum(map(int, input()))
print(10 if n == 1 else n) |
p02622 | s320395049 | Accepted | s=input('')
t=input('')
c=0
b=0
for a in s:
if a!=t[b]:
c=c+1
b=b+1
print(c) |
p02684 | s733774240 | Accepted | n, k = map(int, input().split())
a = [int(i) for i in input().split()]
lst = []
visit_now = 1
visit_list = [-1] * (n + 1)
cnt = 0
while visit_list[visit_now - 1] == -1:
visit_list[visit_now - 1] = cnt
lst.append(visit_now)
visit_now = a[visit_now - 1]
cnt += 1
start = visit_list[visit_now - 1]
loop_... |
p02911 | s170331323 | Wrong Answer | N,K,Q = map(int,input().split())
A=[0]*Q
for i in range(Q):
A[i]=int(input())
sanka=[0]*N
for i in range(Q):
sanka[A[i]-1] +=1
for j in range(N):
sanka[j]=sanka[j]+K-Q
print(sanka)
for k in range(N):
if sanka[k]>=1:
print('Yes')
else:
print('No')
|
p03796 | s930864810 | Accepted | import math
n = int(input())
ans = (math.factorial(n)) % (10 ** 9 + 7)
print(ans)
|
p03241 | s004538639 | Wrong Answer | from math import gcd
n, m = map(int, input().split())
print(gcd(*divmod(m, n)))
|
p02773 | s785109049 | Wrong Answer | n = int(input())
s = [input() for i in range(n)]
s.sort(reverse=True)
l = set(s)
ms = len(s) - len(l)
if len(l) == 1:
print(s[0])
exit()
elif len(l) == n:
s.sort()
print("\n".join(s))
exit()
ans = 0
ans_l = []
for i in l:
sc = s.count(i)
if sc > ans:
ans_l = [i]
ans = sc
... |
p02702 | s909018611 | Accepted | S = input()
mod = [0] * 2019
mod[0] = 1
d = 1
n = 0
for i in reversed(S):
n += int(i) * d
n %= 2019
d *= 10
d %= 2019
mod[n % 2019] += 1
ans = 0
for j in range(2019):
ans += mod[j] * (mod[j] - 1) // 2
print(ans)
|
p02547 | s849077240 | Accepted | n=int(input())
q=[]
for _ in range(n):
d_1,d_2=map(int,input().split())
if d_1==d_2:
q.append(1)
else:
q.append(0)
for i in range(n-2):
if q[i]==q[i+1]==q[i+2]==1:
print("Yes")
exit()
print("No") |
p03017 | s204512422 | Accepted | n, a, b, c, d = map(int, input().split())
s = input()
if "##" in s[min(a,b):max(c,d)]:
print("No")
exit()
if c < d:
print("Yes")
else:
if "..." in s[b-2:d+1]:
print("Yes")
else:
print("No") |
p02707 | s524258956 | Accepted | n=int(input())
A=list(map(int,input().split()))
R=[0]*n
for a in A:
R[a-1]+=1
for r in R:
print(r) |
p02836 | s491560775 | Accepted | s = input()
n = len(s)
ans = 0
for i in range(n//2):
if s[i] != s[n-1-i]:
ans += 1
print(ans)
|
p03486 | s223830587 | Accepted | #!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/B-TwoAnagrams.py
#
s = input()
t = input()
s_sorted = sorted(s)
t_sorted = sorted(t, reverse=True)
for i in range(min(len(s), len(t))):
if s_sorted[i] == t_sorted[i]:
continue
elif ord(s_sorted[i]) < ord(t_sorted[i]):
... |
p03592 | s795914176 | Wrong Answer | m, n, k = map(int, input().split())
l = []
for i in range(1,n+1):
for j in range(1,n+1):
l.append(i*m + j*n -2*i*j)
# print(l)
if k in l:
print("Yes")
else:
print("No")
|
p03592 | s111587074 | Wrong Answer | n,m,k=map(int,input().split())
d1=k%n
d2=k%m
if d1==0 or d2==0:
print('Yes')
elif d1==m or d2==n:
print('Yes')
else:
print('No') |
p02627 | s862067158 | Accepted | alpha = input()
if alpha.isupper():
print('A')
else:
print('a') |
p02773 | s956654584 | Wrong Answer | from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
dics = Counter(sorted(s))
lists = dics.most_common()
print(lists[0][1])
maxc = lists[0][1]
for word,cnt in lists:
if maxc == cnt:
print(word)
|
p03163 | s384341636 | Accepted | N,W=map(int,input().split())
listN=[[0 for i in range(W+1)] for k in range(N+1)]
for i in range(N):
w,v=map(int,input().split())
for k in range(1,W+1):
if k>=w:
listN[i+1][k]=max(listN[i][k],listN[i][k-w]+v)
else:
listN[i+1][k]=listN[i][k]
ans=listN[N][W]
print(ans) |
p03696 | s039124915 | Accepted | N = int(input())
S = input()
cd = []
q = []
for s in S:
if q and q[-1]=="(":
if s==")":
q.pop()
else:
q.append(s)
else:
q.append(s)
sl = []
sr = []
for s in q:
if s==")":
sl.append("(")
else:
sr.append(")")
print("".join(sl)+S+"".join(sr)... |
p02717 | s747143812 | Accepted | X, Y, Z = map(int,input().split())
X, Y = Y, X
X, Z = Z, X
print(X,Y,Z) |
p03087 | s161940221 | Wrong Answer | n,q = [int(x) for x in input().split()]
s = input()
t = [0]*(n+1)
for i in range(n):
t[i+1] = t[i] + (1 if s[i:i+2] == "AC" else 0)
print(t)
for _ in range(q):
l,r = [int(x) for x in input().split()]
print(t[r-1]-t[l-1])
|
p04030 | s279354785 | Wrong Answer | string = input()
length = len(string)
result = ""
for l in range(0, length-1):
if string[l] != 'B':
if string[l+1] != 'B':
result += string[l]
result += string[length-1]
print(result)
|
p02695 | s487549977 | Wrong Answer | import itertools
N, M, Q = map(int, input().split())
a = [None for _ in range(Q)]
b = [None for _ in range(Q)]
c = [None for _ in range(Q)]
d = [None for _ in range(Q)]
for i in range(Q):
a[i], b[i], c[i], d[i] = map(int, input().split())
ans = 0
elements = list(range(1, M+1))
for combination in itertools.combinat... |
p03437 | s431214567 | Accepted | x, y = map(int, input().split())
if x % y == 0:
print(-1)
else:
print(x) |
p02552 | s719589496 | Wrong Answer | # cording:utf-8
# xを入力
x = int(input())
# xが0なら
if x == 0:
# 1を出力
print("0")
elif x == 1:
# 0を出力
print("1") |
p03042 | s886555798 | Accepted | S = input()
s1,s2 = int(S[0:2]),int(S[2:4])
def f(n):
if n >= 1 and n <= 12:
return True
else:
return False
if f(s1) and f(s2):
print("AMBIGUOUS")
elif f(s1) and (s2 > 12 or s2 ==0):
print("MMYY")
elif f(s2) and (s1 > 12 or s1 ==0):
print("YYMM")
else:
print("NA") |
p02694 | s052068661 | Wrong Answer | from math import log
x = int(input())
y = round((log(x/100))/(log(1.01)))
print(y) |
p02922 | s888011679 | Accepted | a, b = map(int, input().split())
c = 1
ans = 0
while c < b:
c += a-1
ans += 1
print(ans) |
p02792 | s586091241 | Wrong Answer | N = int(input())
cnt = 0
for a in range(1,N):
for b in range(1,N):
str_a = str(a)
str_b = str(b)
if str_a[0] == str_b[-1] and str_b[0] == str_a[-1]:
cnt += 1
#print(a,b)
print(cnt)
|
p03861 | s248053612 | Accepted | a, b, x = map(int, input().split())
if a%x == 0:
print((b//x+1) - (a//x))
else:
print((b//x+1) - (a//x+1))
|
p02951 | s412413723 | Accepted | a,b,c=map(int,input().split())
print(max(0,c-(a-b))) |
p03814 | s656429648 | Accepted | n = input()
a = n.find("A")
z = n.rfind("Z")
print(z-a+1) |
p02881 | s228340639 | Wrong Answer | # C - Walk on Multiplication Table
N = int(input())
start = [1, 1]
end = [0, 0]
for i in range(1, int(N ** (1 / 2))):
if N % i == 0:
end[0] = i
end[1] = N // i
print((end[0] - start[0]) + (end[1] - start[1]))
|
p02791 | s959193292 | Wrong Answer | n=input()
p=input()
p=p.split()
q=[]
for i in range(len(p)):
if min(p[:i+1])==p[i]:
q.append(p[i])
print(len(q)) |
p03262 | s491585642 | Wrong Answer | from fractions import gcd
import sys
N, X = map(int, input().split())
x = list(map(int, input().split()))
if N == 1:
print(abs(x[0] - X))
sys.exit()
x = list(map(lambda y: y - X, x))
x.append(0)
x.sort()
dif = list()
for i in range(N - 1):
dif.append(x[i + 1] - x[i])
print(gcd(min(dif), max(dif)))
|
p03457 | s581779247 | Wrong Answer |
def check(dest,start):
tmp = dest[1] - start[1] + dest[2] - start[2] - (dest[0] - start[0])
if tmp <= 0 and tmp%2 == 0 :
return True
else:
return False
n = int(input())
start = [0,0,0]
for i in range(n):
dest = list(map(int, input().split()))
if check(dest,start):
start = d... |
p02707 | s979938541 | Wrong Answer | N = input()
S = input()
for A in range (int(N)-1):
print(S.count(str(A+1),A,int(N)-2)) |
p03221 | s714982840 | Wrong Answer | import sys
from heapq import heapify
def main():
N,M = map(int, input().split())
PY_input = []
PY = [[] for i in range(N+1)]
for _ in range(M):
p, y = map(int, sys.stdin.readline().split())
PY_input.append((p, y))
PY[p].append(y)
for i in PY:
heapify(i)
for p, ... |
p02695 | s373164561 | Wrong Answer | a, b, n = map(int, input().split())
ans = 0
for i in range(n):
t = int(a * i / b) - a * int(i/b)
if t > ans:
ans = t
print(int(ans)) |
p02796 | s264816116 | Accepted | N = int(input())
table = []
for i in range(N):
X,L = map(int,input().split())
table.append((X-L,X+L))
table = sorted(table, key=lambda x:x[1])
cur = 0
l_cur, r_cur = table[0]
ans = N
for i in range(1,N):
l,r = table[i]
if r_cur > l:
ans -= 1
else:
l_cur, r_cur = l,r
print(ans) |
p03001 | s456274923 | Wrong Answer | W,H,x,y = list(map(int,input().split()))
M = W*H/2
ans = 0
if x == W//2 or y == H//2:
ans = 1
if x == 0 or y == 0:
ans = 0
print(M,ans) |
p03037 | s911516772 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
L = 0; R = 10 ** 6
for _ in range(M):
l, r = lr()
if l > L:
L = l
if r < R:
R = r
answer = max(0, R - L + 1)
print(answer)
|
p03659 | s339724003 | Accepted | #067_C
n=int(input())
a=list(map(int,input().split()))
cs=[a[0] for _ in range(n)]
for i in range(n-1):
cs[i+1]=cs[i]+a[i+1]
abs_cs=[abs(2*cs[i]-cs[-1]) for i in range(n-1)]
print(min(abs_cs)) |
p02996 | s650530516 | Accepted | N=int(input())
a=list()
for _ in range(N):
A,B=map(int,input().split())
a.append((B,A))
a.sort()
t=0
for i in range(N):
t+=a[i][1]
if t>a[i][0]:
print("No")
exit()
print("Yes")
|
p03860 | s886885570 | Wrong Answer | s = input()
print('A'+s[0]+'C') |
p03251 | s884920094 | Accepted | n, m, x, y = map(int, input().split())
x_l = list(map(int, input().split()))
y_l = list(map(int, input().split()))
ans = 'War'
for z in range(x + 1, y + 1):
if x < z <= y:
if all([i < z for i in x_l]) and all([i >= z for i in y_l]):
ans = 'No War'
break
print(ans) |
p03061 | s173409663 | Accepted | from fractions import gcd
n = int(input())
A = list(map(int,input().split()))
left = [0]*n
right= [0]*n
for i in range(n-1):
left[i+1] = gcd(left[i],A[i])
right[n-i-2] = gcd(right[n-i-1],A[n-i-1])
ans = 0
for i in range(n):
ans = max(ans, gcd(left[i],right[i]))
print(ans)
|
p03077 | s839591087 | Accepted |
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
print(-(-n // min(a, b, c, d, e)) + 4) |
p02772 | s648604491 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = True
for i in a:
if i % 2 == 0:
if not (i % 3 == 0 or i % 5 == 0):
ans = False
break
if ans:
print('APPROVED')
else:
print('DENIED')
|
p03146 | s447053305 | Wrong Answer | import sys
s = int(input())
if not ( 1 <= s <= 100 ): sys.exit()
array = [s]
for I in range(1,10 ** 6 + 1):
if array[ I - 1 ] % 2 == 0:
if array[I - 1]//2 in array:
print(I)
sys.exit()
array.append(array[(I - 1)]//2)
else:
if (3 * array[I - 1]) + 1 in array:... |
p02700 | s700206772 | Wrong Answer | A, B, C, D = map(int, input().split())
if C//B > A//D or B >= C:
print('Yes')
else:
print('No')
|
p02831 | s244981940 | Wrong Answer | a, b = map(int, input().split());
a_y = [];
b_y = [];
for i in range(2,114514):
if a > 1:
if a % i == 0:
a = a // i;
a_y.append(i);
else:
break;
for i in range(2,114514):
if b > 1:
if b % i == 0:
b = b // i;
b_y.append(i);
else:
break;
y = a_y + b_y;
y = list(set(y... |
p03721 | s175801635 | Wrong Answer | n,k = map(int,input().split())
l = [list(map(int,input().split())) for i in range(n)]
l.sort()
count = 0
for i,j in l:
if j < count:
count += j
else:
print(i)
exit() |
p03042 | s633495990 | Wrong Answer | a,b,c,d=input()
x=int(a+b)
y=int(c+d)
if 1<=x<=12 and 1<=y<=12:
print('AMBIGUOUS')
elif 1<=x<=12 and 0<=y<=99:
print('MMYY')
elif 0<=x<=99 and 1<=x<12:
print('YYMM')
else:
print('NA') |
p03469 | s366241887 | Wrong Answer | s = list(input())
s[3] = "8"
print(s) |
p02723 | s409660575 | Accepted | S = str(input())
if S[2] == S[3] and S[4] == S[5]:
print("Yes")
else:
print("No") |
p02831 | s962163010 | Wrong Answer | from fractions import gcd
A, B = map(int, input().split())
print(A*B/gcd(A, B))
|
p02801 | s837588071 | Accepted | a='abcdefghijklmnopqrstuvwxyz'
al=[l for l in a]
s=input()
print(al[a.index(s)+1]) |
p02971 | s764294873 | Wrong Answer | N = int(input())
number = []
for i in range(N):
number.append(int(input()))
if N == 2:
print(number[0])
print(number[1])
exit()
if N == 3:
print(max(number[1:]))
print(max(number[2:]))
print(max(number[:2]))
exit()
print(max(number[1:]))
for i in range(1,N-1):
max_... |
p02773 | s406648351 | Accepted | # ABC155 C
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
from collections import defaultdict as dd
from operator import itemgetter
n=ni()
d=dd(int)
# s=[si() for i in range(n)]
for i in range(n):
s=input()
d[s]+=1
mv=0
for k,v... |
p02697 | s938533942 | Accepted | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(1, m+1):
print(i, n-i)
else:
for i in range(1, m+1):
if (n - i - i) > (n // 2):
print(i, n-i)
else:
print(i+1, n-i)
|
p03767 | s368155287 | Wrong Answer | n = int(input())
A=[int(i) for i in input().split()]
A.sort()
sum=0
for i in range(n, n+n):
sum+=A[i]
print(sum)
|
p03352 | s736830250 | Wrong Answer | import math
X = int(input())
print(int(math.sqrt(X))) |
p03556 | s733362434 | Accepted | n=int(input())
max=0
for i in range(1,n+1):
if i**2<=n:
if i**2>max:
max=i**2
else:
break
print(max) |
p02646 | s052814849 | Accepted | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v==w:
print('NO')
exit()
c=abs(a-b)/(v-w)
print('YES' if 0<=c and c<=t else 'NO') |
p02838 | s031256685 | Accepted | import sys
stdin = sys.stdin
mod = 1000000007
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n = ni()
a = na()
ans = 0
for i in range(61):
z, o = [0] * 2
for j in range(n):
if a[j] & (1 << i):
o += 1
... |
p03481 | s867844817 | Wrong Answer | X,Y = map(int, input().split())
import math
if X != 1:
tmp1 = math.floor(math.log((Y/X),2))
print(tmp1 + 1)
if X == 1 :
tmp2 = math.floor(math.log((Y/X),2))
print(tmp2) |
p03962 | s773288054 | Wrong Answer | a,b,c = map(int,input().split())
if a != b != c:
print(3)
if a == b and a != c and b != c:
print(2)
if b == c and b != a and c != a:
print(2)
if a == c and a != b and c != b:
print(2)
if a == b == c:
print(1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.