problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p04029 | s674478175 | Accepted | N = int(input())
a=0
for i in range(N+1):
a = a + i
print(a) |
p02742 | s888160127 | Accepted | h,w = map(int,input().split())
ans = (h*w)//2
if h%2 == 1 and w%2 == 1: ans += 1
if h == 1 or w == 1: ans = 1
print(ans) |
p03861 | s989393651 | Accepted | a,b,x = map(int,input().split())
print((b//x)-((a-1)//x)) |
p03285 | s628968234 | Wrong Answer | n = int(input())
dp = [0] * (n + 1)
for i in range(n):
if n >= i + 4:
dp[i + 4] = dp[i] + 1
if n >= i + 7:
dp[i + 7] = dp[i] + 1
if dp[n] == 0:
print("No")
else:
print("Yes") |
p02597 | s706379099 | Wrong Answer | N = int(input())
C = list(input())
w = C[:N//2].count("W")
if N%2 == 0:
r = C[N//2:].count("R")
else:
r = C[N//2+1:].count("R")
print(max(w,r)) |
p02576 | s168267475 | Accepted | n, x, t = map(int, input().split())
if n % x == 0:
print((n//x) * t)
else:
print((n//x+1)*t) |
p02691 | s834611685 | Accepted | n = int(input())
a = list(map(int, input().split()))
tmp = [0] * n
tmp2 = [0] * n
for i, j in enumerate(a):
if i + j < n:
tmp[i + j] += 1
if 0 <= i - j:
tmp2[i - j] += 1
cnt = 0
for i in range(n):
cnt += tmp[i] * tmp2[i]
print(cnt) |
p03861 | s797635470 | Accepted | a, b, x = map(int, input().split())
print(b//x - (a - 1)//x)
|
p03137 | s653878308 | Accepted | N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
L = [0]*(M-1)
for i in range(M-1):
L[i] = X[i+1]-X[i]
L.sort(reverse=True)
print(X[M-1]-X[0]-sum(L[:N-1])) |
p02854 | s405608311 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
left = 0
right = 0
center = 0
sum_a = sum(a)
flg = False
for i in range(n):
if left + a[i] > sum_a/2 and flg is False:
flg = True
center = a[i]
right -= a[i]
elif left + a[i] == sum_a // 2:
print(0)
exit()
if flg is False:
left += a[i]
else:
right += a[i]
print(left, center, right)
print(min(left+center-right, right+center-left))
|
p03162 | s159028475 | Wrong Answer | n=int(input())
z=4
sumi=0
for i in range(n):
a=list(map(int,input().split()))
maxi=max(a)
if z==a.index(maxi):
a.pop(z)
sumi=sumi+max(a)
z=a.index(max(a))
else:
sumi=sumi+max(a)
z = a.index(max(a))
print(sumi)
|
p03821 | s111921711 | Wrong Answer | N = int(input())
AB = [list(map(int, input().split())) for i in range(N)][::-1]
ans = 0
for a, b in AB:
ans += b - (a + ans) % b
print(ans) |
p02623 | s413115783 | Accepted | import sys
import math
from collections import deque
n,m,k=map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a=[0]
b=[0]
for i in range(n):
a.append(A[i]+a[i])
for i in range(m):
b.append(B[i]+b[i])
ans,j=0,m
for i in range(n+1):
if a[i] > k :
break
while b[j] > k-a[i] :
j-=1
ans = max(ans, i+j)
print(ans)
|
p02647 | s678959707 | Accepted | n,k,*a=map(int,open(0).read().split())
for _ in range(k):
b=[0]*n
for i,q in enumerate(a):
b[max(0,i-q)]+=1
if i+q+1<n:
b[i+q+1]-=1
for i in range(1,n):
b[i]+=b[i-1]
if a==b:
break
a=b[:]
print(*a) |
p02584 | s680545798 | Wrong Answer | x, k, d = map(int, input().split())
result = 0
firstNearestIterNum = x // d
if k < firstNearestIterNum:
result = (abs(x) - abs(d * k))
else:
if (k - firstNearestIterNum) % 2 == 1:
result = (abs(x) - abs(d * (firstNearestIterNum + 1)))
else:
result = (abs(x) - abs(d * firstNearestIterNum))
print(abs(result)) |
p02600 | s359147613 | Wrong Answer | X = int(input())
A = 2000 - X
if A % 200 == 0:
print(str(A // 200) + "級")
else:
print(str(A // 200 + 1) + "級") |
p02622 | s601188091 | Accepted | s=list(input())
t=list(input())
c=0
for i in range(len(s)):
if s[i]!=t[i]:
c+=1
print(c)
|
p03208 | s693323260 | Wrong Answer | n,k = map(int,input().split())
h = [int(input()) for _ in range(n)]
h.sort()
ans = 10**9
for i in range(n-k):
ans = min(ans,h[i+k-1]-h[i])
print(ans) |
p03061 | s051726088 | Wrong Answer | from functools import reduce
from fractions import gcd
n=int(input())
s=list(map(int,input().split()))
if n==2:
print(max(s))
exit()
ma=1
for i in range(len(s)-1):
t=s[i]
s[i]=s[i+1]
c=reduce(gcd,s)
ma=max(ma,c)
s[i]=t
else:
t=s[i]
s[i]=s[i-1]
c=reduce(gcd,s)
ma=max(ma,c)
s[i]=t
print(ma) |
p02833 | s737208883 | Accepted | n = int(input())
if n%2 != 0:
print(0)
exit(0)
num = 2*5
ans = 0
while n>=num:
ans += n//num
num *= 5
print(ans) |
p03723 | s256969169 | Accepted | A, B, C = list(map(int, input().split()))
[A, B, C].sort() #smaller~bigger
if A==B and B==C:
if A%2==0:
print(-1)
else:
print(0)
elif (A%2==1) or (B%2==1) or (C%2==1):
print(0)
else:
cnt = 0
while ((A%2==0) and (B%2==0) and (C%2==0)):
[A, B, C] = [(A+B)/2, (A+C)/2, (B+C)/2]
cnt += 1
print(cnt)
|
p02972 | s641400863 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))[::-1]
ans = []
for i in range(n-1,-1,-1):
t = A[i]
for j in range(2*i+1,n+1,i+1):
if i<j<n:
t += A[j]
if t%2!=A[i]:
ans.append(i+1)
print(len(ans))
if len(ans)>0:
print(*ans) |
p02660 | s885510322 | Accepted | from math import *
def aaa(n):
return int((sqrt(8*n+1)-1)/2)
def bk(n):
if n <= 1:
return {}
r = {}
for i in range(2, ceil(sqrt(n))+1):
if n % i != 0:
continue
r.setdefault(i,0)
while n % i == 0:
n //= i
r[i] += 1
if n == 1:
return r
r.setdefault(n, 1)
return r
n = int(input())
f = bk(n)
print(sum((aaa(m) for m in f.values()))) |
p03107 | s112081883 | Wrong Answer | from collections import Counter
c = Counter(list(input())).values()
print(2 * min(c)) |
p02642 | s040320419 | Wrong Answer | from itertools import permutations
n = int(input())
nums = list(map(int, input().split()))
temp = dict(map(lambda x: (x, x[0] % x[1]), permutations(set(nums), 2)))
not_ans = set(map(lambda x: x[0], filter(lambda x: temp[x] == 0, temp)))
ans = list(filter(lambda x: not x in not_ans, nums))
print(len(ans))
|
p02712 | s659680617 | Wrong Answer | import math
num = int(input())
syou = math.floor(num/15)
amari = num % 15
sum = 0
list = [1,2,0,4,0,0,7,8,0,0,11,0,13,14,0]
if syou >=1:
sum += 60 + 120* (syou-1)
for i in range(amari):
sum += list[amari-1] + 15 * (syou-1)
print(sum)
else:
for d in range(num):
sum += list[d]
print(sum) |
p03543 | s088552448 | Accepted | x = input()
print("Yes" if x[0] == x[1] == x[2] or x[1] == x[2] == x[3] or x[0] == x[1] == x[2] == x[3] else "No") |
p03457 | s711789834 | Wrong Answer | N = int(input())
xy=[]
try :
while True:
t = input().split()
t = list(map(int,t))
xy.append(t)
except EOFError:
pass
loc = [0,0]
time = 0
for i in range(N):
a = xy[i]
time = a[0]-time
dis = abs(loc[0]-a[1])+abs(loc[1]-a[2])
if (time-dis)<0 :
print("No")
break
elif (time-dis)%2 == 0:
pass
else :
print("No")
break
loc = [a[1],a[2]]
else :
print("Yes") |
p03109 | s292119899 | Wrong Answer | line = list(input().split("/"))
print(line)
if int(line[0]) <= 2019 and int(line[1]) <= 4:
print("Heisei")
else:
print("TBD") |
p02598 | s358199116 | Accepted | import sys
import numpy as np
import math
def Ii():return int(sys.stdin.readline())
def Mi():return map(int,sys.stdin.readline().split())
def Li():return list(map(int,sys.stdin.readline().split()))
n,k = Mi()
a = np.array(sys.stdin.readline().split(), np.int64)
maxa = np.max(a)
mina = maxa//(k+1)
while maxa > mina+1:
mid = (mina+maxa)//2
div = np.sum(np.ceil(a/mid-1))
if div > k:
mina = mid
else:
maxa = mid
print(maxa) |
p03795 | s497825482 | Accepted | n = int(input())
print(n * 800 - (n//15*200)) |
p03285 | s721764403 | Wrong Answer | n=int(input())
print('Yes') if n%4==0 or n%7==0 or n%11==0 else print('No') |
p02719 | s553407937 | Accepted | N, K = map(int, input().split())
a = abs(N - (N // K) * K)
b = abs(a - K)
print(min(a, b)) |
p03627 | s774588618 | Wrong Answer | from collections import Counter
N = int(input())
cnt = Counter(map(int, input().split()))
L = sum([[1] for a, c in cnt.items()], [])
L.sort()
ans = 0 if len(L) < 2 else L[-1] * L[-2]
print(ans)
|
p03150 | s950300425 | Accepted | A=list("keyence")
f=-1;p=0
S=list(map(str,input()))
if S[0:7]==A or S[len(S)-7:len(S)]==A:
f=1
else:
if S[0]!=A[0]:
f=0
else:
for i in range(len(S)):
if S[i]==A[i]:
p=p+1
else:
if A[0:p]+S[len(S)-(len(A)-p):len(S)]==A:
f=1
break
else:
f=0
break
print("YES" if f==1 else "NO") |
p02730 | s497226817 | Accepted | a = list(input())
if a[:(len(a)-1)//2] == a[((len(a)+3)//2)-1:] and a[:(len(a)-1)//2] == a[::-1][:(len(a)-1)//2]:
print('Yes')
else:
print('No') |
p03998 | s545665864 | Accepted | s = [input() for _ in range(3)]
d = {"a": 0, "b": 1, "c": 2}
i = [-1] * 3
t = 0
while True:
i[t] += 1
if i[t] >= len(s[t]):
break
t = d[s[t][i[t]]]
print(["A", "B", "C"][t]) |
p03680 | s318568362 | Wrong Answer | n = int(input())
data = [int(input()) for i in range(n)]
count = 1
temp = data[0]
for i in range(n):
temp = data[temp-1]
count += 1
if temp == 2:
print(count)
break
else:
print(-1) |
p03109 | s977621985 | Accepted | s=input()
if int(s[:4])<2019:
print("Heisei")
print("3")
elif int(s[:4])>2019:
print("TBD")
elif int(s[5])==1 or int(s[6])>4:
print("TBD")
else:
print("Heisei") |
p03605 | s321273677 | Accepted | N = input()
if N[0] == "9" or N[1] == "9":
print("Yes")
else:
print("No") |
p02862 | s433393816 | Accepted | from numpy.linalg import solve
def C(n, r, MOD):
num = 1
den = 1
for i in range(r):
num *= n - i
num %= MOD
den *= i + 1
den %= MOD
return ((num * pow(den, MOD - 2, MOD)) % MOD)
X, Y = map(int, input().split())
MOD = 1_000_000_007
A = [[1, 2],[2, 1]]
B = [X, Y]
n, m = solve(A, B)
if n >= 0 and m >= 0 and n == int(n):
n = int(n)
m = int(m)
print(C(n + m, n, MOD))
else:
print(0)
|
p03262 | s658529135 | Accepted | n,x,*l=map(int,open(0).read().split())
from math import *
a=0
for i in l: a=gcd(a,abs(i-x))
print(a) |
p03137 | s779732881 | Accepted | N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
diff = [0]*(M-1)
for i in range(M-1):
diff[i] = X[i+1]-X[i]
diff.sort()
if N>=M:
ans = 0
else:
ans = sum(diff[:M-N])
print(ans) |
p03146 | s892998607 | Wrong Answer | s=int(input())
G =[s]
while all(G[i]!=G[-1] for i in range(len(G))):
if G[-1] % 2==0:
s == int(s/2)
G.append(s)
else:
s == int(3*s+1)
G.append(s)
print(len(G)) |
p03319 | s677464333 | Accepted | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
idx = k
r = 1
while idx < n:
idx += k - 1
r += 1
print(r) |
p02696 | s828932248 | Wrong Answer | a, b, n = map(int, input().split())
x = max(b-1, n)
print((a*x)//b) |
p02897 | s234043876 | Accepted | a=int(input())
if a%2==0:
print(1/2)
else:
print(((a+1)/2)/a) |
p02603 | s685431394 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
M = 1000
stock = 0
for i in range(1, N):
# print(M)
if A[i-1] < A[i]:
stock = M // A[i-1]
M -= stock * A[i-1]
elif A[i-1] > A[i]:
M += stock * A[i-1]
stock = 0
if stock:
M += stock * A[-1]
print(M) |
p02783 | s260222514 | Accepted | h,a=map(int,input().split())
ans=h//a
if h%a!=0:
ans+=1
print(ans) |
p03252 | s660476164 | Accepted | from collections import Counter
s1 = sorted(list(dict(Counter(input())).values()))
t1 = sorted(list(dict(Counter(input())).values()))
print(['No', 'Yes'][s1 == t1]) |
p03785 | s134829949 | Accepted | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
n,c,k = MI()
t = sorted([I() for _ in range(n)])
cnt = 1
b = 1
bt = t[0]+k
for i in range(1, n):
if cnt == c or t[i] > bt:
b += 1
bt = t[i]+k
cnt = 1
else:
cnt += 1
print(b)
|
p02595 | s551328338 | Wrong Answer | import math
n,d = map(int,input().split())
ans = 0
for i in range(n):
x,y = map(int,input().split())
print(math.sqrt((x ** 2) + (y ** 2)))
if math.sqrt((x ** 2) + (y ** 2)) <= d:
ans += 1
print(ans) |
p03487 | s720965577 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
a.sort()
a.append(0)
ans=0
b=0
c=0
for i in range(N+1):
if b!=a[i]:
if c<b:
ans+=min((b-c),c)
b=a[i]
c=1
else:
if c==b:
ans+=1
else:
c+=1
print(ans) |
p03779 | s648149504 | Accepted | X=int(input())
i=1
while X>0:
X=X-i
i=i+1
print(i-1) |
p02726 | s875307965 | Wrong Answer | n,x,y=map(int,input().split())
cnt=[0 for i in range(n)]
for i in range(1,n+1):
for j in range(i+1,n+1):
l=min(j-i,abs(x-i)+abs(y-j)+y-x)
cnt[l] += 1
for i in range(1,n):
print(cnt[i])
|
p02688 | s496250202 | Wrong Answer | n, k = map(int, input().split())
s = set()
for _ in range(k):
input()
s.add(map(int, input().split()))
print(n - len(s)) |
p02831 | s221633598 | Accepted | ab=list(map(int,input().split()))
i=max(ab)
while True:
if i%ab[0]==0 and i%ab[1]==0:
print(i)
break
i+=max(ab)
#print(i) |
p02910 | s666545689 | Accepted | import sys
s=list(map(str,input()))
for i in range(len(s)):
if i%2==0 and s[i]=='L':
print('No')
sys.exit()
else:
if i%2==1 and s[i]=='R':
print('No')
sys.exit()
print('Yes') |
p03719 | s555973428 | Accepted | a, b, c = map(int, input().split())
print('Yes' if a<=c<=b else 'No') |
p02780 | s278072361 | Accepted | N,K=map(int,input().split())
p=list(map(int,input().split()))
ans=0
temp=0
for i in range(K):
temp+=(1+p[i])/2
ans=temp
for j in range(N-K):
temp=temp-(1+p[j])/2+(1+p[j+K])/2
if temp>ans:
ans=temp
print(ans) |
p02912 | s175235650 | Accepted | import heapq
n, m = (int(x) for x in input().split())
A = [-int(x) for x in input().split()]
heapq.heapify(A)
for i in range(m):
a = (-1)*heapq.heappop(A)
a //= 2
heapq.heappush(A, -a)
print(-sum(A)) |
p02552 | s815250344 | Wrong Answer | x = int(input())
if x == 1:
print("1")
else:
print("0") |
p03105 | s873140842 | Accepted | A, B, C = [int(n) for n in input().split()]
print(C if A*C <= B else B//A) |
p03327 | s723440954 | Accepted | A = int(input())
print('ABC' if A < 1000 else 'ABD') |
p02829 | s983453536 | Accepted | def resolve():
A = int(input())
B = int(input())
cands = set([1,2,3])
print(list(cands-set([A, B]))[0])
if '__main__' == __name__:
resolve() |
p02939 | s907935460 | Wrong Answer | s = list(input())
n = len(s)
s.append('0')
t = '0'
p = 0
i = 0
while i < n:
if t == s[i]:
t = s[i+1]
i += 2
else:
t = s[i]
i += 1
p += 1
print(p) |
p03345 | s250366718 | Accepted | a, b, c, k = map(int, input().split())
if k == 0:
print(a - b)
else:
a, b, c = b + c, a + c, a + b
if a - b <= 0:
print(abs(a - b) * (-1) ** k)
elif a - b > 0:
print(abs(a - b) * (-1) ** (k - 1)) |
p02777 | s719992478 | Wrong Answer | color = input()
kosuu = input()
trashc = input()
_ = 0
color = color.split()
kosuu = kosuu.split()
trashc = trashc.split()
while True:
if(trashc[0] == color[_]):
kosuu[_] = int(kosuu[_]) -1
break
_= _+1
print(kosuu)
|
p02714 | s509458201 | Accepted | N = int(input())
S = input()
count = S.count("R") * S.count("G") * S.count("B")
for j in range(N):
for i in range(j):
k = 2 * j - i
if k >= N:
continue
if (S[i] != S[j]) and (S[i] != S[k]) and (S[j] != S[k]):
count -= 1
print(count) |
p02744 | s496370938 | Accepted | n = int(input())
l = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
def moji(mes, layer, lim):
if(layer==n):
print(mes)
return
for i in range(lim+1):
moji(mes+l[i], layer+1, max(lim,i+1))
return
moji("", 0, 0) |
p02786 | s484902412 | Accepted | # -*- coding: utf-8 -*-
def rec(x):
if x == 1:
return 1
return 2 * rec(x // 2) + 1
def main():
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n = int(input())
print(rec(n))
if __name__ == '__main__':
main()
|
p02766 | s945784163 | Accepted | n,k=map(int,input().split())
i=0
while k**i<=n:
i+=1
print(i) |
p02862 | s541701731 | Accepted | X,Y = map(int,input().split())
if((-X+2*Y)%3 != 0 or (-Y+2*X)%3 != 0 or -X+2*Y<0 or -Y+2*X<0):
print(0)
exit()
A = (-X+2*Y)//3
B = (-Y+2*X)//3
mod = 10**9+7
def combinations_count(A,B):
bunsi,bunbo = 1,1
for i in range(1,A+1):
bunsi = (bunsi*(B+i))%mod
bunbo = (bunbo*i) % mod
return (bunsi*pow(bunbo,mod-2,mod))%mod
ans = combinations_count(A,B)
print(ans) |
p02659 | s566510930 | Wrong Answer | A, B = map(str, input().split())
A = int(A)
B = float(B)
Ax = A // 100
Ay = A % 100
Bx = B // 1
By = int((B - Bx) * 100)
p = Ax * Bx * 100 + Ax * By + Ay * Bx
q = (Ay * By) // 100
print(int(p + q)) |
p02963 | s942556491 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
print(0,0,10**9,1,-10**9*(-n//10**9)-n,-(-n//10**9))
if __name__=='__main__':
main() |
p04034 | s820658009 | Wrong Answer | N, M = map(int, input().split())
s = {1}
t = [1]*N
res = 0
for _ in range(M):
x, y = map(int, input().split())
t[x-1] -= 1
t[y-1] += 1
if x-1 in s:
s.add(y-1)
for i in range(N):
if t[i] >= 1 and i in s:
res += 1
print(res) |
p02833 | s479842911 | Accepted | n = int(input())
ans = 0
if n % 2 != 0:
print(0)
exit()
denominator = 10
while n >= denominator:
ans += n//denominator
denominator *= 5
print(ans) |
p03827 | s655171492 | Accepted | n = int(input())
s = str(input())
ans = 0
ans_lis = [0]
for i in range(n):
if s[i] == "I":
ans += 1
ans_lis.append(ans)
else:
ans -= 1
ans_lis.append(ans)
print(max(ans_lis)) |
p03944 | s146460763 | Accepted | w,h,n = map(int,input().split())
x_max = w
x_min = 0
y_max = h
y_min = 0
for i in range(n):
x,y,a = map(int,input().split())
if a == 1:
x_min = max(x_min,x)
elif a == 2:
x_max = min(x_max,x)
elif a == 3:
y_min = max(y_min,y)
elif a == 4:
y_max = min(y_max,y)
#print(x_max,x_min,y_max,y_min)
a= max(x_max-x_min,0)
b =max(y_max-y_min,0)
print(a*b) |
p03548 | s027439611 | Accepted | x,y,z=map(int,input().split())
a=x//(y+z)
if x-a*(y+z)>=z:
print(a)
else:
print(max(0,a-1)) |
p02705 | s930621613 | Accepted | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
INF = float('inf')
from math import pi
def solve():
r = II()
print(2 * pi * r)
if __name__ == '__main__':
solve()
|
p03605 | s677085972 | Wrong Answer | print('Yes' if '9' in list(input(())) else 'No')
|
p03239 | s961501011 | Wrong Answer | N,T = map(int,input().split())
mn = 10**10
for i in range(N):
c,t = map(int,input().split())
if t <= T and c < mn:
mn = c
if mn == 10**10:
print("TLE")
else:
print(c)
|
p02690 | s321513872 | Wrong Answer | x = int(input())
import math
for A in range(-10**5,10**5):
A5 = A ** 5
if x - A5 < 0:
B = -1 *round(math.pow(-(x - A5),1/5),0)
else:
B = round(math.pow(x - A5,1/5),0)
if A5 == x + int(B) ** 5:
print(A,int(B))
quit()
|
p02957 | s025511178 | Accepted | a, b = map(int, input().split())
if abs(a-b) % 2 == 0:
print((a+b)//2)
else:
print("IMPOSSIBLE") |
p02860 | s127247710 | Accepted | N = int(input())
S = input()
if N % 2 == 1:
result = 'No'
else:
middle = N // 2
if S[:middle] == S[middle:]:
result = 'Yes'
else:
result = 'No'
print(result) |
p03761 | s653273273 | Wrong Answer | from collections import Counter
n=int(input())
w=Counter(input())
for i in range(n-1):
w &=Counter(input())
ans=""
for i,j in w.items():
ans +=i*j
print(ans) |
p02801 | s713552932 | Accepted | N=input()
def alpha2num(alpha):
num=0
for index, item in enumerate(list(alpha)):
num += pow(26,len(alpha)-index-1)*(ord(item)-ord('A')+1)
return num
S=alpha2num(N)+1
num2alpha = lambda c: chr(c+64)
print(num2alpha(S)) |
p03481 | s313249954 | Wrong Answer | x,y = map(int,input().split())
z = x
j = 1
while z < y:
z += x ** j
j += 1
if z == y:
print(j+1)
else:
print(j) |
p03037 | s235030464 | Accepted | n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(m)]
l,r = [list(i) for i in zip(*a)]
print(max(0,min(r)-max(l)+1)) |
p03067 | s455147558 | Wrong Answer |
a,b,c=map(int,input().split())
if a <=c <=b:
print('Yes')
else:
print('No') |
p03434 | s958688188 | Accepted | N = int(input())
A = sorted(list(map(int,input().split())),reverse=True)
print(sum(A[0::2])-sum(A[1::2])) |
p03944 | s659695205 | Accepted | f=lambda:map(int,input().split())
w,h,n=f()
v=g=0
for _ in range(n):
x,y,a=f()
if a==1: v=max(v,x)
if a==2: w=min(w,x)
if a==3: g=max(g,y)
if a==4: h=min(h,y)
print(max(w-v,0)*max(h-g,0)) |
p03351 | s309667798 | Accepted | a, b, c, d = map(int, input().split())
AB = abs(b - a)
BC = abs(c - b)
AC = abs(c - a)
if (AB <= d and BC <= d) or AC <= d:
print('Yes')
else:
print('No') |
p03210 | s568728275 | Accepted | x = int(input())
if x==7 or x == 5 or x ==3:
print("YES")
else:
print("NO") |
p02790 | s683017344 | Wrong Answer | a , b =map(int,input().split())
#print(a,b)
if a < b :
print(a*b)
else :
print(b*a) |
p03408 | s330081945 | Wrong Answer | n = int(input())
s = [input() for i in range(n)]
m = int(input())
t = [input() for i in range(m)]
for i in range(n):
ans = 0
for j in range(n):
if s[i] == s[j]:
ans += 1
for k in range(m):
if s[i] == t[k]:
ans -= 1
ans = max(ans, 0)
print(ans) |
p02663 | s737126281 | Accepted | H1, M1, H2, M2, K = map(int,input().split())
print((H2*60 + M2)-(H1*60+M1)-K) |
p02556 | s945839415 | Accepted | n = int(input())
x, y = map(int, input().split())
p, m = [x+y]*2, [x-y]*2
for i in range(n-1):
x, y = map(int, input().split())
p = [min(p[0], x+y), max(p[1], x+y)]
m = [min(m[0], x-y), max(m[1], x-y)]
print(max(p[1] - p[0], m[1] - m[0]))
|
p04011 | s452504451 | Wrong Answer | N = int(input())
K = int(input())
X = int(input())
Y = int(input())
print(N*X + (N - K)*Y) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.