problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03449 | s836099916 | Accepted | N=int(input())
A1= list(map(int, input().split()))
A2= list(map(int, input().split()))
ans = [0]*N
for i in range(N):
ans[i] += sum(A1[:i+1])
#print(i,':', 'sum:',ans[i])
ans[i] += sum(A2[i:])
#print(i,':', 'sum:',ans[i])
print(max(ans))
|
p02786 | s238101897 | Accepted | from math import log2
h = int(input())
print(2 ** (int(log2(h)) + 1) - 1)
|
p03221 | s221336494 | Accepted | N,M=map(int,input().split())
P=[list(map(int,input().split())) for _ in range(M)]
for i in range(M):
P[i].append(i)
P.sort()
j=1
k=0
for i in range(M):
k+=1
if P[i][0]!=j:
j=P[i][0]
k=1
s=str(j)
while len(s)!=6:
s='0'+s
t=str(k)
while len(t)!=6:
t='0'+t
P[i].append(s+t)
P.sort(key=lambda... |
p02595 | s269354969 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, d = map(int, readline().split())
ans = 0
for _ in range(n):
x, y = map(int, readline().split())
if (x ** 2 + y ** 2) <= d ** 2:
ans += 1
print(ans... |
p02759 | s783775810 | Accepted | #Macで実行する時
import sys
import os
if sys.platform=="darwin":
base = os.path.dirname(os.path.abspath(__file__))
name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
sys.stdin = open(name)
from math import ceil
n = int(input())
print(ceil(n/2))
|
p03835 | s747800273 | Accepted | k,s = map(int,input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
if 0 <= s-i-j <= k:
ans += 1
print(ans) |
p03146 | s985379874 | Wrong Answer | s = int(input())
def f(n):
if n % 2 == 0:
return n//2
else:
return 3*n+1
cnt = 1
k = s
while(True):
if k == 4:
ans = cnt+3
break
k = f(k)
cnt += 1
print(ans) |
p02687 | s110040892 | Wrong Answer | a = ["ABC","ARC"]
print(a[input() == "ARC"]) |
p02773 | s088342594 | Wrong Answer | from collections import Counter
n = int(input())
l = [input() for i in range(n)]
l.sort()
c = Counter(l)
max = c.most_common()[0][1]
for k, v in c.most_common():
if v == max:
print(k)
else:
exit() |
p03494 | s037927178 | Accepted | N = input()
A = list(map(int, input().split()))
cnt = 0
while True:
for i in A:
if i%2 != 0:
print(cnt)
exit()
A = [x/2 for x in A]
cnt += 1
|
p02842 | s211022587 | Wrong Answer | N = int(input())
import math
import sys
for i in range(1, N):
cur = math.floor(i * 1.08)
if cur == N:
print(i)
sys.exit()
if cur > N:
break
print(":(") |
p03639 | s743707848 | Accepted | N = int(input())
A = list(map(int, input().split()))
x = 0
y = 0
z = 0
for i in range(N):
a = A[i]
c = 0
while a%2== 0:
a = a//2
c += 1
if c == 0:
x += 1
elif c == 1:
y += 1
else:
z += 1
ans = 'No'
if x<=z:
ans = 'Yes'
elif y == 0 and x==z+1:
ans = 'Yes'
print(ans)
|
p02553 | s247599770 | Accepted | a,b,c,d = map(int,input().split())
ans = max(a*c,a*d,b*c,b*d)
print(ans) |
p03162 | s312849254 | Accepted | N = int(input())
v = [[0]*3 for _ in range(N)]
for i in range(N):
a = list(map(int,input().split()))
for k in range(3):
v[i][k] = a[k]
dp = [[0]*3 for _ in range(N+1)]
for i in range(1, N+1):
for j in range(3):
for k in range(3):
if j != k:
dp[i][j] = max(dp[i][j], dp[i-1][k] + v[i-1][j])
pr... |
p03371 | s190623381 | Accepted | A, B, C, X, Y = map(int, input().split())
ans = X * A + Y * B
for nab in range(2, max(X, Y) * 2 + 2, 2):
price = nab * C
price += max(X - (nab // 2), 0) * A
price += max(Y - (nab // 2), 0) * B
ans = min(ans, price)
print(ans) |
p03723 | s736799441 | Accepted | a, b, c = map(int, input().split())
cnt = 0
while True:
# print(a, b, c)
x, y, z = a, b, c
if x % 2 == 1 or y % 2 == 1 or z % 2 == 1:
break
if x == y and y == z and z == x:
cnt = -1
break
x, y, z = a/2, b/2, c/2
a, b, c = y+z, z+x, x+y
cnt += 1
print(cnt)
|
p02546 | s397070402 | Wrong Answer |
S = input("Enter String: ")
if S.endswith('s') :
output = S + "es"
else :
output = S + "s"
print(output)
|
p04012 | s506325668 | Wrong Answer | w = input()
sw = set(w)
for s in sw:
if w.count(s) != 2:
print("No")
exit(0)
print("Yes")
|
p02711 | s941621029 | Accepted | n = input()
if n.count("7") >= 1:
print("Yes")
else:
print("No") |
p02689 | s321237099 | Accepted | n, m = map(int, input().split())
h = [int(x) for x in input().split()]
ans = [True] * n
for i in range(m):
a, b = map(int, input().split())
if h[a-1] < h[b-1]:
ans[a-1] = False
elif h[a-1] > h[b-1]:
ans[b-1] = False
else:
ans[a-1] = False
ans[b-1] = False
print(ans.count(... |
p02612 | s095994736 | Accepted | N = int(input())
ans = N%1000
if ans != 0:
ans = abs(1000-ans)
print(ans) |
p03220 | s244206516 | Wrong Answer | N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
h=abs(A-(T-(H[0]*0.006)))
m=1
for i in range(1,N):
if h>abs(A-(T-(H[i]*0.006))):
m=i+1
print(m) |
p02595 | s735080357 | Accepted | import math
n, d = map(int, input().split())
count = 0
for i in range(n):
x, y = map(int, input().split())
if math.sqrt(x**2 + y**2) <= d:
count += 1
print(count)
|
p02779 | s117165759 | Accepted | import collections
_ = input()
_list = input()
num_list = _list.split(' ')
c = collections.Counter(num_list)
if c.most_common()[0][1] > 1:
print('NO')
else:
print('YES') |
p02953 | s573550756 | Accepted | import sys
N=int(input())
H=[int(x) for x in input().rstrip().split()]
flag=0
mi=-1
for i in range(N-1):
if H[i]<=H[i+1] and mi<=H[i]:
mi=max(mi,H[i]-1)
continue
elif H[i+1]<H[i]:
H[i]=H[i]-1
mi=max(mi,H[i])
if H[i+1]<H[i] or H[i]<mi:
flag=1
print("No")
sys.exit()
if flag==0:
prin... |
p02881 | s404756835 | Accepted | n = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
lis = make_divisors(n)
a = lis.pop()
b = n//a
ans = a+b-2
p... |
p03779 | s609069142 | Accepted | x = int(input())
cnt = 0
for i in range(1, 10**10):
cnt += i
if x <= cnt:
print(i)
exit() |
p02778 | s381564668 | Accepted | def A():
temp = input().split()
S = temp[0]
T = temp[1]
temp = [int(i) for i in input().split()]
A = temp[0]
B = temp[1]
U = input()
if U == S:
print(A-1, B)
else:
print(A, B-1)
def B():
print('x'*len(input()))
B() |
p03352 | s602494098 | Accepted | X = int(input())
ans = 0
for i in range(1,1000):
for j in range(2,1000):
if i**j <= X:
ans = max(ans,i**j)
else:
break
print(ans) |
p02572 | s990383341 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
s=0
t=0
for i in range (0,N):
s=s+a[i]
t=t+(a[i])**2
print(int(((s**2-t)/2)%(10**9+7))) |
p02606 | s553237747 | Accepted | L, R, d = map(int, input().split())
count = 0
for i in range(L, R + 1):
if i % d == 0:
count = count + 1
print(count) |
p02747 | s566477522 | Accepted | S = str(input())
if S in [ "hi"*x for x in range(1,6) ]:
print("Yes")
else:
print("No") |
p03103 | s526079569 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
N, M = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort(key = lambda x: x[0])
ans = 0
for i in range(N):
if AB[i][1] >= M:
ans += AB[i][0] * M
print (ans)
break... |
p02767 | s425698084 | Accepted | #!/usr/bin/env python
from collections import deque, defaultdict
import bisect
def comb(a, b):
result = 1
for i in range(b):
result *= (a - i) / (i + 1)
return result
def main():
N = int(input())
Xs = list(map(int, input().split()))
min_load = None
for p in range(101):
l... |
p04034 | s917539811 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N,M,*xy = map(int, read().split())
check = [False] * N
check[0] = True
num = [1] * N
for x, y in zip(*[iter(xy)]*2):
num[x-1] -= 1
num[y-1] += 1
if check[x-1]:
... |
p02818 | s669831696 | Accepted | A,B,K = map(int,input().split())
A,K = A-K, K-A
if A < 0:
A = 0
elif K < 0:
K = 0
B = B-K
if B < 0:
B = 0
print(A,B)
|
p02797 | s046091102 | Accepted | n,k,s=map(int,input().split())
a=[]
for i in range(n):
if i < k:
a.append(s)
elif s<10**9:
a.append(s+1)
else:
a.append(1)
print(*a) |
p03001 | s369619801 | Wrong Answer | w, h, x, y = list(map(int, input().split()))
# a = list(map(int, input().split()))
# data = [list(map(int, input().split())) for i in range(n)]
# k = int(input())
#L = list(map(int, input().split()))
# ab_sorted = sorted(ab, key=lambda x: x[0])
#ab = [list(map(int, input().split())) for i in range(n)]
# print(min(15*n,... |
p03261 | s192982681 | Accepted | n=int(input())
w=input()
s={w}
for i in range(n-1):
ww=input()
if w[-1]!=ww[0] or ww in s:print("No");exit()
w=ww
s.add(w)
print("Yes") |
p03481 | s498676754 | Accepted | a, b = map(int, input().split())
count = 0
while a <= b:
count += 1
a *= 2
print(count) |
p03208 | s670842199 | Accepted | n,k=map(int, input().split())
h=[]
for i in range(n):
h.append(int(input()))
h.sort()
ans=h[k-1]-h[0]
for i in range(1,n-k+1):
ans=min(ans,h[i+k-1]-h[i])
print(ans) |
p03817 | s869780479 | Accepted | N = int(input())
if N%11 == 0:
print(N//11*2)
elif 0 < N%11 <=6 :
print(N//11*2+1)
else:
print(N//11*2+2) |
p03797 | s774606126 | Accepted | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import defaultdict, deque, Counter
fr... |
p03371 | s637474209 | Wrong Answer | a, b, c, x, y = map(int, input().split())
cost = 0
for i in range(min(x, y)):
if a + b > 2 * c:
cost += 2 * c
else:
cost += a + b
for i in range(abs(x - y)):
if a < 2 * c:
cost += a
elif b < 2 * c:
cost += b
else:
cost += 2 * c
print(cost) |
p02645 | s852609206 | Wrong Answer | S = input()
print(S[ :2: 1]) |
p03251 | s224641398 | Accepted | n, m, x, y = map(int, input().split())
if x>y :
print('War')
else :
X = sorted(list(map(int, input().split())))
Y = sorted(list(map(int, input().split())))
a = 0
for i in range(x+1, y+1):
if X[-1]<i and i <= Y[0] and x < i and i <= y:
print('No War')
break
el... |
p02933 | s793447404 | Accepted | a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print('red') |
p03487 | s341502598 | Accepted | n = int(input())
a_list = list(map(int,input().split()))
import collections
c = collections.Counter(a_list)
result = 0
for key in c:
if c[key] > key:
result += c[key] - key
elif c[key] < key:
result += c[key]
print(result) |
p02833 | s228568886 | Accepted | def main():
n = int(input())
if n % 2:
print(0)
else:
n //= 2
i = 5
answer = 0
while i <= n:
answer += n // i
i *= 5
print(answer)
if __name__ == '__main__':
main()
|
p03360 | s403184280 | Accepted | x=list(map(int,input().split()))
k=int(input())
x.sort()
x[-1]=x[-1]*(2**k)
print(sum(x)) |
p03486 | s357775442 | Accepted | s_min = sorted(input())
t_max = sorted(input())[::-1]
print("Yes" if s_min < t_max else "No") |
p02675 | s067273174 | Accepted | a = int(input())
if a % 10 in [2,4,5,7,9]:
print('hon')
elif a % 10 in [0,1,6,8]:
print('pon')
else:
print('bon') |
p03699 | s412835874 | Accepted | N = int(input())
S = [0 for _ in range(N)]
SUM = 0
for n in range(N):
next = int(input())
SUM += next
S.append(next)
if SUM % 10 != 0:
print(SUM)
exit()
S.sort()
for s in S:
if s % 10 != 0:
print(SUM-s)
exit()
print(0)
|
p03821 | s183768089 | Wrong Answer | # coding: utf-8
import math
import copy
import bisect
from collections import deque
n = int(input())
L=[]
A=[]
B=[]
for i in range(n):
a, b = map(int,input().split())
if b-a>=0:
L.append(b-a)
else:
L.append(math.ceil(a/b)*b-a)
A.append(a)
B.append(b)
cnt=0
for i in range(n-1,-1,-1):
... |
p02584 | s768411662 | Wrong Answer | X, K, D = map(int, input().split())
scnt = abs(X) // D
if K <= scnt:
if X > 0:
print(X - K * D)
else:
print(X + K * D)
else:
if X % D == 0:
if (K - scnt) % 2 == 0:
print(D)
else:
print(0)
else:
if (K - scnt) % 2 == 0:
print(X - ... |
p02724 | s151117211 | Accepted | X = int(input())
happiness = 0
while X > 0:
if X >= 500:
temp = int(X / 500)
X = X - (500 * temp)
happiness = 1000 * temp
else:
temp = int(X / 5)
X = X - (500 * temp)
happiness = happiness + (5 * temp)
break
print(happiness) |
p02823 | s377771243 | Wrong Answer | N, A, B = map(int, input().split())
if (B-A) % 2 == 0:
print( (B-A) // 2 )
else:
print( min([N-A, B-1]) ) |
p02759 | s204253620 | Wrong Answer | n = int(input())
print(n//2) |
p02691 | s654982762 | Accepted |
N=int(input())
*A,=map(int,input().split())
ref,count={},0
for i,a in enumerate(A):
if i-a in ref:
count += ref[i-a]
if i+a in ref:
ref[i+a]+=1
else:
ref[i+a]=1
print(count) |
p02661 | s804337461 | Wrong Answer | import statistics
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
if N % 2 == 1:
med_min = A[N // 2]
med_max = B[N // 2]
print(med_max - med_min + 1)
else:
med_min_db = A[N // 2] + A[N // 2 - 1]
med_max_db = B[N // 2] + B[N // 2 - 1]
prin... |
p03071 | s301168296 | Accepted | a,b = map(int, input().split())
mx = max(a,b)
mn = min(a,b)
print(max(2 * mx - 1, mx + mn)) |
p03282 | s859184550 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s=input()
k=int(input())
for i in range(min(100,k)):
if s[i]!='1':
print(s[i])
break
else:print(1)
if __name__=='__main__':
main() |
p02701 | s371261595 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
l = []
l_append = l.append
for _ in range(n):
s = input()
l_append(s)
print(len(l)) |
p02958 | s968592805 | Wrong Answer | n=int(input())
l=[int(x) for x in input().split()]
cnt=0
x=0
y=0
b=0
for i in range(n):
if(i+1!=l[i]):
cnt+=1
if(cnt==1):
x=l[i]
elif(cnt==2):
y=l[i]
else:
b=1
break
if(b==1):
print("NO")
elif(l[x-1]!=y and l[y-1]!=x):
print("NO... |
p03416 | s814183175 | Wrong Answer | a,b = input().split()
count = 0
anum = int(a)
bnum = int(b)
# a = list(a)
# b = list(b)
for i in range(anum,bnum):
stra = str(i)
if stra[0:2] == stra[3:5]:
count += 1
print(count) |
p02554 | s510566895 | Accepted | n = int(input())
p = 10**9+7
##0も9もない
temp = pow(8, n, p)
#0がない
tempp = pow(9,n,p)
#全体
temppp = pow(10,n,p)
res = (temppp-tempp*2 + temp) % p
print(res) |
p02973 | s451817884 | Wrong Answer | N = int(input())
A = []
for i in range(N):
a = int(input())
A.append(a)
AA = set(A)
count = 1
b = A[-1]
for i in reversed(range(N-1)):
if A[i]>b:
b = A[i]
count+=1
print(count+len(A)-len(AA)) |
p02748 | s631998910 | Accepted | A, B, M = map(int, input().split())
AList = list(map(int, input().split(' ', A)))
BList = list(map(int, input().split(' ', B)))
result = 10 ** 10
DisList = []
for i in range(M):
tmpList = list(map(int, input().split()))
if result > AList[tmpList[0] - 1] + BList[tmpList[1] - 1] - tmpList[2]:
result = A... |
p02796 | s585427007 | Accepted | def solve():
n = int(input())
x, l = [0]*n, [0]*n
for i in range(n):
x[i], l[i] = map(int, input().split())
hoge = []
for i in range(n):
hoge.append([x[i]+l[i], x[i]-l[i]])
hoge.sort()
t = -1000000000000000000000
ans = 0
for i in range(n):
if t <= hoge[i][1]:
... |
p03042 | s603482752 | Accepted | s = input()
fore = int(str(s[0]) + str(s[1]))
aft = int(str(s[2]) + str(s[3]))
if 1 <= fore <= 12:
if 1 <= aft <= 12:
print('AMBIGUOUS')
else:
print('MMYY')
elif 1 <= aft <= 12:
print('YYMM')
else:
print('NA') |
p02790 | s140735947 | Wrong Answer | def LI():
return [int(s) for s in input().split()]
a,b = LI()
if a <= b:
print(str(a)*a)
else:
print(str(b)*b)
|
p03136 | s866992823 | Accepted | n = int(input())
l = list(map(int, input().split()))
m = max(l)
s = sum(l)
if m < s-m:
print("Yes")
else:
print("No") |
p03161 | s728580360 | Accepted | # coding: utf-8
import numpy as np
n, k = map(int, input().split())
h_list = np.array([int(x) for x in input().split()])
ans = np.zeros(n, dtype=int)
for i in range(1, n):
start = max(i-k, 0)
ans[i] = np.min(ans[start:i] + np.abs(h_list[start:i] - h_list[i]))
# print(ans)
print(ans[-1]) |
p03417 | s551141966 | Wrong Answer | n,m=map(int,input().split())
ans = 0
if n == m == 1:
ans = 1
elif n == 1 or m == 1:
ans = max(n,m)-2
else:
ans =(n-2)*(m*2)
print(ans) |
p02546 | s857657631 | Accepted | S = input()
if S[-1] == 's':
ans = S + 'es'
else:
ans = S + 's'
print(ans) |
p03137 | s094874646 | Accepted | n,m=map(int,input().split())
X=list(map(int,input().split()))
X.sort()
#print(X)
l=[]
for i in range(m-1):
l.append(X[i+1]-X[i])
#print(l)
l.sort()
ans=0
for i in range(m-1-n+1):
ans+=l[i]
print(ans) |
p02572 | s886137652 | Wrong Answer | import sys
n = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
# for i in range(n-1):
# for j in range(i+1,n):
# ans += A[i]*A[j]
# ans %= mod
sum = 0
for i in A:
sum += i
sum %= mod
ans = sum * sum
for j in A:
ans -= j * j
ans %= mod
ans //= 2
print(a... |
p03162 | s528027571 | Wrong Answer | import numpy as np
N = int(input())
abc = []
for i in range(N):
abc.append([int(i) for i in input().split()])
abc.append([0,0,0])
dp = np.zeros([N+1,3])
print(dp)
for i in range(1,N+1):
dp[i][0],dp[i][1],dp[i][2] = max(dp[i-1][1]+abc[i-1][0], dp[i-1][2]+abc[i-1][0]), max(dp[i-1][0]+abc[i-1][1], dp[i-1][2]+abc[i-1]... |
p02658 | s374900482 | Accepted | n=int(input())
l=list(map(int,input().split()))
a=l[0]
for i in range(1,n):
a*=l[i]
if a>10**18:
break
if a>10**18 and l.count(0)==0:
print(-1)
elif l.count(0)>0:
print(0)
else:
print(a) |
p03760 | s450728275 | Accepted | O = input()
E = input() + ' '
P = ''
for i in range(len(O)):
P += O[i] + E[i]
print(P.rstrip()) |
p02548 | s007455384 | Accepted | N = int(input())
memo = [1]*(N)
memo[0] = 0
ans = 0
for i in range(2,N):
tmp = i
while tmp < N:
memo[tmp] += 1
tmp += i
print(sum(memo)) |
p02832 | s960698736 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
now=1
for i in range(n):
if a[i]==now:
now+=1
if now==1:
print(-1)
elif now==n:
print(0)
else:
print(n-now+1) |
p02608 | s455571800 | Wrong Answer | #C
import math
N = int(input())
count = [0] * (10010)
for j in range(1, 100):
for k in range(1, 100):
for l in range(1, 100):
v = (j+k+l) ** 2 - (j*k + k*l + l*j)
if v <= 10000:
count[v] += 1
for i in range(1, N):
print(count[i]) |
p02596 | s014764951 | Accepted | k = int(input())
mod = 0
for i in range(1, 10**6):
mod = ((mod * 10) + 7) % k
if mod == 0:
print(i)
exit()
print(-1) |
p03799 | s715165306 | Wrong Answer | n,m=map(int,input().split())
print(min(2*m,(2*n+m)//4)) |
p02727 | s009403181 | Accepted | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
a = p[:X]
b = q[:Y]
a.extend(b)
a.extend(r)
a.sort(reverse=True)
print(sum(a[:X+Y]))
|
p03328 | s560868700 | Accepted | import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))
def main():
a, b = nm()
print(sum(range(1, b - a)) - a)
if __name__ == '__ma... |
p04020 | s239372232 | Wrong Answer | n=int(input())
a=[int(input()) for _ in range(n)]
ans=0
for i in range(n-1):
if a[i]==a[i+1] and a[i]%2==1:
ans+=a[i]
a[i+1]=0
else:
ans+=int(a[i]/2)
ans+=int(a[n-1]/2)
print(ans)
|
p03105 | s014394175 | Wrong Answer | A,B,C=map(int,input().split())
print(min(A+B,B+C,A+C)) |
p02571 | s407284079 | Accepted | s =input()
t = input()
len_s = len(s)
len_t = len(t)
ans = 10**10
for i in range(len_s-len_t+1):
cnt = 0
for j in range(len_t):
if s[i+j]!=t[j]:
cnt+=1
ans = min(cnt,ans)
print(ans)
|
p02823 | s594193131 | Accepted | n, a, b = [int(i) for i in input().split()]
if (b - a) % 2 == 0:
print((b - a) // 2)
else:
print(min(a - 1, n - b) + 1 + (b - a - 1) // 2) |
p02642 | s150314452 | Wrong Answer | N = int(input())
A_n = sorted(list(set(map(int, input().split(' ')))), reverse=True)
if len(A_n) == 1:
print('0')
else:
count = len(A_n)
for i in range(len(A_n)-1):
for j in range(i+1, len(A_n)):
if A_n[i]%A_n[j] == 0:
# print(str(A_n[i]) + ' ' + str(A_n[j]))
... |
p02615 | s355398253 | Accepted | n = int(input())
As = list(map(int, input().split()))
As.sort(reverse=True)
if (len(As) % 2 == 0):
ans = sum(As[:len(As) // 2] * 2) - As[0]
else:
ans = sum(As[:(len(As) + 1) // 2]) * 2 - As[len(As) // 2] - As[0]
print(ans) |
p02963 | s226828061 | Accepted | from sys import stdin
s = int(stdin.readline().rstrip())
if s == 10**18:
print(0,0,10**9,0,0,10**9)
exit()
a = s//10**9+1
b = 10**9-s%10**9
print(0,0,10**9,1,b,a) |
p03951 | s280186467 | Accepted | N = int(input())
s = input()
t = input()
for i in range(N):
tmp_s = ''
tmp_t = ''
for k in range(i,N):
tmp_s += s[k]
for k in range(0,N-i):
tmp_t += t[k]
if tmp_s == tmp_t:
print(2*N-len(tmp_s))
exit()
print(2*N) |
p03239 | s022888834 | Wrong Answer | N, T = map(int, input().split())
c, t = list(map(int, input().split()))
ans = 1001
for i in range(N):
if T > t and c < ans:
ans = c
if ans == 1000:
print("TLE")
else:
print(ans) |
p03804 | s596039495 | Wrong Answer | def resolve():
n, m = map(int, input().split())
A = []
B = ''
ans = "No"
for _ in range(n):
A.append(input())
for _ in range(m):
B += input()
for i in range(n-m):
for j in range(n-m):
tmp = ''
for k in range(m):
tmp += A[i+k][j:j+m]
if tmp == B:
ans = 'Yes'
print(ans)
resolve() |
p03471 | s550331364 | Accepted | def solve():
n, y = map(int, input().split())
r = range(n+1)
ans = "-1 -1 -1"
for i in r:
for j in r:
k = (y-(10000*i+5000*j))//1000
if k >= 0 and 10000*i+5000*j+1000*k == y and i+j+k == n:
ans = "{} {} {}".format(i, j, k)
print(ans)
... |
p02706 | s889983226 | Wrong Answer | n,m=map(int,input().split())
A = list(map(int, input().split()))
A = sum(A)
ans = n-A
print(ans) |
p03017 | s125171189 | Accepted | N, A, B, C, D = map(int, input().split())
A, B, C, D = A-1, B-1, C-1, D-1
S = input() + "###"
def chk(l, r):
for i in range(l, r-1):
if S[i:i+2] == "##":
return 0
return 1
def chk3(l, r):
for i in range(l, r):
if S[i:i+3].count("#") == 0:
return 1
return 0
if ch... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.