problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02814 | s496379756 | Accepted | from fractions import gcd
n, m = map(int, input().split())
a = [int(i)//2 for i in input().split()]
def lcm(x, y):
return x*y//gcd(x, y)
l = 1
for i in a:
l = lcm(l, i)
for i in a:
if l//i % 2 == 0:
print(0)
exit()
print((m//l+1)//2) |
p02640 | s733528244 | Accepted | n=input()
x,y=n.split()
for c in range(int(x)+1):
cnt=0
t=int(x)-c
asi=2*c+4*t
if asi==int(y):
print("Yes")
cnt=1
break
if cnt==0:
print("No") |
p02705 | s466155459 | Wrong Answer | import math
x = float(input())
print(x * x * math.pi) |
p03592 | s078648395 | Accepted | n,m, k = map(int, input().split())
bo = False
for i in range(0,n+1):
for j in range(0,m+1):
if i*(m-j) + j*(n-i) == k:
bo = True
if bo :
print("Yes")
else:
print("No")
|
p03013 | s847837110 | Accepted | N,M=map(int,input().split())
dp=[True]*(N+2)
S=list(int(input()) for _ in range(M))
for i in S:
dp[i]=False
num=[0]*(N+2)
MOD=1000000007
num.insert(0,1)
for i in range(0,N):
if dp[i]:
num[i+1]+=num[i]
num[i+1]%=MOD
num[i+2]+=num[i]
num[i+2]%=MOD
print(num[N]) |
p02663 | s872360091 | Accepted | h1,m1,h2,m2,k=map(int,input().split())
ans2=h2*60+m2
ans1=h1*60+m1
print(ans2-ans1-k)
|
p03086 | s633741754 | Accepted | s = input()
ans = 0
def check(sub):
check_s = set(list("ACGT"))
for c in sub:
if not c in check_s:
return 0
return len(sub)
for i in range(len(s)):
for j in range(i+1, len(s)+1):
ans = max(ans, check(s[i:j]))
print(ans)
|
p02596 | s605407360 | Wrong Answer | import numpy as np
k = int(input())
if k % 2 ==0:
print(-1)
elif str(k)[0] == 5:
print(-1)
elif k == 101:
print(4)
else:
print(k-1) |
p02621 | s575364338 | Accepted | a = int(input())
ans = a + a*a + a*a*a
print(ans) |
p02570 | s623650954 | Accepted | d,t,s = map(int,input().split())
if d / (s*t) <= 1:
print("Yes")
else:
print("No") |
p03827 | s980733803 | Wrong Answer | import sys
N = int(input())
S = str(input())
if N <= 0 or N >= 100:
sys.exit()
x = 0
max = 0
for I in S:
if I == "I":
x += 1
if max < x:
max = x
continue
if I == "D":
x -=1
continue
print(max) |
p02811 | s707159765 | Accepted | k,x = [int(x) for x in input().split()]
k = k * 500
if k >= x:
print("Yes")
else:
print("No") |
p03721 | s654543720 | Accepted | import heapq
n,k=map(int,input().split())
q=[]
for _ in range(n):
a,b=map(int,input().split())
heapq.heappush(q,(a,b))
while k>0:
a,b=heapq.heappop(q)
k-=b
print(a) |
p03479 | s619019145 | Accepted | def resolve():
ans=1
x,y=map(int,input().split())
while True:
x*=2
if x>y:
print(ans)
break
ans+=1
resolve() |
p03605 | s537770216 | Accepted | N=list(input())
if "9" in N:
print("Yes")
else:
print("No") |
p03360 | s887323406 | Accepted | s = list(map(int, input().split()))
k = int(input())
s.sort(reverse=True)
print(s[0]*(2**k)+s[1]+s[2]) |
p02641 | s167180781 | Accepted | X,N = map(int,input().split())
P = set(map(int,input().split()))
diff = 0
while True:
if X - diff not in P:
print(X - diff)
break
elif X + diff not in P:
print(X + diff)
break
else:
diff += 1
|
p03693 | s258945044 | Accepted | a, b, c = map(int, input().split())
num = (100 * a) + (10 * b) + c
print('YES' if (num % 4) == 0 else 'NO')
|
p03455 | s285835429 | Wrong Answer | a , b = map(int,input().split())
x = a * b
if x % 2 == 0:
print("Even")
else:
print("odd")
|
p02547 | s815704259 | Accepted | N = int(input())
count = 0
ans = "No"
for i in range(N):
d1,d2 = map(int,input().split())
if d1 == d2:
count += 1
if count == 3:
ans = "Yes"
else:
count = 0
print(ans) |
p03438 | s278423632 | Accepted | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
print('YNeos'[sum(B)-sum(A)<sum(max(0,(b-a+1)//2)for a,b in zip(A,B))::2]) |
p03035 | s604889805 | Wrong Answer | A, B =map(int,input().split())
answer = 0
if A >=13:
answer = B
elif A > 6:
answer = B/2
print(int(answer)) |
p02912 | s420647123 | Accepted | from heapq import heappush,heappop
n,k=map(int,input().split())
a=list(map(int,input().split()))
q=[]
for i in a:
heappush(q,-i)
for _ in range(k):
i=heappop(q)
i=-i//2
heappush(q,-i)
print(-sum(q)) |
p03338 | s736145455 | Wrong Answer | n = int(input())
s = [i for i in input()]
max = 0
for i in range(1, n-1):
a = set(s[:i])
b = set(s[i:])
print(a & b)
if max < len(a & b):
max = len(a & b)
print(max)
|
p03998 | s341001385 | Accepted | S = [input() for _ in range(3)]
D = {'a':0, 'b':1, 'c':2}
N = [0]*3
p = 0
while N[p]<len(S[p]):
p_new = D[S[p][N[p]]]
N[p]+=1
p = p_new
print('ABC'[p]) |
p03456 | s550719777 | Accepted | a, b = map(int, input().split())
print('Yes' if (int(str(a) + str(b)) ** 0.5).is_integer() else 'No')
|
p02693 | s682972131 | Accepted | #!/usr/bin/python3
# -*- coding: utf-8 -*-
k = int(input())
a, b = map(int, input().split())
flag = 0
for i in range(a, b + 1):
if i % k == 0:
flag = 1
break
if flag == 1:
print("OK")
else:
print("NG") |
p02836 | s591820010 | Accepted | S = list(input())
count = 0
for i in range(len(S)//2):
if S[i] != S[-(i+1)]:
count += 1
print(count) |
p02731 | s146313411 | Wrong Answer | l = int(input())
m = 0
for i in range(l):
for j in range(l-i):
t = i * j * (l-i-j)
if m < t:
m = t
print(m) |
p02823 | s979997951 | Accepted | N,A,B = map(int,input().split())
a = min(A,B)
b = max(A,B)
d = b - a
#差が偶数の時：d/2
#差が奇数の時：どちらかの端で一回稼ぐ
if d%2 == 0:
print(d//2)
else:
r = min(a,N-b+1)
r += (b-a-1)//2
print(r) |
p02755 | s332228376 | Accepted | from math import floor
A,B = map(int,input().split(" "))
s = 10*B
t = 10*(B+1)
ans = 2**60
for tmp in range(s,t):
if floor(tmp*0.08) == A:
ans = tmp
break
s = 125*A
t = 125*(A+1)
for tmp in range(s,t):
if floor(tmp/10) == B:
ans = min(ans,tmp)
break
if ans == 2**60:
ans = -1
... |
p03087 | s485639400 | Accepted | import sys
def input():
return sys.stdin.readline().rstrip()
N, Q = map(int, input().split())
S = input()
li = [0]*(N+1)
for i in range(N):
if S[i:i+2] == 'AC':
li[i+1] = li[i] + 1
else:
li[i+1] = li[i]
for i in range(Q):
l, r = map(int, input().split())
print(li[r-1] - li[l-1]) |
p03328 | s073831666 | Accepted | a,b=map(int,input().split())
h=sum([i for i in range(1,b-a+1)])
print(h-b)
|
p02836 | s089932482 | Wrong Answer | s = input()
n = len(s)//2
cnt = 0
for i in range(n):
if (s[i] != s[n - 1 - i]):
cnt+=1
print(cnt)
|
p02780 | s427673140 | Accepted | N,K=map(int,input().split())
p = list(map(int,input().split()))
ruisekiwa=[0]
for i in range(N):
ruisekiwa.append(ruisekiwa[i]+(1+p[i])/2)
max_value=0
for i in range(N-K+1):
tmp=ruisekiwa[i+K]- ruisekiwa[i]
if(max_value < tmp):
max_value=tmp
print(max_value) |
p02732 | s820696343 | Accepted | import collections
n = int(input())
a = list(map(int, input().split()))
c = collections.Counter(a)
v = c.values()
s = 0
for i in v:
s += (i*(i-1))//2
for i in range(n):
d = c[a[i]]
x = (d*(d-1))//2 if d > 1 else 0
y = ((d-1)*(d-2))//2 if d > 2 else 0
print(s-x+y)
|
p02622 | s473650643 | Accepted | S = input()
T = input()
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count)
|
p02621 | s745216435 | Wrong Answer | n = int(input())
a = 1000
while a < n:
a += 1000
print(a-n) |
p02862 | s712506185 | Accepted | x,y=map(int,input().split())
a=-1
p=10**9+7
for i in range(x//2+1):
if i+2*(x-2*i)==y:
a=i
break
if a==-1:
print(0)
exit()
elif a==0:
print(1)
exit()
else:
gyaku=[0,1]
for i in range(2,a+1):
gyaku.append(((p//i)*-gyaku[p%i])%p)
com=[1]
for i in range(1,a+1):
com.append(com[-1]*gyaku[i]... |
p02963 | s845849878 | Wrong Answer | s = int(input())
print(0, 0, 1, 1, s, 0) |
p02602 | s372898764 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(k,n):
if a[i]/a[i-k]>1:
print('Yes')
else:
print('No') |
p02833 | s471300307 | Wrong Answer | n=int(input())
s=0
i=1
while 1:
if n<5**i:
break
s+=(n+5)//((5**i)*2)
i+=1
print(0 if n%2 else s) |
p03998 | s671706490 | Wrong Answer | a = input()
b = input()
c = input()
countlist = [0, 0, 0]
list = ["a", "b", "c"]
turn = 0
value = ""
for x in range(len(a) + len(b) + len(c)):
if countlist[0] == len(a) or countlist[1] == len(b) or countlist[2] == len(c): break
if turn == 0: value = a[countlist[turn]]
elif turn == 1: value = b[countlist[tur... |
p03437 | s669535553 | Wrong Answer | x,y = map(int, input().split())
if y%x == 0: print(-1)
else: print(x) |
p03161 | s804552905 | Wrong Answer | n, k = map(int, input().strip().split())
arr = list(map(int, input().strip().split()))
MAX = 10**5
dp = [MAX] * (n)
dp[0] = 0
for i in range(0, n):
for j in range(i, i + k + 1):
if j < n:
dp[j] = min( dp[j], dp[i] + ( abs( arr[j] - arr[i] ) ) )
print(dp[-1]) |
p02779 | s690376469 | Wrong Answer | import heapq
N = int(input())
A = list(map(int, input().split()))
res = "YES"
heapq.heapify(A)
for i in range(len(A)):
if i == 0:
continue
if A[i] == A[i-1]:
res = "NO"
break
else:
continue
print(res)
|
p02598 | s646405249 | Accepted | N, K = map(int, input().split())
a = list(map(int, input().split()))
max_a = 10**9
min_a = 0
while True:
k = K
res = (max_a+min_a)//2
for i in range(N):
if a[i] <= res:
continue
k -= (a[i]//res)
if k >= 0:
max_a = res
else:
min_a = res
if max_a - min_... |
p03672 | s498031492 | Accepted | S = input()
l = len(S)
l = (l-2)//2
while l > 0:
if S[0:l] == S[l:2*l]:
print(2*l)
break
l = l-1
|
p03617 | s509444982 | Wrong Answer | # -*- coding: utf-8 -*-
q, h, s, d = map(int,input().split())
n = int(input())
tmp = [4 * q, 2 * h, s, d / 2]
tmp.sort()
if tmp[0] == d / 2:
if tmp[1] == s:
ans = d * (n // 2) + s
if tmp[1] == 2 * h:
ans = d * (n // 2) + 2 * h
if tmp[1] == 4 * q:
ans = d * (n // 2) + 4 * q
if tmp[0]... |
p02706 | s276128215 | Accepted | n, m = map(int, input().split())
a = list(map(int, input().split()))
if n < sum(a):
print(-1)
else:
print(n - sum(a)) |
p02819 | s821072117 | Accepted | m=int(input())
for j in range(m,1000000):
#print(j)
pf={}
for i in range(2,int(j**0.5)+1):
while j%i==0:
pf[i]=pf.get(i,0)+1
j//=i
if j>1:pf[j]=1
#print(pf)
if sum(pf.values())==1:
print(j)
exit() |
p02702 | s694297906 | Wrong Answer | baisu=set([])
i=1
while 1:
temp=2019*i
if "0" not in str(temp):
baisu.add(str(temp))
if temp>20000000:
break
i+=1
n=input()
cnt=0
for i in baisu:
if i in n:
cnt+=1
print(cnt)
|
p02701 | s806994512 | Accepted | n = int(input())
s = [input() for i in range(n)]
s_set = set(s)
print(len(s_set)) |
p03163 | s117727184 | Wrong Answer | import numpy as np
N, W = map(int, input().split())
dp = np.zeros(W + 1, int)
for i in range(N):
w, v = map(int, input().split())
np.maximum(dp[:-w] + v, dp[w:], out=dp[w:])
print(dp)
print(dp[-1])
|
p02598 | s534320449 | Wrong Answer | import numpy as np
N,K = [int(x) for x in input().split()]
Ls = [int(x) for x in input().split()]
Ls = np.array(Ls)
cut = np.array([1]*N)
ans = Ls / cut
for k in range(K):
idx = np.argmax(ans)
cut[idx] += 1
ans = Ls / cut
print(int(np.round(max(ans)))) |
p03695 | s252401733 | Wrong Answer | from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
a = readInts()
rate = [0]*9
for i in a:
rate[min(i//400,8)]+=1
base = 8-rate[:-1].count(0)
ma =... |
p03672 | s960811811 | Accepted | s=input()
for i in range(200):
s=s[0:len(s)-1]
if len(s)%2==1:
continue
if s[0:len(s)//2]*2==s:
print(len(s))
exit() |
p03860 | s604716084 | Accepted | #Beginner 048 A
S = str(input())
print("A"+S[8]+"C") |
p02661 | s991728950 | Accepted | n=int(input())
a,b=[0]*n,[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
a.sort()
b.sort()
if n&1:
print(b[n//2]-a[n//2]+1)
else:
print(1+(b[n//2]+b[(n-1)//2])-(a[n//2]+a[(n-1)//2]))
|
p02556 | s614067214 | Accepted | def main():
n = int(input())
z = []
w = []
for _ in range(n):
x,y = tuple(map(int,input().split()))
z.append(x+y)
w.append(x-y)
print(max(max(z)-min(z),max(w)-min(w)))
if __name__ == "__main__":
main() |
p02823 | s144635112 | Accepted | import sys
input = sys.stdin.readline
def main():
N, A, B = map(int, input().split())
if (B - A) % 2 == 0:
ans = (B - A) // 2
else:
a = (A - 1) + 1 + ((B - ((A - 1) + 1)) - 1) // 2
b = (N - B) + 1 + (N - (A + ((N - B) + 1))) // 2
ans = min(a, b)
print(ans)
if __nam... |
p03220 | s174536323 | Wrong Answer | n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
num=0
dist=abs(a-(t-h[0]*0.006))
for i in range(1,n):
if dist>abs(a-(t-h[i]*0.006)):
num=i
print(num+1)
|
p04045 | s866446573 | Accepted | n, k = map(int, input().split())
d = set(map(int, input().split()))
d ^= {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}
while True:
if d >= set(map(int, list(str(n)))):
print(n)
break
n += 1
|
p03328 | s824282418 | Accepted | a,b = [int(x) for x in input().split()]
dif = b - a
org = sum([x for x in range(1,dif)])
print(org-a) |
p03293 | s819526086 | Accepted | S = input()
T = input()
for i in range(len(T)):
S = S[-1] + S[0:-1]
if S == T:
print("Yes")
break
else:
print("No") |
p02935 | s206699068 | Wrong Answer | import heapq
n = raw_input()
heap = [x*(-1) for x in map(float, raw_input().split(' '))]
heapq.heapify(heap)
while(len(heap)>1):
u,v = heapq.heappop(heap), heapq.heappop(heap)
u*=-1
v*=-1
w = 0.5*(u+v)
heapq.heappush(heap, -w)
print -heap[0] |
p03001 | s624566357 | Wrong Answer | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
W, H, x, y = list(map(float, sys.stdin.buffer.readline().split()))
ret = (W * H) / 2
p = x == W//2 and y == H//2
print(ret, 1 if p else 0)
if __name__ == '__main__':
main()
|
p03745 | s245531112 | Accepted | from collections import deque
n=int(input())
a=list(map(int,input().split()))
cnt=0
judge=[]
for i in range(n-1):
if a[i]<a[i+1]:
flag=0
elif a[i]>a[i+1]:
flag=1
elif a[i]==a[i+1]:
continue
if judge==[]:
judge.append(flag)
else:
ff=judge.pop()
if flag... |
p02691 | s502233228 | Accepted | from collections import defaultdict
dd = defaultdict(int)
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N):
dd[i+1-A[i]] += 1
ans = 0
for i in range(N-1):
ans += dd[A[i]+i+1]
dd[i+1-A[i]] -= 1
print(ans) |
p03329 | s249131365 | Accepted | N = int(input())
def fn(n, a):
res = 0
while n > 0:
res += n % a
n = n // a
return res
ans = 1 << 60
for i in range(0, N+1):
tmp = fn(i, 6) + fn(N - i, 9)
ans = min(ans, tmp)
print(ans)
|
p03672 | s157804769 | Accepted | s = input()
flag = -1
k = -1
for i in range(len(s)):
flag += 1
k += 1
a = s[0:(len(s)-k)//2]
b = s[(len(s)-k)//2:(len(s)-k)]
if a == b:
if flag != 0:
print(len(a)+len(b))
break |
p02880 | s647667991 | Wrong Answer | N = int(input())
flg = 0
for i in range(1,9):
for j in range(1,9):
if i*j==N:
flg = 1
if flg == 1:
print("Yes")
else:
print("No")
|
p02838 | s663896487 | Wrong Answer | n=int(input())
mod=10**9+7
l=list(map(int,input().split()))
d=len(str(bin(max(l))))-2
ll=[[0,0] for i in range(d)]
ans=0
for i in l:
f=bin(i)[2:]
for v in range(len(f)):
ll[-1-v][int(f[v])]+=1
for i,(a,s) in enumerate(ll):
ans+=pow(2,i,mod)*a*s%mod
ans%=mod
print(ans)
|
p02778 | s837707024 | Accepted | s = input()
l = ['x' for i in range(len(s))]
print(''.join(l))
|
p03419 | s923555941 | Accepted | N,M = map(int,input().split())
if N==1 and M==1:
print(1)
elif (N>=1 and M==2) or (N==2 and M>=1):
print(0)
elif (N==1 and M>=3) or (N>=3 and M==1):
print(max(N,M)-2)
elif N>=3 and M>=3:
print((N-2)*(M-2)) |
p03000 | s704743329 | Accepted | # ABC 130: B – Bounding
N, X = map(int, input().split())
L = [int(s) for s in input().split()]
D = [0]
for i in range(N):
D.append(D[i] + L[i])
print(len([d for d in D if d <= X])) |
p02773 | s504006740 | Wrong Answer | import collections
N=int(input())
S=[]
for i in range(N):
s=str(input())
S +=[s]
T=collections.Counter(S)
P=list(T.keys())
Q=list(T.values())
for i in range(len(P)):
if Q[i]==max(Q):
print(P[i]) |
p03555 | s839584674 | Accepted | data1 = input()
data2 = input()
count = 3 -1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
if data1[i] == data2[j]:
sw += 1
i += 1
j -= 1
if sw == 3:
print("YES")
else:
print("NO") |
p03557 | s088020640 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
ans = 0
for a in A:
B_a = [b > a for b in B]
for b in B_a:
C_b = [c > b for c in C]
ans += len(C_b)
print(ans) |
p03557 | s461597548 | Wrong Answer | #!/usr/bin/env python3
from itertools import product, permutations, combinations
N=int(input())
A=sorted(list(map(int, input().split())), reverse=True)
B=sorted(list(map(int, input().split())), reverse=True)
C=sorted(list(map(int, input().split())), reverse=True)
ret = 0
for i in C:
if i <= B[0]:
break
... |
p03555 | s976532104 | Accepted | s=input()
t=input()
if s==(t[::-1]) and t==(s[::-1]):
print("YES")
else:
print("NO") |
p03479 | s984843725 | Wrong Answer | import math
X, Y = map(int, input().split())
ans = math.floor(math.log2(Y/X))
if ans == 0:
print(0)
else:
print(ans+1) |
p03136 | s290699920 | Accepted | n = int(input())
l_ls = list(map(int,input().split()))
l_ls.sort()
s_len = 0
for i in range(n-1):
s_len += l_ls[i]
if s_len > l_ls[-1]:
print('Yes')
else:
print('No') |
p03852 | s171642759 | Accepted | c = input()
list = 'aeiou'
if c in list:
print('vowel')
else:
print('consonant') |
p02621 | s202100063 | Accepted | a = int(input())
sum_a = a + a**2 + a**3
print(sum_a) |
p02880 | s235488812 | Accepted | N = int(input())
if N > 81:
print('No')
ans_list = []
if N <= 81:
for i in range(1,10):
for j in range(1,10):
ans_list.append(i * j)
if N in ans_list:
print('Yes')
if N not in ans_list:
print('No') |
p02556 | s429334354 | Accepted | N = int(input())
A = []
B = []
for _ in range(N):
x, y = map(int, input().split())
A.append(x+y)
B.append(x-y)
A.sort()
B.sort()
print(max(A[N-1]-A[0],abs(B[N-1]-B[0]))) |
p03281 | s919771618 | Accepted | n = int(input())
def judge(x):
i = 1
ans = 0
while i*i < x:
if x%i == 0:
ans+=1
if (x//i)*i == x:
ans += 1
i+=1
if ans == 8:
return True
else:
return False
ans = 0
for i in range(1,n+1,2):
if judge(i):
ans += 1
p... |
p03150 | s494800693 | Accepted | S = input()
target = 'keyence'
if target in S:
print('YES')
exit()
l = 0
r = 0
while S[l] == target[l]:
l += 1
while S[len(S)-r-1] == target[6-r]:
r += 1
if l + r >= 7:
print('YES')
else:
print('NO') |
p02996 | s562129561 | Accepted | n = int(input())
task = []
for _ in range(n):
a, b = map(int, input().split())
task.append((b, a))
task.sort()
time = 0
for b, a in task:
time += a
if time > b:
print("No")
quit()
print("Yes") |
p02748 | s465648237 | Wrong Answer | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
min_a = min(a)
min_b = min(b)
for k in range(M):
x, y, c = map(int, input().split())
ans = min((min_a + min_b), ((a[x - 1] + b[y - 1]) - c))
print(ans) |
p03612 | s398400144 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
i=0
ans =0
while i<n-1:
if p[i]==i+1 or p[i+1]==i+2:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
i+=1
print(ans)
|
p03456 | s366817800 | Wrong Answer | import numpy as np
a, b= map(str, input().split())
ab = int(a+b)
c = 4
d = -1
print(ab)
while np.power(c, 2) < ab + 1:
if np.power(c, 2) != ab:
c += 1
else:
d = np.power(c, 2)
break
if d != -1:
print('Yes')
else:
print('No') |
p03071 | s757120305 | Accepted | A, B = map(int, input().split())
if A>=B+1:
print(2*A-1)
elif A+1<=B:
print(2*B-1)
elif A==B:
print(2*A) |
p02664 | s646288220 | Accepted | T = input()
print(T.replace('?', 'D'))
|
p03323 | s855906954 | Accepted | a,b=map(int,input().split())
if a<=8 and b<=8:
print("Yay!")
else:
print(":(") |
p02971 | s559234555 | Accepted | import numpy as np
N = int(input())
A = []
for _ in range(N):
A.append(int(input()))
my_max = np.max(np.array(A))
max_count = np.count_nonzero(A == my_max)
if max_count > 1:
[print(my_max) for _ in range(N)]
else:
my_next_max = np.max(np.array([a for a in A if a != my_max]))
[print(my_max) if a != my_... |
p02948 | s367249680 | Wrong Answer | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
chk = []
for i in range(n):
a,b = map(int,input().split())
if a <= m:
chk.append((a,b))
from operator import itemgetter
chk = sorted(chk,key=itemgetter(0),reverse=True)
chk = sorted(chk,key=itemgetter(1),reverse=True)
from collections im... |
p02694 | s747252481 | Wrong Answer | n=int(input())
a=100
for i in range(10**18):
a+=int(a/100)
if a>=n:
print(i+1)
exit() |
p02971 | s404735137 | Wrong Answer | n = int(input())
h = []
for i in range(n):
h.append(int(input()))
h_sort = sorted(h, reverse=True)
for i in range(n):
if h[i] == h_sort[0]:
print(h[1])
else:
print(h[0]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.