problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03387 | s256587525 | Wrong Answer | a = list(map(int,input().split()))
a.sort()
count= 0
sum = a[2]-a[1]
for i in range(a[2]-a[1]):
a[1] += 1
a[0] += 1
for i in range(10**12):
a[0] += 2
count += 1
if a[0] >= a[1]:
break
if a[0] == a[1]:
print(sum + count)
elif a[0] > a[1]:
print(sum + count + 1)
|
p03239 | s921514341 | Wrong Answer | n,t=map(int,input().split())
be=1001
ans=""
for _ in range(n):
c,time=map(int,input().split())
if time<=t:
be=min(be,time)
ans=c
if be==1001:
print("TLE")
else:
print(ans) |
p04045 | s262602436 | Accepted | n,k=map(int,input().split())
a=list(input().split())
ans=0
for i in range(n,100001):
cnt=list(str(i))
for j in range(len(cnt)):
if cnt[j] in a:
ans=1
break
if ans==0:
print(i)
exit()
else:
ans=0
continue
|
p03548 | s402182384 | Accepted | # -*- coding: utf-8 -*-
X, Y, Z = map(int, input().split())
used_space = Y + (Z * 2)
ans = 0
while True:
if used_space > X:
break
used_space = used_space + Y + Z
ans += 1
print(ans) |
p03633 | s672413314 | Wrong Answer | from fractions import gcd
import sys
input = sys.stdin.readline
n = int(input())
ans = 1
for _ in range(n):
t = int(input())
ans *= int(t/gcd(ans, t))
print(ans) |
p02987 | s266206575 | Accepted | S = input()
# S_0 = S_1 かつ S_2 = S_3
# S_0 = S_2 かつ S_1 = S_3
# S_0 = S_3 かつ S_1 = S_2
# S_0 = S_1 = S_2 = S_3 を除外
if S[0] == S[1] == S[2] == S[3]: print('No')
else:
if (S[0] == S[1] and S[2] == S[3]) or (S[0] == S[2] and S[1] == S[3]) or (S[0] == S[3] and S[1] == S[2]): print('Yes')
else: print('No') |
p02546 | s183098961 | Accepted | s = list(input())
if s[-1] == "s":
s.append("es")
else:
s.append("s")
S = "".join(s)
print(S)
|
p02789 | s778734386 | Accepted | a, b = map(int, input().split())
print('Yes' if a is b else 'No')
|
p02923 | s216298103 | Accepted | N = int(input())
H = list(map(int,input().split()))
#height = H[0]
index = 0
maximum = 0
for i in range(1,N):
if H[i-1] < H[i]:
maximum = max(maximum,i-1-index)
index = i
elif i == N-1:
maximum = max(maximum,i-index)
print(maximum) |
p02664 | s090312728 | Accepted | l = list(input())
n = len(l)
ans = 0
for i in reversed(range(n)):
if l[i] == '?':
if not i==0:
if l[i-1]=="P":
l[i] = "D"
continue
if not i==n-1:
if l[i+1] == "D":
l[i] = "P"
continue
l[i] = "D"
print("".join(l)) |
p02779 | s219505322 | Accepted | n = int(input())
a = list(map(int, input().split()))
set_a = list(set(a))
if( len(a) == len(set_a)):
print('YES')
else:
print('NO') |
p03250 | s755352829 | Wrong Answer | a,b,c = map(int, raw_input().split())
print max(10*a + b, 10*b + c) |
p04020 | s527417305 | Accepted | N = int(input())
Ls,L = [],[]
for i in range(N):
A = int(input())
if A==0:
Ls.append(L)
L = []
else:
L.append(A)
Ls.append(L)
out = 0
for L in Ls:
out += sum(L)//2
print(out)
|
p02948 | s451473436 | Accepted | import heapq
n, m = map(int, input().split())
l = [[] for _ in range(m)]
for i in range(n):
a, b = map(int, input().split())
if a <= m:
l[a-1].append(b)
a = []
ans = 0
for i in range(m):
for j in l[i]:
heapq.heappush(a, (-1) * j)
if a:
ans += heapq.heappop(a) * (-1)
print(ans)
|
p02848 | s397485381 | Accepted | N=int(input())
S=input()
a=['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']
ans=''
for i in (S):
num=a.index(i)+N
if(num>25):
num-=26
ans+=a[num]
print(ans) |
p03986 | s384233544 | Wrong Answer | x = list(input())
while x[0:int(len(x)/2)] != ['T'] * int(len(x)/2):
for i in range(len(x)-1):
if x[i] == 'S' and x[i+1] == 'T':
x[i], x[i+1] = '', ''
x.remove('')
print(len(x)) |
p02802 | s036304689 | Accepted | n, m = map(int, input().split())
sac = set()
lwa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p) - 1
if p in sac:
continue
elif s == 'AC':
sac.add(p)
else:
lwa[p] += 1
print(len(sac), sum(lwa[p] for p in sac)) |
p03455 | s532550508 | Wrong Answer | a, b = map(int, input().split())
def answer(a: int, b: int) -> str:
if (a * b) % 2 != 0:
return 'Even'
else:
return 'Odd'
print(answer(a, b)) |
p02628 | s647982168 | Accepted | N,K=map(int,input().split())
P=list(int(x) for x in input().split())
list.sort(P)
sum=0
for i in range(K):
sum+=P[i]
print(sum) |
p03719 | s734711599 | Accepted | A, B, C = map(int,input().split())
if B >= C >= A:
print("Yes")
else:
print("No") |
p02720 | s977052579 | Accepted | K=int(input())
A = [[] for j in [0]*(10**5)]
A[0]=[1,2,3,4,5,6,7,8,9]
B=9
C=0
while B<=K:
for i in range(len(A[C])):
if A[C][i]%10>0:
A[C+1].append(A[C][i]*10+(A[C][i]%10)-1)
A[C+1].append(A[C][i]*10+(A[C][i]%10))
if A[C][i]%10<9:
A[C+1].append(A[C][i]*10+(A[C][i]%10)+1)
B+=len(A[C+1])
C+=1
print(A[C][len(A[C])-B+K-1])
|
p03106 | s487005170 | Accepted | A,B,K = map(int,input().split())
def cf(x1,x2):
cf=[]
for i in range(1,min(x1,x2)+1):
if x1 % i == 0 and x2 % i == 0:
cf.append(i)
return cf
print(cf(A,B)[-(K)]) |
p03481 | s596276424 | Wrong Answer | X,Y=map(int,input().split())
import math
print(int(math.log2(Y/X))+1) |
p02791 | s973950035 | Accepted | # coding: utf-8
N = int(input())
P = list(map(int, input().split()))
mini = N + 1
cnt = 0
for p in P:
if p <= mini:
mini = p
cnt += 1
print(cnt)
|
p02973 | s505700625 | Accepted | import sys
from bisect import bisect_right, bisect_left
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(int(readline()) for _ in range(N))
LIS = [INF]*N
A.reverse()
for a in A:
i = bisect_right(LIS,a)
LIS[i] = a
print(bisect_left(LIS, INF))
if __name__ == '__main__':
main()
|
p03386 | s108818548 | Accepted | A, B, K = map(int, input().split())
ans1 = list(range(A, B + 1)[:K])
ans2 = list(range(A, B + 1)[-K:])
for i in sorted(set(ans1 + ans2)):
print(i)
|
p03250 | s345532606 | Accepted | A = list(map(int, input().split()))
A.sort()
print(A[0]+A[1]+10*A[2]) |
p02723 | s879662737 | Accepted | s = input()
if s[2] == s[3] and s[4] == s[5]:
print('Yes')
else:
print('No')
|
p03607 | s685862210 | Accepted | n = int(input())
d = {}
for i in range(n):
temp = "key" + input()
if temp in d:
del d[temp]
else:
d[temp] = 1
ans = 0
for i in d:
ans += d[i]
print(ans) |
p02952 | s242635005 | Accepted | N = int(input())
keta = len(str(N))
cnt = 0
for i in range(1,keta,2):
cnt += 9 * (10**(i-1))
if keta % 2 == 1:
cnt += N - (10**(keta-1)) + 1
print(cnt) |
p03627 | s859009160 | Wrong Answer | from collections import Counter
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
ans = []
N = 0
b = ""
for i in a:
if b == "":
b = i
N += 1
elif b == i:
N += 1
else:
if N >= 4:
print(b**2)
exit()
elif N >= 2:
ans.append(b)
b,N = i, 1
if len(ans) == 2: break
if N >= 2: ans.append(b)
print(ans[0]*ans[1] if ans else 0) |
p02639 | s435264461 | Wrong Answer | a = list(map(int, input().split()))
print(a.index(0)) |
p02787 | s020297949 | Wrong Answer | import bisect
H,N = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()] for _ in range(N)]
dp = [[10**18]*10**5 for _ in range(N+1)]
for i in range(N+1):
dp[i][0]=0
mi=10**9
for i in range(N):
for w in range(10**5):
dp[i+1][w]=min(dp[i+1][w],dp[i][w])
if w-AB[i][1]>=0:
dp[i+1][w]=min(dp[i+1][w],dp[i + 1][w - AB[i][0]] + AB[i][1])
for i in range(H,10**5):
mi = min(mi,dp[N][i])
print(mi)
|
p03069 | s566287696 | Accepted | n=int(input())
a=list(map(lambda x:1 if "#"==x else 0,list(input())))
mn=n-sum(a)
s=mn
for i in a:
if i:
s+=1
else:
s-=1
mn=min(mn,s)
print(mn) |
p03804 | s225650796 | Wrong Answer | n, m = map(int, input().split())
a = []
b = []
for _ in range(n):
a.append(list(input()))
for _ in range(m):
b.append(list(input()))
c = n - m + 1
for i in range(c):
for j in range(c):
flag = True
for p in range(m):
for q in range(m):
if a[i+p][j+q] != b[p][q]:
flag = False
if flag == True:
break
if flag:
print("Yes")
else:
print("No") |
p02743 | s334549929 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
from decimal import *
a,b,c = map(int, input().split())
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a + b < c:
print("Yes")
else:
print("No") |
p02658 | s171400988 | Wrong Answer | n = int(input())
A = map(int,input().split())
ans = 1
for num in A:
ans*=num
if (ans > 10^18):
ans = -1
print(ans) |
p02759 | s886583010 | Accepted | import math
n = int(input())
print(math.floor((n+1)/2)) |
p03761 | s392065030 | Accepted | from itertools import groupby, accumulate, product, permutations, combinations
from collections import Counter
def solve():
N = int(input())
dics = [[0]*N for _ in range(26)]
S = [input() for _ in range(N)]
for i in range(N):
for s in S[i]:
dics[ord(s)-ord('a')][i]+=1
ans = ''
for i in range(26):
ans += chr(i+ord('a'))*min(dics[i])
return ans
print(solve())
|
p02689 | s403376056 | Accepted | # C - Peaks
N, M = map(int, input().split())
H = list(int(x) for x in input().split())
G = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
ans = [1] * N
for i in range(N):
for j in G[i]:
if H[i] <= H[j]:
ans[i] = 0
break
print(sum(ans)) |
p02717 | s133366194 | Accepted | a, b, c = map(int, input().split())
hoge = a
a = b
b = hoge
hoge = a
a = c
c = hoge
print(a,b,c) |
p04011 | s895639700 | Accepted | n = [int(input()) for _ in range(4)]
if n[0]<=n[1]:
print(n[0]*n[2])
else:
print((n[1]*n[2])+(n[0]-n[1])*n[3]) |
p02792 | s433858544 | Wrong Answer | n = int(input())
t = [0] * 100
for i in range(11, 100):
msb = i // 10
lsb = i % 10
if lsb == 0:
continue
for j in range(1, n+1):
if j % 10 == lsb and int(str(j)[0]) == msb:
t[i] += 1
ans = 0
for i in range(11, 100):
msb = i // 10
lsb = i % 10
if lsb == 0:
continue
if msb == lsb:
ans += t[i] * (t[i] - 1) // 2
else:
ans += t[i] * t[lsb * 10 + msb]
print(ans) |
p03328 | s918140703 | Wrong Answer | a, b = map(int, input().split())
x = 0
for i in range(1000000):
x += i
if x > a:
x
break
print(x-a) |
p02780 | s744132561 | Accepted | n, k = map(int, input().split())
dat = list(map(int, input().split()))
dat2 = []
m = -1
#print(dat[:k])
n = sum(dat[:k])
dat2.append(n)
m = n
mind = 0
for i in range(1, len(dat) - k ):
#print("in/out")
#print(dat[k+i])
#print(dat[i])
n += dat[k+i]
n -= dat[i]
dat2.append(n)
if n > m:
m = n
mind = i + 1
#print(dat2)
#print(m)
#print(mind)
r = 0
for i in range(mind, mind + k):
r += (dat[i] + 1) / 2
print(r)
|
p03434 | s837516151 | Accepted | N = int(input())
a = []
a = input().split(' ')
a = [int(i) for i in a]
a = sorted(a, reverse=True)
Alice = 0
Bob = 0
for i in range(N):
if i == 0:
Alice += a[i]
elif i%2 == 0:
Alice += a[i]
elif i%2 == 1:
Bob += a[i]
print(Alice - Bob) |
p04031 | s848696382 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=100000
for i in range(-100,101):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
if tmp<ans:
ans=tmp
print(ans) |
p02790 | s740623976 | Wrong Answer | # coding:utf-8
ab=0
ba=0
a,b=map(int,input().split())
ab=str(a)*b
ba=str(b)*a
print(min(int(ab),int(ba))) |
p02983 | s303548814 | Accepted | L, R = map(int, input().split())
mod = 2019
if R - L >= 2019 or L == 0:
print(0)
else:
ans = False
for i in range(R - L):
for j in range(i + 1, R - L + 1):
if ans is not False:
ans = min(ans, (L + i) * (L + j) % mod)
else:
ans = (L + i) * (L + j) % mod
print(ans) |
p03077 | s953165050 | Accepted | from math import ceil
N, *A= [int(input()) for _ in range(6)]
print(ceil(N/min(A))+4) |
p02595 | s790817093 | Accepted | n, d = map(int, input().split())
x_y = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for x, y in x_y:
dist = (x*x+y*y)**.5
if dist <= d:
ans += 1
print(ans) |
p03221 | s924467258 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
N,M=map(int,input().split())
l=[None]*M
for i in range(M):
P,Y=map(int,input().split())
l[i]=(P,Y,i)
l.sort()
a=[None]*M
s=0
t=1
for i in l:
if i[0]==s:
t+=1
else:
t=1
s=i[0]
a[i[2]]="{:06d}".format(i[0]) + "{:06d}".format(t)
print(*a,sep="\n") |
p03565 | s231174709 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
s = input()
t = input()
ans = []
for i in range(len(s) - len(t) + 1):
for j in range(len(t)):
if s[i + j] not in ('?', t[j]):
break
else:
memo = s[:i] + t + s[i + len(t):]
ans.append(memo.replace('?', 'a'))
if ans:
print(min(ans))
exit()
print('UNRESTORABLE')
|
p03163 | s452476504 | Wrong Answer | N,W = map(int,input().rstrip().split(" "))
wv = [[0,0,0] for _ in range(N)]
ans = [0,0]
for i in range(N):
p = list(map(int,input().rstrip().split(" ")))
wv[i][1] = p[0]
wv[i][2] = p[1]
wv[i][0] = p[1] / p[0]
wv.sort()
wv.reverse()
for i in range(N):
if wv[i][1] + ans[0] < W:
ans[0] += wv[i][1]
ans[1] += wv[i][2]
print(ans[1]) |
p02862 | s716105535 | Accepted | x, y = map(int, input().split())
a = (2 * x - y) // 3
b = (2 * y - x) // 3
rent_a = (2 * x - y) % 3
rent_b = (2 * y - x) % 3
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
if a < 0 or b < 0:
ans = 0
elif rent_a != 0 or rent_b != 0:
ans = 0
else:
n = a + b
ans = combination(n, a)
print(ans) |
p03797 | s855705783 | Accepted | S,C=map(int,input().split())
ANS = 0
if S * 2 <= C:
ANS = S
C -= (S*2)
#rint(C)
ANS += (C//4)
print(ANS)
else:
ANS = C // 2
print(ANS) |
p03241 | s823388203 | Wrong Answer | n,m=map(int,input().split())
for i in range(1,int(m**.5)+2)[::-1]:
if m%i==0 and m/n>=i:print(i);break |
p02570 | s769710783 | Wrong Answer | d,t,s=map(int,input().split())
if 1000/t>s:
print('No')
else:
print('Yes') |
p03485 | s969615157 | Accepted | import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2)) |
p03239 | s241965819 | Accepted | n,t = map(int, input().split())
a = []
for i in range(n):
aa = list(map(int, input().split()))
a.append(aa)
cost = float(10000)
for a in a:
if a[1] <= t and a[0] < cost:
cost = a[0]
if cost == 10000:
cost = 'TLE'
print(cost)
|
p02787 | s468092578 | Accepted | import sys
input=sys.stdin.buffer.readline
H,N = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(N)]
dp = [10000000000]*(H+1)
dp[0] = 0
for i in range(1,H+1):
for j in range(N):
A = ab[j][0]
B = ab[j][1]
if i - A < 0:
dp[i] = min(dp[i],dp[0]+B)
else:
dp[i] = min(dp[i],dp[i-A]+B)
print(dp[H]) |
p03150 | s181375634 | Accepted | S = input()
s = "keyence"
ans = "NO"
for i in range(len(S)):
if s == S[:i] + S[len(S)-len(s)+i:]:
ans = "YES"
print(ans) |
p02791 | s183920106 | Accepted | N = int(input())
P = list(map(int,input().split()))
min = P[0]
cnt = 1
for i in range(1,N):
if min > P[i]:
min = P[i]
cnt +=1
else:
min = min
print(cnt)
|
p03293 | s716736378 | Wrong Answer | S = input()
T = input()
l = len(S)
count = 0
for i in range(l):
for j in range(l):
if i+j >= l:
if S[i+j-l] == T[j]:
count += 1
else:
break
else:
if S[i+j] == T[j]:
count += 1
else:
break
if count == l:
print('Yes')
exit()
print('No') |
p02641 | s864511551 | Accepted | x,y=map(int,input().split())
if y==0:print(x);exit()
l=list(map(int,input().split()))
work=x
if not work in l:
print(work)
exit()
i=1
while 1:
if not work-i in l:
print(work-i)
exit()
if not work+i in l:
print(work+i)
exit()
i+=1 |
p03219 | s807957953 | Accepted | a,b = map(int,input().split())
print(a+(b//2)) |
p02700 | s341543307 | Accepted | heart_taka, power_taka, heart_aoki, power_aoki = map(int, input().split())
aliveTaka = True
aliveAoki = True
while (aliveTaka) and (aliveAoki):
heart_aoki -= power_taka
heart_taka -= power_aoki
if heart_aoki <= 0:
aliveAoki = False
if heart_taka <= 0:
aliveTaka = False
if aliveAoki == False:
print("Yes")
else:
print("No")
|
p02712 | s629680706 | Accepted | N=int(input())
ans = 0
for i in range(1,N+1):
if i%3==0 or i%5==0:
continue
ans += i
print(ans) |
p03457 | s454230506 | Accepted | n = int(input())
txy = [list(map(int, input().split())) for i in range(n)]
T, X, Y = 0, 0, 0
result = "Yes"
for t, x, y in txy:
d = (x-X) + (y-Y)
if t<d or (t-d)%2==1:
result = "No"
break
print(result) |
p02659 | s171932463 | Accepted | import math
from decimal import Decimal, ROUND_DOWN
def main():
a,b = list(input().split())
a = Decimal(a)
b = Decimal(b)
ans = a * b
print(Decimal(ans).quantize(Decimal(1), rounding=ROUND_DOWN))
if __name__=='__main__':
main()
|
p02792 | s918927310 | Accepted | def main():
n = int(input())
dp = [[0 for i in range(10)] for i in range(10)]
for i in range(1,n+1):
h,t = int(str(i)[0]), int(str(i)[-1])
dp[h][t] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += dp[i][j] * dp[j][i]
print(ans)
if __name__ == "__main__":
main()
|
p03293 | s172902459 | Wrong Answer | S=input()
T=input()
for i in range(len(S)):
if S==T:
print("Yes")
exit()
temp=S[-1]
S=temp+S[0:4]
print("No")
|
p02690 | s657427154 | Wrong Answer | X = int(input())
# for b in range(65, -64, -1):
for b in range(10000, -10000, -1):
a = (X + b**5)**0.2
# print('b a', b, a)
if type(a) == complex:
continue
if a.is_integer():
print(int(a), b)
exit()
|
p02779 | s642548531 | Wrong Answer | from collections import Counter
input()
lst = input().split()
dic = dict(Counter(lst))
x = max(list(dic.values())) - 1
if x:
print('No')
else:
print('Yes') |
p03493 | s661647203 | Wrong Answer | print int(input())%9 |
p03210 | s600663726 | Accepted | x = int(input())
if x ==7 or x == 5 or x == 3:
print('YES')
else:
print('NO') |
p02729 | s039071149 | Accepted | n, m = map(int, input().split())
total = (n+m) * (n+m-1) / 2
odd = n * m
result = int(total - odd)
print(result)
|
p02678 | s101686293 | Accepted | from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
edges = [[]for _ in range(n)]
for _ in range(m):
a, b = map(lambda x: int(x)-1, input().split())
edges[a].append(b)
edges[b].append(a)
next_v = deque([0])
prev = [-1]*n
while next_v:
v = next_v.popleft()
for v2 in edges[v]:
if prev[v2] != -1:
continue
prev[v2] = v+1
next_v.append(v2)
print('Yes')
for x in prev[1:]:
print(x)
|
p02899 | s705873506 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int,input().split()))
print(np.argsort(A) + 1) |
p02725 | s312695176 | Accepted | K,N=map(int, input().split())
As=list(map(int, input().split()))
ans=K
m=0
for i in range(len(As)-1):
if As[i+1]-As[i] > m:
m=As[i+1]-As[i]
if As[0]+K-As[-1]>m:
m=As[0]+K-As[-1]
print(ans-m) |
p02624 | s650243205 | Accepted | n=int(input())
dp=[0 for _ in range(n+1)]
for j in range(1,n+1):
i = 1
while j*i<=n:
dp[j*i] += j*i
i+=1
print(sum(dp)) |
p02767 | s519285476 | Accepted | n = list(map(int, input().split()))[0]
x = list(map(int, input().split()))
m = 1000000009
for i in range(100):
sum = 0
for j in range(len(x)):
sum += (i - x[j]) ** 2
m = min([m, sum])
print(m) |
p02854 | s749347961 | Accepted | n = int(input())
A = []
B = list(map(int, input().split()))
sum_b = sum(B)
left = 0
for i in range(n-1):
left += B[i]
right = sum_b - left
A.append(abs(right - left))
print(min(A)) |
p03042 | s117273025 | Wrong Answer | S = input()
if int(S[:2]) == 0 or int(S[3:]) ==0:
print('NA')
elif int(S[:2]) > 12 and int(S[3:]) >12:
print('NA')
elif int(S[:2]) > 12 and int(S[3:]) <=12:
print('YYMM')
elif int(S[:2]) <= 12 and int(S[3:]) >12:
print('MMYY')
elif int(S[:2]) <= 12 and int(S[3:]) <= 12:
print('AMBIGUOUS') |
p03705 | s664367012 | Accepted | N, A, B = map(int, input().split())
if A > B:
print(0)
exit()
if N == 1:
if A == B:
print(1)
exit()
else:
print(0)
exit()
print((N-2)*(B-A)+1) |
p02646 | s908893234 | Wrong Answer | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V-W <= 0:
print("NO")
elif B-A <= 0:
print("NO")
else:
if ((B-A)/(V-W)) <= T:
print("YES")
else:
print("NO") |
p02600 | s034953350 | Accepted | x=int(input())
if 400<=x<=599:
a=8
elif 600<=x<=799:
a=7
elif 800 <= x <= 999:
a = 6
elif 1000 <= x <= 1199:
a = 5
elif 1200 <= x <= 1399:
a = 4
elif 1400 <= x <= 1599:
a = 3
elif 1600 <= x <= 1799:
a = 2
elif 1800 <= x <= 1999:
a = 1
print(a) |
p02554 | s266319777 | Wrong Answer | import math
n=int(input())
y=pow(10,n)-100*(pow(9,n-1))
y=y%(pow(10,9)+7)
print(y) |
p02577 | s060901622 | Accepted | n = input()
ans = 0
for nn in n:
ans += int(nn)
print('Yes') if ans%9 == 0 else print('No') |
p02556 | s026044848 | Accepted |
n=int(input())
lx=[]
ly=[]
for i in range(n):
x,y=map(int,input().split())
lx.append(x+y)
ly.append(x-y)
ax,bx,ay,by=max(lx),min(lx),max(ly),min(ly)
print(max(ax-bx,ay-by))
|
p02582 | s491639378 | Accepted | S = input()
s = list(S)
if S == "RSR":
print(1)
else:
print(s.count('R')) |
p02602 | s868061834 | Accepted | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,k=INTM()
A=LIST()
for i in range(n-k):
#print(A[i],A[i+k])
if A[i]<A[i+k]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
do() |
p03417 | s371086344 | Accepted | n, m = map(int, input().split())
if n > m:
n, m = m, n
if n == 1:
if m == 1:
ans = 1
else:
ans = m - 2
else:
ans = (n - 2) * (m - 2)
print(ans) |
p02971 | s159910324 | Accepted | import collections
n = int(input())
a = [int(input()) for i in range(n)]
m = sorted(list(set(a)))
c =collections.Counter(a)
t = [max(a)]*n
if c[max(a)] == 1:
t[a.index(max(a))] = m[-2]
[print(i) for i in t]
|
p02675 | s626067947 | Accepted | n=str(input())
if n[len(n)-1]=="3":
print("bon")
elif n[len(n)-1]=="2" or n[len(n)-1]=="4" or n[len(n)-1]=="5" or n[len(n)-1]=="7" or n[len(n)-1]=="9":
print("hon")
else:
print("pon") |
p03073 | s593992526 | Accepted | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
s = list(map(int, list(input().strip())))
odd1, odd0, even1, even0 = 0, 0, 0, 0
for i in range(len(s)):
if i%2 == 0:
if s[i] == 0:
even0 += 1
else:
even1 += 1
else:
if s[i] == 0:
odd0 += 1
else:
odd1 += 1
print(min(even0+odd1, even1+odd0))
if __name__=='__main__':
main()
|
p02731 | s182335503 | Accepted | l=int(input())
l3=l/3
print(l3*l3*l3) |
p03206 | s395509956 | Accepted | D = int(input())
if D == 25:
a = 'Christmas'
elif D == 24:
a = 'Christmas Eve'
elif D == 23:
a = 'Christmas Eve Eve'
elif D == 22:
a = 'Christmas Eve Eve Eve'
print(a) |
p02726 | s084306901 | Wrong Answer | import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
# n = int(input())
n,x,y = map(int,input().split())
# A = list(map(int,input().split()))
# An = [list(map(int,input().split())) for i in range(n)]
l = np.zeros((n,n))
l[0][1] = 1
l[n-1][n-2] = 1
l[x-1][y-1] = 1
l[y-1][x-1] = 1
for i in range(n-3):
l[i+1][i] = 1
l[i+1][i+2] = 1
for j in range(n-1):
print(np.count_nonzero(shortest_path(l)==j)) |
p03485 | s362903219 | Wrong Answer | a, b = map(int, input().split())
x = a + b
print((x+1)/2) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.