problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02742 | s018018868 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
h, w = map(int, input().split())
if h == 1 or w == 1:
ans = 1
elif h % 2 == 0:
ans = (h // 2) * w
elif w % 2 == 0:
ans = (w // 2) * h
else:
ans = h * (w // 2) + (h // 2) + 1
print("%d" % ans)
if __name__ == '__main__':
main()
|
p03481 | s900575801 | Accepted | import math
x,y = map(int, input().rstrip().split(' '))
# n = int(math.log2(y/x))
# print(n+1)
for i in range(100):
a = x*(2**i)
if(a<=y):
continue
else:
print(i)
break
|
p03035 | s965264404 | Wrong Answer | #入力:N,M(int:整数)
def input2():
return map(int,input().split())
a,b=input2()
if a>=13:
print(b)
elif a>=6 and a<=12:
print(b/2)
else:
print(0)
|
p03633 | s119780813 | Wrong Answer | from functools import reduce
from fractions import gcd
N = int(input())
T = []
for i in range(N):
T.append(int(input()))
x = reduce(gcd,T)
sum=1
if x ==1:
for i in set(T):
sum*=i
print(sum)
else:
print(max(T)) |
p02948 | s602619152 | Accepted | def main():
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from heapq import heappush, heappop
N, M = map(int, input().split())
AB = [ [] for _ in range(100000) ]
for _ in range(N):
a, b = map(int, input().split())
AB[a-1].append(-b)
ans = 0
heap = []
for a in range(M):
for b in AB[a]:
heappush(heap, b)
if heap:
ans -= heappop(heap)
print(ans)
main()
|
p03075 | s571151701 | Accepted | a = [int(input()) for i in range(6)]
if a[4]-a[0]<=a[5]: print("Yay!")
else: print(":(") |
p03150 | s233092918 | Wrong Answer | import math
import sys
import collections
import bisect
readline = sys.stdin.readline
def main():
keyence = "keyence"
s = readline().rstrip()
lenS = len(s)
for i in range(1, 7):
if s.count(keyence[0:i]) > 0:
idx = s.index(keyence[0:i]) + i + 1
if s[idx-1:lenS].count(keyence[i:7]) > 0:
print("YES")
return
print("NO")
if __name__ == '__main__':
main()
|
p02773 | s970824606 | Wrong Answer | import sys
import collections
N = int(input())
S = []
for _ in range(N):
S.append(input())
c = collections.Counter(S)
a = c.most_common()
s = c.most_common()[0][1]
ans = []
for i in a:
if i[1] == s:
print(i[0])
sys.stdout.flush |
p03524 | s628011893 | Accepted | import sys
from collections import Counter
S = sys.stdin.readline().strip()
counter = Counter(S)
counter = sorted(counter.items(), key=lambda x: x[1])
# print(counter)
if len(counter) == 1:
if counter[0][1] == 1:
print("YES")
else:
print("NO")
elif len(counter) == 2:
if counter[0][1] == 1 and counter[1][1] == 1:
print("YES")
else:
print("NO")
else:
if counter[0][1] + 1 < counter[2][1]:
print("NO")
else:
print("YES") |
p02754 | s787319702 | Accepted | #B - Count Balls
N, A,B= map(int, input().split())
a = N % (A+B)
b = N // (A+B)
if a <= A:
print(b*A+a)
else:
print(b*A+A) |
p03109 | s951596895 | Accepted | import datetime
S = datetime.date(*map(int, input().split('/')))
x = datetime.date(2019, 4, 30)
print('Heisei' if S <= x else 'TBD')
|
p02691 | s819164297 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
l = [0]*(3*10**5+10)
for i in range(1,len(A)):
x = i-A[i]
if x<0:
continue
else:
l[x]+=1
if A[0]<=2*10**5:
ans+=l[A[0]]
for i in range(1,N):
x = i+A[i]
if x<0:
continue
if x>2*10**5:
continue
l[i-A[i]]-=1
ans+=l[x]
print(ans)
|
p02678 | s189593794 | Accepted | # 幅優先探索
from collections import deque
N, M = map(int, input().split())
AB = [map(int, input().split()) for _ in range(M)]
links = [[] for _ in range(N + 1)]
for a, b in AB:
links[a].append(b)
links[b].append(a)
result = [-1] * (N + 1)
q = deque([1])
while q:
i = q.popleft()
for j in links[i]:
if result[j] == -1:
result[j] = i
q.append(j)
print('Yes')
print('\n'.join(str(i) for i in result[2:]))
|
p02718 | s044769323 | Accepted | n,m = map(int, input().split())
A = list(map(int, input().split()))
s = 0
for i in range(n):
if A[i] >= sum(A)/(4*m):
s += 1
else:
pass
if s >= m:
print("Yes")
else:
print("No") |
p03239 | s802848087 | Wrong Answer | n, tl = [int(x) for x in input().split()]
c_init = 10 * 4
ans = c_init
for _ in range(n):
c, t = [int(x) for x in input().split()]
if (t <= tl) and (c < ans):
ans = c
if ans == c_init:
ans = "TLE"
print(ans) |
p02911 | s812897383 | Wrong Answer | import sys
input = sys.stdin.readline
n, k, q = [int(w) for w in input().split()]
score = [0] * n
for i in range(q):
a = int(input())
score[a - 1] += 1
for s in score:
cond = k - q + a > 0
print("Yes" if cond else "No")
|
p02571 | s841962927 | Wrong Answer | S = input()
T = input()
min_count = len(T)
for i in range(len(S) - len(T)):
count = 0
for x in range(len(T)):
if S[i+x] != T[x]:
count += 1
if count < min_count:
min_count = count
print(min_count)
|
p03971 | s805954219 | Accepted | n,a,b = map(int,input().split())
s = input()
ans = ["0"]*n
acnt = 0
bcnt = 0
for i in range(n):
if s[i] == "a":
if acnt < a+b:
acnt += 1
ans[i] = "Yes"
else:
ans[i] = "No"
elif s[i] == "b":
bcnt += 1
if acnt < a+b and bcnt <= b:
acnt += 1
ans[i] = "Yes"
else:
ans[i] = "No"
else:
ans[i] = "No"
print(*ans,sep='\n') |
p02687 | s046261076 | Wrong Answer | S='ABC'
if S=='ABC':
print('ARC')
else:
print('ABC')
|
p02779 | s540110778 | Accepted | n = int(input())
a = list(map(int, input().split()))
print('YES' if len(a) == len(set(a)) else 'NO')
|
p02547 | s224478658 | Accepted | n = int(input())
c = 0
for i in range(n):
a, b = map(int, input().split())
if a == b:
c += 1
else:
c = 0
if c >= 3:
print("Yes")
break
else:
print("No") |
p03011 | s487084282 | Accepted | a = [int(x) for x in input().split()]
a.sort()
print(a[0] + a[1])
|
p03419 | s324362571 | Accepted | N, M = map(int, input().split())
if N == 1 and M == 1:
print(1)
elif N==1 or M==1:
print(M*N-2)
else:
print((M-2)*(N-2))
|
p02725 | s925345688 | Accepted | k,n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
dmax = 0
for i in range(1,n):
if a[i]-a[i-1]>dmax:
dmax = a[i]-a[i-1]
if k-a[-1]+a[0] > dmax:
dmax = k-a[-1]+a[0]
print(k-dmax) |
p03387 | s923712397 | Accepted | a, b, c = sorted(map(int, input().split()))
diff1 = c - b
a += diff1
diff2 = c - a
if diff2 % 2 == 0:
diff2 //= 2
else:
diff2 += 1
diff2 //= 2
diff2 += 1
print(diff1 + diff2) |
p03449 | s598861159 | Wrong Answer | n = int(input())
list_A1 = list(map(int, input().split()))
list_A2= list(map(int, input().split()))
ans = 0
for i in range(1, n):
k = sum(list_A1[:i]) + sum(list_A2[i:]) + list_A1[i]
ans = max(ans, k)
if n == 1:
ans = list_A1[0] + list_A2[0]
print(ans) |
p02935 | s389348594 | Wrong Answer | n,*v=3,10,10,10
v.sort()
print(sum(v[i]<<i+(i==0)for i in range(n))/2**n) |
p02862 | s200518626 | Accepted | X,Y = list(map(int,input().split()))
MAXN = 2*(10**6)+10
p = 10**9+7
f = [1]
for i in range(MAXN):
f.append(f[-1] * (i+1) % p)
def nCr(n, r, mod=p):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
Z = (X+Y)//3
if Z*3!=X+Y:
print(0)
else:
P,Q = X-Z, Y-Z
if P<0 or Q<0:
print(0)
else:
print(nCr(Z,P))
|
p03407 | s199364924 | Accepted | a,b,c=map(int, input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p02790 | s394227386 | Accepted | a,b = input().split()
print(a*int(b) if a<b else b*int(a)) |
p03838 | s346165264 | Wrong Answer | x, y = map(int, input().split())
if x <= y: print(y-x)
elif x < 0 and y < 0:
print(abs(y-x)+2)
else:
print(abs(-y - x) + 1) |
p03329 | s499446399 | Accepted | N = int(input())
m = 10000000
def judge_1(t):
c = 0
while t>0:
c += t%6
t = t//6
return c
def judge_2(t):
c = 0
while t>0:
c += t%9
t = t//9
return c
for i in range(N+1):
m = min(m, judge_1(i)+judge_2(N-i))
print(m) |
p03254 | s777543439 | Accepted | N,x = map(int,input().split())
a = sorted(list(map(int,input().split())))
s = [sum(a[:i+1]) for i in range(N)]
if s[-1] == x:
print(N)
exit()
else:
for i in range(N-1):
if s[i] > x:
print(i)
exit()
print(N-1) |
p02659 | s101116450 | Accepted | A, B = input().split()
A = int(A)
B = int(B[0]+B[2:])
C = A*B
D = str(C)[:-2]
if D == "":
D = 0
else:
D = int(D)
print(D)
|
p03161 | s212685271 | Accepted | f_inf = float('inf')
N, K = map(int, input().split(' '))
h = list(map(int, input().split(' ')))
h.append(f_inf)
h.append(f_inf)
dp = [f_inf for _ in range(N + 100)]
dp[0] = 0
for i in range(N - 1):
for j in range(1, K + 1):
if i + j > N - 1:
break
dp[i+j] = min(dp[i] + abs(h[i+j] - h[i]), dp[i+j])
print(dp[N-1]) |
p03069 | s586565252 | Wrong Answer | import re
N=int(input())
s=input()
s=re.sub(r"^\.+","",s)
s=re.sub(r"#$","",s)
print(min(s.count("."),s.count("#"))) |
p02747 | s561977051 | Accepted | s = input()
s = s.replace('hi', '')
#print(s)
if s == '':
print('Yes')
exit()
print('No') |
p02618 | s814322113 | Accepted | import sys
input=lambda: sys.stdin.readline().rstrip()
D = int(input())
C = [int(i) for i in input().split()]
S = [[int(i) for i in input().split()] for _ in range(D)]
for i in range(D):
print(1)
|
p03386 | s745531498 | Wrong Answer | A, B, K = map(int, input().split())
tmp_s = {i for i in range(A, A+K)}
tmp_l = {i for i in range(B+1-K, B+1)}
ans = list(tmp_s.union(tmp_l))
ans.sort()
print(*ans, sep="\n") |
p03696 | s585727735 | Wrong Answer | N=int(input())
S=input()
stack= []
ans=""
for i in range(N):
if S[i]=="(":
stack.append(S[i])
else:
if len(stack)>0:
ans = stack.pop()+ ans + ")"
else:
ans = "(" + ans + ")"
nokori=len(stack)
ans += nokori * "(" + nokori * ")"
print(ans) |
p03385 | s587357382 | Accepted | a=input()
if len(set(a))==3:
print('Yes')
else:
print('No') |
p02701 | s339311997 | Accepted | N=int(input())
S=set()
for i in range(N):
S.add(str(input()))
print(len(S)) |
p03759 | s383070019 | Accepted | a, b, c = map(int, input().split())
if b - a == c - b:
print('YES')
else:
print('NO')
|
p02675 | s646063373 | Accepted | N = input()
a = int(N[-1])
if a==2 or a==4 or a==5 or a==7 or a==9:
print("hon")
elif a==0 or a==1 or a==6 or a==8:
print("pon")
else:
print("bon")
|
p03944 | s136865105 | Wrong Answer | W, H, N = map(int,input().split())
p = 0
q = W
r = 0
s = H
for i in range(N):
x, y, a = map(int,input().split())
if a == 1:
if x > p:
p = x
if a == 2:
if x < q:
q = x
if a == 3:
if y > r:
r = y
if a == 4:
if y < s:
s = y
ans = (q-p)*(s-r)
if ans < 0:
ans = 0
print(ans) |
p02957 | s801830482 | Accepted | import math
a,b = map(int,input().split())
num = a + b
if num < 0:
num = -num
if num % 2 == 0:
print(math.floor(num/2))
else:
print("IMPOSSIBLE") |
p02727 | s350660196 | Accepted | import heapq
from collections import deque
x,y,a,b,c = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = sorted(list(map(lambda x:int(x),input().split())),reverse=True)
p = sorted(p)[a - x:a]
q = sorted(q)[b - y:b]
p+=q
p.sort()
for i in range(min(len(r),len(p))):
p[i] = max(p[i],r[i])
print(sum(p)) |
p03803 | s646659980 | Wrong Answer | a,b=map(int,input().split())
if (a==1):
a=14
if (b==1):
b=14
if (a>b):
print('Alice')
elif (b>a):
print('Bob')
else:
print('draw')
|
p03557 | s968757057 | Accepted | import bisect
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
ans = 0
for i in b:
x = bisect.bisect_left(a, i)
y = bisect.bisect_right(c, i)
ans = ans + (x * (n-y))
print(ans) |
p03351 | s442878731 | Accepted | # coding: utf-8
a,b,c,d=map(int,input().split())
if abs(a-b)<=d and abs(b-c)<=d:
print('Yes')
else:
if abs(a-c)<=d:
print('Yes')
else:
print('No') |
p02795 | s121562782 | Accepted | H = int(input())
W = int(input())
N = int(input())
# print(H, W, N)
if H < W:
H, W = W, H
n = 0
cnt = 0
while n < N:
n += H
cnt += 1
print(cnt) |
p03745 | s918579153 | Accepted | N=int(input())
A=list(map(int,input().split()))
t=0
cnt=1
for i in range(1,N):
if(A[i]>A[i-1]):
if(t==0):
t=1
elif(t==-1):
cnt+=1
t=0
if(A[i]<A[i-1]):
if(t==0):
t=-1
elif(t==1):
cnt+=1
t=0
print(cnt) |
p02640 | s467430741 | Wrong Answer | X,Y = map(int, input().split())
for kame in range(1,X):
if (2*(X-kame)+4*kame)==Y:
print("Yes")
break
else:
print("No")
|
p03827 | s337707003 | Accepted | n=int(input())
s=input()
ans=0
x=0
for i in range(n):
if s[i]=='I':
x+=1
else:
x-=1
ans=max(ans,x)
print(ans) |
p03131 | s788681114 | Accepted | k,a,b = map(int,input().split())
if a >= b or b-a<=2:
ans = 1+k
else:
ans = ((k-(a-1))//2)*(b-a) + (k-(a-1))%2 +a
print(ans) |
p02601 | s286462618 | Accepted | a,b,c=map(int,input().split())
k=int(input())
ans=False
for i in range(0,k+1):
for j in range(0,k+1):
if(i+j>k):
continue
if(a*2**i<b*2**j and b*2**j < c*2**(k-i-j)):
#print(i,j,k-i-j)
ans=True
if(ans):
print("Yes")
else:
print("No") |
p03073 | s143350499 | Accepted | s = input()
n = len(s)
string = '0'
ans1 = 0
for i in range(n):
if s[i] != string:
ans1 += 1
if string == '0':
string = '1'
else:
string = '0'
string = '1'
ans2 = 0
for i in range(n):
if s[i] != string:
ans2 += 1
if string == '0':
string = '1'
else:
string = '0'
print(min(ans1,ans2))
|
p02983 | s035602299 | Accepted | L,R = map(int,input().split())
ans = float('inf')
for i in range(L,R):
for j in range(i+1,R+1):
if (i*j)%2019==0:
print(0)
exit()
ans = min(ans,(i*j)%2019)
print(ans) |
p03761 | s495941092 | Wrong Answer | n=int(input())
abc=list("abcdefghijklmnopqrstuvwxyz")
D={}
for a in abc:
D[a]=0
for i in range(n):
s=input()
for a in abc:
now=D[a]
num=s.count(a)
if i==0:
D[a]=num
else:
D[a]=min(now,num)
#print(D)
#print(D)
ans=""
for s,v in D.items():
ans+=s*v
if len(ans)==0:
print("\n", end="")
else:
print(ans)
|
p03434 | s339307143 | Wrong Answer | N = int(input())
a = map(int, input().split())
a = sorted(a, reverse=True)
Alice = 0
Bob = 0
for i in range(N-1):
Alice += a[i]
Bob += a[i+1]
print(Alice-Bob)
|
p02678 | s264976702 | Accepted | N,M = map(int,input().split())
t = [[i+1] for i in range(N)]
for i in range(M):
A,B = map(int,input().split())
t[A-1].append(B)
t[B-1].append(A)
from collections import deque
d = deque()
ans = [-1]*(N)
d.append(t[0])
while len(d) > 0:
z = d.popleft()
x = z[0]
for i in range(1,len(z)):
if ans[z[i]-1] == -1:
ans[z[i]-1] = x
d.append(t[z[i]-1])
print("Yes")
for i in range(1,len(ans)):
print(ans[i]) |
p02693 | s216880415 | Wrong Answer | str1 = int(input())
str2 = input().split()
num = int(str2[1] ) - int(str2[0])
if num == 0:
num = 1
use = int(str2[1])
ok_count = 0
for i in range(num):
if use % str1 == 0:
ok_count = 1
use = use - 1
if ok_count == 1 :
print("OK")
else:
print("NG") |
p02959 | s515081614 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=0
t=a[0]
for x in range(n):
c+=min(t+a[x+1],b[x])
t=a[x+1] if t>=b[x] else max(0,t+a[x+1]-b[x])
print(c) |
p03760 | s208204955 | Accepted | def main():
O = input()
E = input()
last = ""
if len(O) > len(E):
last = O[-1]
O = O[:-1]
ans = ""
for s1, s2 in zip(O, E):
ans += s1 + s2
ans += last
print(ans)
if __name__ == "__main__":
main() |
p02802 | s323760089 | Accepted | N, M = map(int, input().split())
ac = [False] * N
wa = [0] * N
for _ in range(M):
p, S = input().split()
p = int(p) - 1
if S == 'AC':
ac[p] = True
else:
if not ac[p]:
wa[p] += 1
a = 0
b = 0
for i in range(N):
if ac[i]:
a += 1
b += wa[i]
print(*[a, b]) |
p02963 | s185495206 | Accepted | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
s = int(input())
i = int(s**0.5)
while i*i < s:
i+= 1
r = i*i-s
ans = [0, 0, i, r, 1, i]
print(*ans)
if __name__ == '__main__':
main() |
p03252 | s354557179 | Wrong Answer | s = input()
t = input()
s = sorted(s)
t = sorted(t)
#s = ''.join(sorted(s))
#t = ''.join(sorted(t))
#print(s,t)
for ss,tt in zip(s,t):
if ss == tt:
s.remove(ss)
t.remove(tt)
if len(s) == len(t):
print('Yes')
else:
print('No') |
p02795 | s927744148 | Accepted | h=int(input())
w=int(input())
n=int(input())
maxbox=max(h,w)
print(-(-n//maxbox)) |
p02727 | s912403113 | Accepted | x, y, a, b, c = map(int, input().split())
p_s = sorted(list(map(int, input().split())), reverse=True)[:x]
q_s = sorted(list(map(int, input().split())), reverse=True)[:y]
r_s = sorted(list(map(int, input().split())), reverse=True)
s_s = sorted(p_s + q_s)
ans = sum(s_s)
for i in range(c):
tmp = ans - s_s[i] + r_s[i]
if tmp <= ans:
break
ans = tmp
print(ans) |
p03208 | s978693014 | Wrong Answer | #n=int(input())
n,k=map(int,input().split())
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
hl=[int(input()) for i in range(n)]
hl.sort()
ans=hl[2]-hl[0]
for i in range(n-k+1):
ans=min(ans,hl[i+k-1]-hl[i])
print(ans)
|
p02784 | s037066488 | Accepted | H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A)>=H:
print('Yes')
else:
print('No') |
p03471 | s086459636 | Accepted | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N-x+1):
z = N-x-y
if 0 <= z <= 2000 and 10000*x+5000*y+1000*z == Y:
print(x, y, z)
exit()
print(-1, -1, -1) |
p02743 | s194095779 | Accepted | from decimal import *
getcontext().prec = 50
a, b, c = map(int, input().split())
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No')
|
p02833 | s023299139 | Accepted | n = int(input())
if n % 2:
print(0)
exit()
n = n//2
c = 0
while n:
c += n//5
n = n // 5
print(c)
|
p02791 | s686157834 | Wrong Answer | import sys
input = sys.stdin.readline
n, s, c = int(input()), list(map(int, input().split())), 1
for i in range(n - 1):
if s[i] >= s[i+1]: c += 1
print(c) |
p02553 | s275870227 | Wrong Answer | a,b,c,d = map(int,input().split())
aa = abs(a)
bb = abs(b)
cc = abs(c)
dd = abs(d)
if a > 0 and c > 0:
print(b*d)
elif b < 0 and d < 0:
print(a*c)
elif a == 0 or b == 0 or c == 0 or d == 0:
print(0)
elif b < 0:
print(b*c)
else:
print(a*d) |
p02760 | s121290458 | Accepted | A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = {int(input()) for i in range(N)}
for i in range(3):
if A[i][0] in b and A[i][1] in b and A[i][2] in b:
print('Yes')
exit()
elif A[0][i] in b and A[1][i] in b and A[2][i] in b:
print('Yes')
exit()
if (A[0][0] in b and A[1][1] in b and A[2][2] in b) or (A[0][2] in b and A[1][1] in b and A[2][0] in b):
print('Yes')
exit()
print('No') |
p02996 | s809023417 | Wrong Answer | N = int(input())
X = [None for _ in range(N)]
for i in range(N):
X[i] = list(map(int,input().split()))
A = [None for _ in range(N)]
B = [None for _ in range(N)]
for i in range(N):
A[i] = X[i][0]
B[i] = X[i][1]
S = sum(A)
MAX = max(B)
if S > MAX:
print('No')
exit()
else:
print('Yes')
exit() |
p02712 | s738522844 | Wrong Answer | N = int(input())
ans = 0
for i in range(1,N+1):
if i % 3 == 0 or i % 5 == 0:
ans += i
print(ans)
|
p03293 | s525374358 | Accepted | S = list(input())
T = list(input())
flag = 0
for i in range(len(S)):
if S == T:
flag = 1
break
tmp = S.pop(0)
S.append(tmp)
if flag == 1:
print('Yes')
else:
print('No') |
p03380 | s149954717 | Accepted | n = int(input())
l = list(map(int, input().split()))
l.sort()
m = l.pop()
a = m
ans = 0
for r in l:
if abs((m / 2) - r) < a:
a = abs((m / 2) - r)
ans = r
print(m, ans)
|
p02947 | s313191785 | Accepted | from collections import Counter
def check(s1, s2):
for i in range(26):
if s1[i] != s2[i]:
return False;
return True
n = int(input())
stuff = []
for _ in range(n):
d = list(input())
cnt = [0 for x in range(26)]
for i in range(10):
cnt[ord(d[i])-97] += 1
stuff.append(cnt)
stuff.sort()
span = 1
ans = 0
for i in range(n-1):
if check(stuff[i+1], stuff[i]):
span += 1
else:
ans += span*(span-1)//2
span = 1
ans += span*(span-1)//2
print(ans)
|
p02726 | s668283715 | Accepted | n, x, y = map(int, input().split())
lengths = [0 for i in range(n)]
for start in range(1, n+1):
for end in range(start+1, n+1):
lengths[min(end - start, abs(x-start) + abs(y-end) + 1)] += 1
print("\n".join(map(str, lengths[1:]))) |
p02645 | s346634653 | Wrong Answer | import random
S = input()
ch_l = []
for i in range(0, len(S)):
ch_l.append(S[i])
x = "".join(random.sample(ch_l, 3))
print(x) |
p02833 | s983235879 | Accepted | import sys
input = sys.stdin.readline
I=lambda:int(input())
MI=lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
N=I()
if N%2:
print(0)
else:
res=0
i=1
while 1:
dr=N//(2*5**i)
if dr:
res+=dr
else:
break
i+=1
print(res)
|
p03951 | s965589039 | Accepted | N = int(input())
s = list(input())
t = list(input())
cnt = 0
if s==t:
ans = N
cnt = 1
elif N==1:
ans = N*2
cnt = 1
else:
for i in range(N):
if s[i:]==t[:-i]:
cnt = 1
ans = N*2 - (N-i)
print(ans) if cnt==1 else print(N*2) |
p03071 | s571955858 | Wrong Answer | a,b = map(int,input().split())
s = max(2*a,2*b,a+b)
print(s-1) |
p02699 | s098487948 | Wrong Answer | N,W = list(map(int,input().split()))
if N >= W:
print("safe")
else:
print("unsafe") |
p02623 | s744362938 | Accepted | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [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) |
p03262 | s277700915 | Accepted | import fractions
def main():
n, x = [int(e) for e in input().split()]
X = [int(e) for e in input().split()]
ans = abs(x - X[0])
for xi in X:
ans = fractions.gcd(abs(x - xi), ans)
print(ans)
if __name__ == "__main__":
main()
|
p03150 | s986260429 | Accepted | #15 B - KEYENCE String
S = list(input())
result = 'NO'
for i in range(len(S)):
Scpy = S.copy()
for j in range(i,len(S)):
Scond = Scpy[:i]+Scpy[j:]
if (''.join(Scond)) == ('keyence'):
result = 'YES'
break
else:
continue
break
print(result) |
p02598 | s200027980 | Wrong Answer | n,k,*a = map(int,open(0).read().split())
def func(b):
c = k
for i in a:
if b == 0:
c -= i
else:
c -= (i-1)//b
if c < 0:
return False
return True
l = 0
r = max(a)
while(r>l):
lr = (l+r)//2
if func(lr):
r = lr
else:
l = lr + 1
print(r) |
p03150 | s300425914 | Accepted | S = input()
l = len(S)
if 'keyence' in S:
print('YES')
exit()
for i in range(6):
check = S[:i+1] + S[i+(l-7)+1:]
if check == 'keyence':
print('YES')
exit()
print('NO')
exit() |
p02554 | s065364406 | Accepted | import sys, math
from functools import lru_cache
sys.setrecursionlimit(10**9)
MOD = 10**9+7
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp)]
def main():
N = ii()
ans = pow(10, N, MOD)
ans -= pow(9, N, MOD)
ans -= pow(9, N, MOD)
ans += pow(8, N, MOD)
print(ans%MOD)
if __name__ == '__main__':
main()
|
p03386 | s484540819 | Wrong Answer | a,b,k = map(int,input().split())
n = b - a + 1
if n <= k*2:
for i in range(a,b+1):
print(i)
else:
for i in range(a,k+1):
print(i)
for j in range(b-k+1,b+1):
print(j) |
p02971 | s547051542 | Accepted | n=int(input())
a=list()
for i in range (n):
a.append(int(input()))
new_a_reverse=sorted(a,reverse=True)
max=new_a_reverse[0]
max2=new_a_reverse[1]
for i in a:
if(i==max):
print(max2)
else:
print(max)
|
p03472 | s722902664 | Wrong Answer | import math
N, H = map(int, input().split())
swords = [list(map(int, input().split())) for _ in range(N)]
swords_T = [list(x) for x in zip(*swords)]
#print(swords_T)
swing_max = max(swords_T[0])
order = sorted(swords_T[1])
#print(order)
count = 0
while H > 0 and len(order) != 0:
tmp = order.pop()
if tmp > swing_max:
H -= tmp
count += 1
#print(f'{H=}')
count += math.ceil(H/swing_max)
print(count)
|
p03804 | s791354263 | Accepted | N,M = map(int,input().rstrip().split(" "))
A = []
B = []
ans = False
for i in range(N):
A.append(list(input()))
for i in range(M):
B.append(list(input()))
for i in range(N - M + 1):
for i2 in range(N - M + 1):
for i3 in range(M):
if A[i3 + i][i2:i2 + M] != B[i3]:
break
if i3 == M -1:
ans = True
if ans:
print("Yes")
else:
print("No") |
p02548 | s540826282 | Accepted | N = int(input())
ans = 0
for a in range(1, N):
ans += (N - 1) // a
print(ans)
|
p02971 | s214047103 | Accepted | import copy
N = int(input())
ary = []
for _ in range(N):
ary.append(int(input()))
ary_copy = copy.copy(ary)
ary_copy.sort()
max_1 = ary_copy[-1]
max_2 = ary_copy[-2]
for i in ary:
if i == max_1:
print(max_2)
elif i != max_1:
print(max_1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.