problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03043 | s148323607 | Wrong Answer | n,k = map(int,input().split())
dk = [1,k,float("inf")]
ans = 0
while k > 2:
k /= 2
dk.append(int(-(-k//1)))
dk = sorted(dk)[::-1]
for i in range(len(dk)-1):
num = min(dk[i],n) - dk[i+1] + 1*(min(dk[i],n)==dk[i+1])
if num < 1:
num = 0
ans += num/n * (0.5**i)
print(ans) |
p03624 | s829860801 | Accepted | s=list(input())
l=list(chr(i)for i in range(97,123))
for i in l:
if i not in s:
print(i)
exit()
print('None') |
p03524 | s795084002 | Wrong Answer | s = input()
a = s.count("a")
b = s.count("b")
c = s.count("c")
k = (a > 0) + (b > 0) + (c > 0)
if k == 1:
print("NO")
exit()
if k == 2:
if len(s) == 2:
print("YES")
else:
print("NO")
exit()
minabc = sorted([a, b, c])[0]
a = max(0, a - minabc)
b = max(0, b - minabc)
c = max(0, c - minabc)
# print(a, b, c, k)
if a <= 1 and b <= 1 and c <= 1:
print("YES")
else:
print("NO") |
p02793 | s182311345 | Accepted | import fractions
from functools import reduce
mod = 10**9 + 7
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n = int(input())
a = list(map(int, input().split()))
a_ = []
for i in range(n):
a_.append(pow(a[i], mod - 2, mod))
num_lcm = lcm(*a) % mod
ans = 0
for i in range(n):
ans = (ans + num_lcm * a_[i]) % mod
print(ans) |
p03351 | s649156938 | Wrong Answer | a, b, c, d = map(int, input().split())
if abs(a-b) <= d and abs(b-c) <= d:
print('Yes')
else:
print('No')
|
p02706 | s410398848 | Accepted | N,M = map(int, input().split())
A = list(map(int, input().split()))
S =sum(A)
if N-S >=0:
print(N-S)
else: print("-1") |
p03309 | s427755679 | Accepted | n = int(input().strip())
a = list(map(int, input().split()))
b = [(a[i] - (i + 1)) for i in range(n)]
b.sort()
mid = 0
if n == 1:
mid = b[0]
elif n % 2 == 1:
mid = b[(n - 1) // 2]
else:
mid = (b[(n - 1) // 2] + b[(n - 1) // 2 + 1]) // 2
ans = 0
for i in range(n):
ans += abs(b[i] - mid)
print(ans)
|
p03438 | s398815192 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
k = sum(b) - sum(a)
m = [(max(a[i], b[i])+(a[i]<b[i] and (b[i]-a[i])%2==1)) for i in range(n)]
if k>=0 and sum(a)+2*k>=sum(m) and sum(b)+k>=sum(m):
ans = "Yes"
else:
ans = "No"
print(ans) |
p02570 | s262650157 | Wrong Answer | data=list(map(int,input().split()))
if data[0]/data[1]<=data[2]:
print('yes')
else:
print('No') |
p04034 | s849278069 | Wrong Answer | import sys
input = sys.stdin.readline
n, m = map(int, input().split())
ans = [1] * n
check = [False] * n
check[0] = True
for i in range(m):
x, y = map(int, input().split())
if check[x - 1]:
ans[y - 1] += 1
ans[x - 1] -= 1
check[y - 1] = True
if ans[x - 1] == 0:
check[x - 1] = False
print(check.count(True))
|
p02624 | s990019315 | Accepted | N = int(input())
T = [0]*N
for i in range(1, N+1):
for j in range(i-1, N, i):
T[j]+=1
res = 0
for i in range(i):
k = i+1
res += k*T[i]
print(res) |
p03994 | s021922594 | Accepted | s = input()
K = int(input())
ans = []
for ch in s:
v = ord("a") + 26 - ord(ch)
if ch != "a" and v <= K:
K -= v
ans.append("a")
else:
ans.append(ch)
if K > 0:
ans[-1] = chr(ord(ans[-1]) + K % 26)
print("".join(ans))
|
p02645 | s336731128 | Accepted | S = input()
print(S[:3]) |
p02630 | s026543184 | Accepted | n = int(input())
init = [int(s) for s in input().split()]
a = {}
init_sum = sum(init)
for i in init:
if i not in a:
a[i] = 1
else:
a[i] += 1
q = int(input())
ans = init_sum
for _ in range(q):
(b, c) = [int(s) for s in input().split()]
if b not in a:
a[b] = 0
ans -= (b * a[b])
if c not in a:
a[c] = a[b]
else:
a[c] += a[b]
ans += (c * a[b])
a[b] = 0
print(ans)
|
p02600 | s614605420 | Accepted | rating = int(input())
print(10 - rating // 200) |
p02814 | s965191027 | Accepted | import fractions
from functools import reduce
N,M = map(int,input().split())
A = list(set((map(lambda x : int(x) // 2,input().split()))))
def lcm(a,b):
return (a * b) // fractions.gcd(a, b)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
LCM = lcm_list(A)
ans = (M // LCM + 1) // 2
for a in A[1:]:
if (LCM // a) % 2 == 0:
ans = 0
break
print(ans) |
p02631 | s381970659 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
xor = 0
for a in A:
xor ^= a
for a in A:
for i in range(20):
if xor >> i & 1:
a ^= 1 << i
print(a, "", end="") |
p03206 | s943354974 | Accepted | D=int(input())
if D==25:
print('Christmas')
elif D==24:
print('Christmas Eve')
elif D==23:
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve Eve') |
p03351 | s640604650 | Wrong Answer | a,b,c,d=map(int,raw_input().split())
if c-a < d or a-c<d:
print "Yes"
elif a-b <d or b-a<d and b-c <d or c-b <d:
print "Yes"
else:
print "No" |
p03795 | s174143724 | Wrong Answer | import math
N = int(input())
power = math.factorial(N)
result = power % (pow(10, 9) + 7)
print(result) |
p02760 | s917156278 | Wrong Answer | a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b_list = [int(input()) for _ in range(n)]
card = [[0] * 3 for _ in range(3)]
for i in range(3):
for j in range(3):
if a[i][j] in b_list:
card[i][j] = 1
for i in range(3):
if card[i][:] == [1,1,1] or card[:][i] == [1,1,1]:
print('Yes')
exit()
if sum([card[0][0], card[1][1], card[2][2]]) == 3 or sum([card[0][2], card[1][1], card[2][0]]) == 3:
print('Yes')
exit()
print('No') |
p02922 | s050737696 | Accepted | A, B = map(int, input().split())
for i in range(100):
if 1 + (A-1) * i >= B: break
print(i) |
p03836 | s583690703 | Accepted | import math
a,b,c,d=map(int,input().split())
ans=""
for i in range (c-a):
ans+="R"
for i in range (d-b):
ans+="U"
for i in range (c-a):
ans+="L"
for i in range (d-b):
ans+="D"
ans+="D"
for i in range (c-a+1):
ans+="R"
for i in range (d-b+1):
ans+="U"
ans+="LU"
for i in range (c-a+1):
ans+="L"
for i in range (d-b+1):
ans+="D"
ans+="R"
print(ans) |
p03804 | s152725425 | Accepted | import sys
input = sys.stdin.readline
N, M = map(int, input().split())
a = [list(input())[: -1] for _ in range(N)]
b = [list(input())[: -1] for _ in range(M)]
for i in range(N - M + 1):
for j in range(N - M + 1):
for y in range(M):
for x in range(M):
if a[i + y][j + x] != b[y][x]: break
else: continue
break
else:
print("Yes")
exit(0)
print("No") |
p03206 | s405466872 | Wrong Answer | d = int(input())
if d == 25:
print('Christmas')
elif d == 24:
print('Christmas Eve')
elif d == 23:
print('Chritsmas Eve Eve')
elif d == 22:
print('Christmas Eve Eve Eve') |
p02847 | s766844220 | Accepted | week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", "GOMI"]
d = {v: i for i, v in enumerate(week[::-1])}
print(d[input()]) |
p03146 | s761646605 | Accepted | s=int(input())
a=[]
a.append(s)
k=0
while True:
if a[k]%2==0:a.append(a[k]//2)
else:a.append(3*a[k]+1)
k+=1
for i in range(k):
if a[i]==a[k]:
print(k+1)
exit()
|
p03565 | s141101741 | Wrong Answer | S = input()
T = input()
res = []
ok = -1
for i in range(len(S) - len(T) + 1):
if S[i] == T[0] or S[i] == "?":
for j in range(len(T)):
if S[i + j] not in ("?", T[j]):
break
else:
s = S[:i] + T + S[i + len(T):]
res.append(s.replace("?", "a"))
if res:
print(*res)
else:
print("UNRESTORABLE")
|
p02631 | s321198886 | Accepted | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
n=int(input().rstrip())
a=[int(i) for i in input().split()]
cumxor1=[0]
cumxor2=[0]
ans=[]
for i in a:cumxor1.append(cumxor1[-1]^i)
for i in reversed(a):cumxor2.append(cumxor2[-1]^i)
cumxor2=list(reversed(cumxor2))
for i in range(n):
ans.append(cumxor1[i]^cumxor2[i+1])
print(*ans) |
p02618 | s055572168 | Wrong Answer | D=int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last_day = [0]*26
def calc_sum(day,t,sum):
sum += s[day-1][t-1]
last_day[t-1]=day
for j in range(len(c)):
sum -= c[j]*(day-last_day[j])
return sum
score = 0
for i in range(D):
t = 1
max = 0
for j in range(26):
if(max > calc_sum(i,j,score)):
score = max
t = j
print(t) |
p02773 | s257301349 | Accepted | N = int(input())
S = {}
c = 0
for _ in range(N):
s = input()
if s not in S:
S[s] = 1
else:
S[s] += 1
c = max(c, S[s])
ans = []
for k, v in S.items():
if v == c:
ans.append(k)
ans.sort()
for a in ans:
print(a)
|
p03251 | s105015586 | Accepted | n, m, x, y = map(int, input().split())
x = list(map(int, input().split())) + [x]
y = list(map(int, input().split())) + [y]
if max(x)<min(y):
print('No War')
else:
print('War') |
p02831 | s803830054 | Wrong Answer |
A, B = map(int, input().split())
A_, B_ = A, B
common = 1
n_max = int(min(A,B)**0.5) + 1
for n in range(2, n_max):
while True:
if (A_ % n == 0) and (B_ % n == 0):
common *= n
A_ = A_ // n
B_ = B_ // n
else:
break
print(common* A_ * B_)
|
p03481 | s789103872 | Wrong Answer | from math import log2
X,Y = [int(i) for i in input().split()]
print(int(log2(Y) - log2(X))+1) |
p02983 | s039764584 | Accepted | l,r=map(int,input().split())
if r-l>=2019: print(0)
else:
ans=2018
mod_l=l%2019
mod_r=r%2019
for i in range(min(mod_l,mod_r),max(mod_l,mod_r)+1):
for j in range(i+1,max(mod_l,mod_r)+1):
mod=(i*j)%2019
if mod<ans: ans=mod
print(ans) |
p03680 | s150649774 | Accepted | N = int(input())
A = [int(input()) for _ in range(N)]
pushed = [False] * N
pushed[0] = True
button = 0
count = 0
while True:
count += 1
button = A[button] - 1
if button == 1:
print(count)
exit()
if pushed[button]:
print(-1)
exit()
pushed[button] = True |
p02701 | s364087931 | Wrong Answer | n=int(input())
List = [input() for i in range(n)]
set(List)
print(len(List)) |
p03745 | s251457106 | Wrong Answer | n = int(input())
aa =list(map(int, input().split()))
list1 =[0] * n
list1[0] = 1
if n >1:
list1[1] = 1
for i in range(2,n):
if list1[i-2] == list1[i-1]:
if (aa[i] - aa[i-1]) * (aa[i-1] -aa[i-2]) < 0:
list1[i] = list1[i-1] + 1
else:
list1[i] = list1[i-1]
else:
list1[i] = list1[i-1]
print(list1[n-1]) |
p02836 | s383854015 | 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) |
p02753 | s678915186 | Accepted | s = input()
if "AB" in s or "BA" in s:
print("Yes")
else:
print("No") |
p02578 | s110297204 | Accepted | n=int(input())
arr=list(map(int,input().split()))
ma=0
ans=0
for i in range(1,n):
if arr[i]<arr[i-1]:
ans+=arr[i-1]-arr[i]
arr[i] = arr[i - 1]
print(ans) |
p03455 | s353786709 | Accepted | n = eval(input().replace(" ","*"))
print("Odd" if n%2 else "Even") |
p03323 | s119137229 | Accepted | a,b=map(int,input().split());print(['Yay!',':('][a>8 or b>8]) |
p02631 | s896128949 | Accepted | import sys , math
N = int( input() )
A = list( map( int, input().split() ))
X = A[0]
for i in range(1,N):
X = X ^ A[i]
ans = [ X ^ A[i] for i in range(N) ]
print( *ans ) |
p03319 | s548742085 | Wrong Answer | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
i = A.index(1)
print(math.ceil(i/(K-1))+math.ceil((N-1-i)/(K-1)))
|
p02724 | s817505932 | Accepted | X=int(input())
a=X//500
b=(X%500)//5
print(a*1000+b*5) |
p02957 | s015549579 | Wrong Answer | A, B = map(int, input().split())
if A%B == 0:
print((A + B)//2)
else:
print('IMPOSSIBLE') |
p02677 | s226710209 | Accepted | import math
A,B,H,M = map(int, input().split())
hour = H*0.5*60
mini = M*5.5
d = abs(hour-mini)
ans = A**2 + B**2 - 2 * A * B * math.cos(math.radians(d))
print(math.sqrt(ans)) |
p02820 | s363613679 | Wrong Answer | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = list(input())
for i in range(n-k):
if t[k+i] == t[i]:
t[k+i] == 0
x = t.count("r")*p+ t.count("s")*r+ t.count("p")*s
print(x) |
p02628 | s142904508 | Wrong Answer | N, K = map(int,input().split())
P = list(map(int,input().split()))
P_sorted = sorted(P)
print(P_sorted)
ans = 0
for i in range(K):
ans += P_sorted[i]
print(ans) |
p02989 | s128924303 | Accepted | import os, sys, re, math
N = int(input())
d = [int(n) for n in input().split()]
d = sorted(d)
m1 = d[N // 2 - 1]
m2 = d[N // 2]
print(m2 - m1)
|
p02848 | s712396334 | Wrong Answer | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.buffer.readline())
S = sys.stdin.buffer.readline().decode()
ret = []
for s in S:
n = ord(s) + N
if n > 90:
ret.append(chr(n - 26))
else:
ret.append(chr(n))
print("".join(ret), end="")
if __name__ == '__main__':
main()
|
p03351 | s924066873 | Accepted | a,b,c,d=map(int,input().split())
if abs(a-c)<=d:
print("Yes")
elif abs(a-b)<=d and abs(b-c)<=d:
print("Yes")
else:
print("No") |
p03719 | s845160861 | Accepted | a,b,c = map(int,input().split())
print('Yes' if c >= a and c <= b else 'No')
|
p02641 | s413776162 | Accepted | def solve(x, n, p):
S = set(p)
for d in range(n+1):
for y in [x-d, x+d]:
if not y in S:
return y
x, n = map(int, input().split())
p = list(map(int, input().split()))
print(solve(x, n, p)) |
p02697 | s599210192 | Accepted | n,m = list(map(int,input().split()))
x = n//2
y = n//2+1
temp_used = [0] * (n+1)
for i in range(m):
print("{x} {y}".format(x=x,y=y))
temp_used[y-x]+=1
temp_used[n+x-y]+=1
x-=1
y+=1
if temp_used[y-x]==1 or temp_used[n+x-y]==1 or y-x==n/2:
y+=1
print("") |
p02720 | s427518902 | Wrong Answer | k = int(input())
ans = 0
def lunlun(ans):
a = True
c = len(str(ans))
for i in range(c-1):
r1 = ans % 10
ans = int(ans/10)
r2 = ans % 10
if abs(r1-r2) > 1:
a = False
return a
while k > 0:
ans += 1
if lunlun(ans):
k -= 1
|
p03150 | s773561759 | Wrong Answer | import sys
S = input()
for i in range(len(S)):
print((S[:i]))
for j in range(i,len(S)):
if "keyence" == (S[:i]) + (S[j:]):
print("YES")
sys.exit()
print("NO") |
p02594 | s753867060 | Accepted | X=int(input())
if X>=30:
print("Yes")
else:
print("No") |
p02756 | s948856779 | Accepted | from collections import deque
s = input()
a = deque()
for i in s:
a.append(i)
q = int(input())
rev = 0
for i in range(q):
s = input()
if s[0] == '1':
rev ^= 1
else:
b = (int(s[2]) - 1) ^ rev
if b:
a.append(s[4])
else:
a.appendleft(s[4])
if rev:
a.reverse()
for i in a:
print(i, end="") |
p02606 | s603532777 | Wrong Answer | L,R,d=map(int,input().split())
if R%d!=0:
print(int(R/d)-int(L/d))
else:
print(int(R/d)-int(L/d)+1) |
p02780 | s683511052 | Accepted | n,k = map(int,input().split())
p = list(map(int,input().split()))
ans = sum(p[:k])/2 + k/2
s = ans
for i in range(n-k):
s = s - p[i]/2 + p[i+k]/2
ans = max(ans,s)
print(ans) |
p03105 | s715707808 | Wrong Answer | a,b,c=map(int,input().split())
print(max(c,b//a)) |
p02628 | s834847556 | Wrong Answer | n, k = map(int, input().split())
P = list(map(int, input().split()))
P.sort()
sum(P[0:k]) |
p03695 | s326961963 | Accepted | N = int(input())
A = list(map(int, input().split()))
cnt1 = 0
for i in range(8):
v1 = i * 400
v2 = (i + 1) * 400 - 1
for j in range(N):
if v1 <= A[j] and A[j] <= v2:
cnt1 += 1
break
cnt2 = 0
for i in range(N):
if A[i] >= 3200:
cnt2 += 1
if cnt1 == 0:
print(1, cnt2)
else:
print(cnt1, cnt1 + cnt2)
|
p03815 | s109978428 | Wrong Answer | N = int(input())
num = N // 11
res = 0
k = 0
k = res * 11
if N % 11 == 0:
res = num * 2
else:
res = num * 2 + 1
k += 5
if k < N:
res = num * 2 + 1
k += 6
print(res) |
p02847 | s228344336 | Wrong Answer | a=input()
n=['SUN','MON','TUE','WED','THU','FRI','SAT']
if a!='SAT':
print(7-n.index(a))
else:
print(7) |
p03059 | s049189206 | Wrong Answer | def main():
A, B, T = map(int, input().split())
print(((T+0.5)//A) * B)
return 0
if __name__ == '__main__':
main() |
p03627 | s350068648 | Accepted | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
pair = [0, 0]
dic = defaultdict(int)
for a in A:
if dic[a]:
pair.append(a)
dic[a] = 0
else:
dic[a] = 1
pair.sort()
print(pair[-1] * pair[-2])
if __name__ == '__main__':
main()
|
p02571 | s411325743 | Accepted | def main():
S = input()
T = input()
ans = 10**4
for i in range(len(S)-len(T) + 1):
count = 0
for j in range(len(T)):
if S[i + j] != T[j]:
count += 1
if ans > count :
ans = count
if ans == 10**4:
print(len(T))
else:
print(ans)
if __name__ == "__main__":
main() |
p02832 | s192099388 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 1
for i in range(n):
if a[i] == ans:
ans += 1
print(n-ans+1 if ans != 1 else -1)
|
p02727 | s007155719 | Accepted | X, Y, A, B, C = map(int,input().split())
P = sorted(list(map(int,input().split())), reverse=True)
Q = sorted(list(map(int,input().split())), reverse=True)
R = sorted(list(map(int,input().split())), reverse=True)
P = P[:X]
Q = Q[:Y]
A = P + Q + R
A.sort(reverse=True)
ans = sum(A[:X+Y])
print(ans) |
p03633 | s230197824 | Accepted | def gcd(x, y):
if x == 0:
return y
else:
return gcd(y % x, x)
def lcm(x, y):
return x * y // gcd(x, y)
n = int(input())
ans = 1
for _ in range(n):
t = int(input())
ans = lcm(ans, t)
print(ans) |
p03944 | s765445804 | Accepted | w, h, n = map(int, input().split())
x = []
y = []
a = []
for i in range(n):
xi, yi, ai = map(int, input().split())
x.append(xi)
y.append(yi)
a.append(ai)
xmin = 0
xmax = w
ymin = 0
ymax = h
for i in range(n):
if a[i] == 1:
xmin = max(xmin, x[i])
elif a[i] == 2:
xmax = min(xmax, x[i])
elif a[i] == 3:
ymin = max(ymin, y[i])
else:
ymax = min(ymax, y[i])
print(max(0, xmax - xmin) * max(0, ymax - ymin))
|
p02608 | s753664895 | Wrong Answer | N = int(input())
A = []
for i in range(1,46):
for j in range(1,46):
for k in range(1,46):
A.append(i**2+j**2+k**2+i*j+i*k+j*k)
A = sorted(A)
B = [0]*100000
for i in range(10000):
if A[i] < 10000:
B[A[i]] += 1
C = B[1:N+1]
[print(i) for i in C] |
p02989 | s980184154 | Accepted | N = int(input())
S = list(map(int, input().split()))
S.sort()
print(S[N//2]-S[N//2-1]) |
p02802 | s052786728 | Accepted | N, M = map(int,input().split())
ac = [0] * N
wa = [0] * N
for i in range(M):
p, s = map(str,input().split())
num = int(p)-1
if s == 'WA' and ac[num] == 0:
wa[num] += 1
elif s == 'AC' and ac[num] == 0:
ac[num] += 1
for i in range(N):
if ac[i] == 0:
wa[i] = 0
print('{} {}'.format(sum(ac), sum(wa))) |
p03359 | s405996847 | Accepted | a, b = map(int, input().split())
if a <= b:
print(a)
else:
print(a - 1) |
p03001 | s463795782 | Accepted | from decimal import Decimal
W, H, x, y = map(int, input().split())
if W == 2*x and H == 2*y:
print(Decimal(W*H/2), 1)
else:
print(Decimal(W*H/2), 0)
|
p02687 | s949374104 | Accepted | place = input('')
if place == 'ABC':
print('ARC')
else:
print('ABC') |
p02756 | s653758821 | Accepted | a = list(raw_input())
b = []
q = input()
for _ in xrange(q):
line = raw_input().split()
if line[0] == "1":
a, b = b, a
elif line[1] == "1":
b.append(line[2])
else:
a.append(line[2])
print ''.join(b[::-1] + a)
|
p03285 | s560837605 | Accepted | N = int(input())
res = "No"
for c in range(N//4 + 1):
for d in range(N//7 + 1):
total = 4*c + 7*d
if total == N:
res = "Yes"
print(res) |
p02724 | s381561439 | Accepted | X=int(input())
print((X//500)*1000+5*((X%500)//5))
|
p03239 | s084813986 | Accepted | N, T = list(map(int, input().split()))
flag = False
mins = 10000
for i in range(N):
s, t = list(map(int, input().split()))
if T >= t:
mins = s if mins > s else mins
flag = True
print(mins if flag is True else 'TLE') |
p02594 | s068728183 | Accepted | temp = int(input())
if temp >= 30:
print('Yes')
else:
print('No') |
p03456 | s954932904 | Wrong Answer | import math
sq=math.sqrt(int("".join(input().split())))
print("YES" if sq.is_integer() else "NO") |
p02842 | s838640255 | Wrong Answer | n=int(input())
for i in range(1,n):
if int(i*1.08) == n:
print(i)
break
else:
print(':(') |
p02879 | s457693294 | Accepted | #!/usr/bin/env python3
def main():
A, B = map(int, open(0).read().split())
if (A < 10 and B < 10):
print(A * B)
else:
print('-1')
main() |
p03657 | s324734194 | Accepted | A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
print('Possible')
else:
print('Impossible') |
p02697 | s994746389 | Accepted | N,M = map(int, input().split())
M1 = M//2
M2 = M-M1
for i in range(M1):
a=i+1
b=2*M1+1-i
print(a,b)
for i in range(M2):
a=i+1
b=2*M2-i
print(2*M1+1 + a,2*M1+1 + b) |
p03417 | s904242893 | Wrong Answer | n,m = map(int, input().split())
if n > n:
n,m = m,n
if n==1 and m==1:
print(1)
elif n==1:
print(m-2)
elif n==2 or m==2:
print(0)
else:
print((m-2)*(n-2))
|
p02873 | s891533198 | Accepted | import sys
S = input()
a = [0]*(len(S)+1)
for i in range(len(S)):
if S[i] == '<':
a[i+1] = max(a[i+1], a[i]+1)
for i in range(len(S)):
if S[-i-1] == '>':
a[-i-2] = max(a[-i-1]+1, a[-i-2])
count = 0
for i in a:
count += i
print(count)
|
p03481 | s949907600 | Accepted | x, y = map(int, input().split())
cnt=0
while y >= x:
x = x*2
cnt +=1
print(cnt) |
p02847 | s212717108 | Accepted | def count(s):
if s == 'SUN': return 7
if s == 'MON': return 6
if s == 'TUE': return 5
if s == 'WED': return 4
if s == 'THU': return 3
if s == 'FRI': return 2
if s == 'SAT': return 1
s = input()
print(count(s)) |
p02963 | s428324366 | Wrong Answer | def resolve():
S=int(input())
i,mod=divmod(S,10**9)
print(0,0,10**9,i,1,mod)
resolve() |
p02639 | s044373100 | Accepted | L = list(map(int,input().split()))
print(L.index(0)+1) |
p02793 | s024805792 | Wrong Answer | n = int(input())
nums = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
def gcd(x, y): #GCD
# greatest_common_divisor
if x < y:
x, y = y, x
if y == 0:
return 0
if x % y == 0:
return y
return gcd(y, x % y)
def lcm(x, y): #LCM
# lowest_common_multiple
return x * y // gcd(x, y)
LCM = 1
for num in nums:
LCM = lcm(num, LCM)
LCM %= mod
ans = 0
for num in nums:
ans += (LCM // num) % mod
print(ans % mod) |
p03262 | s000557983 | Accepted | import fractions
N, X = map(int, input().split())
x = list(map(int, input().split()))
ans = abs(X - x[0])
for i in range(N):
ans = fractions.gcd(ans, abs(x[i]-x[i-1]))
print(ans) |
p03069 | s201185709 | Accepted | import sys
n=int(input())
c=input()
black=c.count("#")
white=c.count(".")
if black==n:
print(0)
sys.exit()
b=0
w=0
now=0
ans=float('inf')
for i in range(n):
if c[i]=="#":
b+=1
w=(i+1)-b
now=b+(white-w)
ans=min(ans,now)
print(min(ans,white)) |
p03478 | s955017855 | Accepted | n,a,b=map(int,input().split())
total=0
i=1
while i in range(1,n+1):
l=list(str(i))
ll=[int(s) for s in l]
if a<=sum(ll)<=b:
total+=i
i+=1
else:
i=i+1
else:
print(total)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.