problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02577 | s915960828 | Wrong Answer | N = str(input())
ans = 0
for i in N:
ans += int(i)
if ans%9 == 0:
print("yes")
else:
print("no") |
p03835 | s183929504 | Accepted | k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - x - y <= k:
ans += 1
print(ans) |
p02725 | s843348498 | Accepted | k, n = map(int, input().split())
a = list(map(int, input().split()))
l = len(a)
dis = [None] * l
for i in range(n - 1):
dis[i] = a[i + 1] - a[i]
dis[-1] = a[0] - a[-1] + k
ans = sum(dis) - max(dis)
print(ans) |
p02600 | s676546379 | Accepted | x = int(input())
if x>=400 and x<=599:
print(8)
elif x>=600 and x<=799:
print(7)
elif x>=800 and x<=999:
print(6)
elif x>=1000 and x<=1199:
print(5)
elif x>=1200 and x<=1399:
print(4)
elif x>=1400 and x<=1599:
print(3)
elif x>=1600 and x<=1799:
print(2)
elif x>=1800 and x<=1999:
print(1) |
p03565 | s005240953 | Wrong Answer | S = input()
T = input()
A = ''
for i in range(len(S)):
if S[i] == T[0]:
A += T
break
A += S[i]
if A == S:
print('UNRESTORABLE')
exit()
ans =''
for a in A:
if a == '?':
a = 'a'
ans += a
print(ans) |
p03371 | s606398666 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = 0
if a + b > c * 2:
ans += (c * 2) * min(x,y)
if x > y:
ans += a * (x-y)
if ans > (c * 2) * max(x,y):
ans = (c * 2) * max(x,y)
elif y > x:
ans += b * (y-x)
if ans > (c * 2) * max(x,y):
ans = (c * 2) * max(x,y)
elif a + b < c * 2:
ans += (a * x) + (b * y)
print(ans) |
p03475 | s784917981 | Wrong Answer | ma = lambda : map(int,input().split())
ni = lambda : int(input())
import math
ceil = math.ceil
n = ni()
csf = []
for i in range(n-1):
csf.append(tuple(ma()))
for i in range(n-1):
ans = csf[i][1] + csf[i][0]
for j in range(i+1,n-1):
if ans<=csf[j][1]:
ans =csf[j][1]+csf[j][0]
else:
ans = math.ceil(ans/csf[j][2]) +csf[j][0]
print(ans)
print(0)
|
p02780 | s672696578 | Wrong Answer | def DE(n):
return float((float(n)+1)/2)
def main():
N,K = map(int,input().split())
p = list(map(DE,input().split()))
ans = sum(p[:K])
for i in range(K,N):
ans = max(ans,(ans+p[i]-p[i-K]))
print(ans)
if __name__ == '__main__':
main()
|
p03711 | s240611688 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
l1 = [1,3,5,7,8,10,12]
l2 = [4,6,9,11]
x,y = iim()
if (x in l1 and y in l2) or (x in l2 and y in l2):
print('Yes')
else:
print('No') |
p02993 | s876558784 | Accepted | S = input()
print('Bad' if S[0] == S[1] or S[1] == S[2] or S[2] == S[3] else 'Good') |
p04045 | s076676305 | Accepted | n, k, *d = open(0).read().split()
n, d = int(n), set(d)
while True:
if not d & set(str(n)):
exit(print(n))
n += 1 |
p02675 | s304702973 | Accepted | N = int(input())
if N % 10 == 3:
print('bon')
elif N % 10 == 0 or N % 10 == 1 or N % 10 == 6 or N % 10 == 8:
print('pon')
else:
print('hon') |
p02612 | s381785022 | Accepted | N = int(input())
if(N%1000 == 0):
print(0)
else :
print(1000 - N%1000) |
p02726 | s630283973 | Wrong Answer | N,X,Y = map(int,input().split())
A = [0]*(N-1)
mi = 0
for i in range(1,N+1):
for j in range(1,N+1):
if i < j :
mi = min(j-i,(abs(X-i)+abs(Y-j)+1))
A[mi-1] += 1
print(mi)
for i in range(N-1):
print(A[i]) |
p03544 | s818934860 | Accepted | n = int(input())
l = [0] * 100
l[0] = 2
l[1] = 1
for i in range(2, 99):
l[i] = l[i-1] + l[i-2]
print(l[n]) |
p04044 | s526463674 | Accepted | def resolve():
# 整数 1 つ
# n = int(input())
# 整数複数個
n, l = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
S = [input() for i in range(n)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
#S = [list(map(str, input().split())) for i in range(n)]
Ssort = sorted(S)
print("".join(Ssort))
resolve() |
p03069 | s412595993 | Wrong Answer | N = int(input())
S = input()
if '.' not in S:
print(0)
exit()
elif '#' not in S:
print(0)
exit()
black_sum = 0
white_sum = 0
for i in range(N):
if S[i] == '#':
black_sum += 1
else:
white_sum += 1
left_black = 0
right_white = white_sum
min_sum = 10 ** 9
for i in range(N - 1):
if S[i] == '#':
left_black += 1
else:
right_white -= 1
min_sum = min(min_sum, left_black + right_white)
print(min_sum)
|
p02627 | s450008477 | Wrong Answer | a=input()
print('A' if a.islower else 'a') |
p03612 | s917263641 | Accepted | n = int(input())
p = list(map(int, input().split())) + [0]
cnt = 0
j = False
for i in range(n):
if p[i] == i + 1:
cnt += 1
if p[i + 1] == i + 2:
if j == False:
cnt -= 1
j = True
else:
j = False
else:
j = False
print(cnt) |
p02657 | s260617069 | Accepted | a, b = map(int, input().split())
print(a*b) |
p02681 | s279313299 | Accepted | s = input()
t = input()
print ("Yes") if s == t[0:len(s)] else print ("No")
|
p02854 | s875290755 | Accepted | def modelAnswer(N:int,A:list) -> int:
T1 = [A[0]]
T2 = [sum(A)]
for i in range(1,N):
T1.append(T1[-1]+A[i])
T2.append(T2[0] - T1[i-1])
# print(T1,T2)
ans = 10**10
for i in range(len(T1)-1):
# print(abs(T1[i]-T2[i+1]))
ans = min(ans,abs(T1[i]-T2[i+1]))
return ans
def main():
N = int(input())
A = list(map(int,input().split()))
print(modelAnswer(N,A[:]))
if __name__ == '__main__':
main()
|
p03030 | s528362231 | Accepted | from operator import itemgetter
n = int(input())
sp = [[] for _ in range(n)]
for i in range(n):
s, p = input().split()
p = -int(p)
sp[i] = [s, p, i + 1]
sp.sort(key=itemgetter(0, 1))
for i in range(n):
print(sp[i][2])
|
p03281 | s194142332 | Wrong Answer |
n = int(input())
ret = 0
for j in range(1,n+1):
cnt = 0
for i in range(1,j+1):
if n % i == 0:
cnt += 1
if cnt == 8:
ret += 1
print(ret) |
p02726 | s226508158 | Wrong Answer | N,X,Y =map(int,input().split())
def solve(k):
global N
global X
global Y
count = 0
count = N-k
if count<0:
count = 0
for i in range(N):
p = i+1
if abs(X-p)+1+N-Y>=k and abs(X-p)+1<=k:
count += 1
if abs(X-p)+1+(Y-p)>k and abs(X-p)+1<=k:
count += 1
print(count)
for i in range(N-1):
solve(i+1) |
p02570 | s163310272 | Wrong Answer | a, b, c = map(int, input().split())
if b * c >= a:
print("yes")
else:
print("no") |
p03105 | s280066681 | Wrong Answer | A, B, C = map(int, input().split())
if B >= A*C:
print(A*C)
else:
print(B//A) |
p03485 | s965215377 | Wrong Answer | a,b = map(int, input().split())
ans = int(round((a+b)/2,0))
print(ans) |
p03419 | s240141693 | Wrong Answer | n, m = map(int, input().split())
if n==1 and m==1:
print(1)
elif n==1 and m!=1:
print(m-2)
else:
print((n-2)*(m-2)) |
p03633 | s301139516 | Accepted | from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
def f(a,b):
return a*b//math.gcd(a,b)
ans = 1
n = readInt()
for j in [readInt() for i in range(n)]:
ans = f(ans,j)
print(ans) |
p02660 | s315174242 | Wrong Answer | n = int(input())
s = []
for i in range(2, int(n**0.5)):
t = 0
while n%i == 0:
n //= i
t += 1
s.append(t)
if n == 1: break
if n > 1: s.append(1)
ans = 0
for i in s:
for j in range(1, i+1):
if i >= j:
i -= 1
ans += 1
else:
break
print(ans) |
p02786 | s243356165 | Wrong Answer | H = int(input())
if H==1:
print(1)
elif 2 <= H and H <= 3:
print(3)
elif 4 <= H and H <= 7:
print(7)
else:
for i in range (1,43):
if 2**(i-1)<H and H <2**(i):
print(2**(i)-1)
else:
pass |
p03208 | s088558066 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
N, K = map(int, input().split())
H = [0]*N
for i in range(N):
H[i] = int(input())
H.sort()
print(H)
ans = 10**10
for i in range(N-K):
ans = min(ans, H[i+(K-1)]-H[i])
print(ans)
|
p03106 | s340751144 | Accepted | def resolve():
A, B, K = list(map(int, input().split()))
mx = min(A, B)
ans = []
for i in range(1, mx+1):
if A % i == 0 and B % i == 0:
ans.append(i)
print(ans[-K])
return
resolve() |
p03565 | s669696298 | Accepted | s = input()
t = input()
ans = "UNRESTORABLE"
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
isRestorable = True
if not s[j+i] == t[j] and not s[j+i] == "?":
isRestorable = False
break
if isRestorable:
ans = s[0:i] + t + s[i+len(t):len(s)]
ans = ans.replace("?", "a")
print(ans) |
p02727 | s883553322 | Wrong Answer | params = input()
params = list(map(int, params.split()))
x = params[0]
y = params[1]
a = params[2]
b = params[3]
c = params[4]
p = sorted(map(int, input().split()))
q = sorted(map(int, input().split()))
r = sorted(map(int, input().split()))
def eat(l, x):
global r
delish = 0
for i in range(x):
red = 0
if l:
red = l[-1]
colorless = 0
if r:
colorless = r[-1]
if red > colorless:
delish += l.pop()
else:
delish += r.pop()
return delish
delish = eat(p, x)
delish += eat(q, y)
print(delish)
|
p03696 | s039935857 | Wrong Answer | n = int(input())
s = input()
l = s.rfind(')')
cntl, cntr = 0, 0
s2 = 0
flag = 0
for i in range(l+1):
if s[i] == '(':
cntl += 1
else:
cntr += 1
if cntl <= cntr:
s1 = '(' * (max((cntr - cntl), 0))
print(s1, end='')
else:
s2 = ')' * (max((cntl - cntr), 0))
flag = 1
print(s, end='')
r1 = ')' * (max((n - l - 1), 0))
print(r1)
if flag:
print(s2)
|
p03377 | s639594637 | Accepted | a, b, x = (map(int, input().split()))
k = (a+b>=x) and (a<=x)
print('YES' if k else 'NO')
|
p04020 | s650110913 | Accepted | N = int(input())
A = [int(input()) for _ in range(N)]
n = 0
ans = 0
for i in range(N):
if A[i]:
n += A[i]
else:
ans += n//2
n = 0
ans += n//2
print(ans)
|
p03289 | s973984381 | Accepted | S = input()
Cs = [i for i, c in enumerate(S) if c == "C" and 2 <= i <= len(S) - 2]
if S[0] == "A" and len(Cs) == 1 and (S[1 : Cs[0]] + S[Cs[0] + 1 :]).islower():
print("AC")
else:
print("WA")
|
p02952 | s497246129 | Accepted | n = int(input())
res=0
for i in range(n):
if len(str(n)) % 2 != 0:
res += 1
n -= 1
print(res)
|
p03827 | s787498904 | Wrong Answer | n = int(input())
s = input()
list1 = []
for counter in range (n):
d = s.count("D",0,counter)
i = s.count("I",0,counter)
number = i-d
list1.append(number)
if max(list1) <=0:
print(0)
else:
print(max(list1))
|
p03773 | s049125797 | Wrong Answer | a,b=map(int,input().split());print([a+b,a+b-24][a+b>24]) |
p02899 | s088159320 | Accepted | N=int(input())
A=list(map(int,input().split()))
l=[[a] for a in A]
for i in range(N):
l[i].append(i+1)
l.sort()
for i in range(N):
print(l[i][1],end=" ") |
p02854 | s074053127 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
total = sum(a)
total_a, total_b = 0, 0
i = 0
while total_a + a[i] <= total / 2 and total_b + a[n - i - 1] <= total / 2:
total_a += a[i]
total_b += a[n - i - 1]
i += 1
print(total - max(total_a, total_b) * 2) |
p02899 | s156971463 | Accepted | N = int(input())
A = list(map(int,input().split()))
ans = [0] * N
for i,a in enumerate(A):
ans[a-1] = i+1
print(*ans) |
p03838 | s655296764 | Accepted | #!/usr/bin/env python3
x,y = map(int,input().split())
ans = 2*10**9+1
if y-x >= 0:
ans = min(ans,y-x)
if x-y >= 0:
ans = min(ans,x-y+2)
if y+x >= 0:
ans = min(ans,y+x+1)
if -x-y >= 0:
ans = min(ans,-y-x+1)
print(ans) |
p02911 | s010521810 | Accepted | n,k,q = map(int,input().split())
a = [0 for i in range(q)]
t = [0 for i in range(n)]
for i in range(q):
a[i] = int(input())
t[a[i]-1] += 1
for i in range(n):
if t[i] + k > q:
print("Yes")
else:
print("No") |
p03274 | s421140501 | Accepted | n,k= list(map(int, input().split()))
x= list(map(int, input().split()))
li=[]
for i in range(n-k+1):
li.append(x[k+i-1]-x[i]+min(abs(x[k+i-1]),abs(x[i])))
print(min(li))
|
p02900 | s963924314 | Accepted | A, B = map(int, input().split())
def prime_factorize(n):
res = set()
i = 2
while i * i <= n:
if n % i == 0:
res.add(i)
while n % i == 0:
n //= i
i += 1
if n != 1:
res.add(n)
return res
ans = prime_factorize(A) & prime_factorize(B)
print(len(ans) + 1) |
p02765 | s686734766 | Wrong Answer | n,k = map(int, input().split())
for i in range(1,10):
if n <= k ** i - 1:
print(i)
break |
p02768 | s089526592 | Accepted | n,a,b = map(int,input().split())
cnt = 0
mod = 1000000007
def C(n,k):
x = 1
y = 1
for i in range(k):
x *= n-i
y *= i+1
x %= mod
y %= mod
return x*pow(y,mod-2,mod)%mod
cnt += pow(2,n,mod) - 1
cnt -= C(n,a)
cnt -= C(n,b)
print(max(0,cnt%mod)) |
p03474 | s056738606 | Wrong Answer | #a,b=map(int,input().split())
#s=input()
a,b=3, 4
s="269-6650"
ans="No"
if len(s)==a+b+1:
if s[a]=="-":
if s[0:a].isdigit() and s[b:len(s)].isdigit():
ans="Yes"
print(ans) |
p02900 | s831420655 | Wrong Answer | def divisors(n):
s = set()
for x in range(2, int(n ** 0.5) + 1):
if n % x == 0:
s.add(x)
s.add(n // x)
return s
a, b = map(int, input().split())
d = divisors(a) & divisors(b)
print(len(d) + 1)
|
p03994 | s633104639 | Wrong Answer | s = input()
k = int(input())
d = {}
dd = {}
for i, ss in enumerate('abcdefghijklmnopqrstuvwxyz'):
d[ss] = i
dd[i] = ss
ans = ''
for ss in s[:-1]:
if k >= 26 - d[ss]:
k -= 26 - d[ss]
ans += 'a'
else:
ans += ss
k = (d[s[-1]] + k) % 26
ans += dd[k]
print(*ans, sep='') |
p03103 | s074159252 | Accepted | import sys
n, m, *ab = map(int, sys.stdin.read().split())
ab = sorted(zip(*[iter(ab)] * 2))
def main():
cost = 0
r = m
for a, b in ab:
if b <= r:
cost += a * b
r -= b
else:
cost += a * r
break
return cost
if __name__ == '__main__':
ans = main()
print(ans) |
p03437 | s446261004 | Wrong Answer | a,b = map(int,input().split())
print(-1 if a == b else a) |
p02831 | s756116717 | Accepted | import math
A, B = map(int, input().split(' '))
print((A * B) // math.gcd(A, B)) |
p02701 | s595052026 | Accepted | N=int(input())
List=[input() for i in range(N)]
print(len(list(set(List)))) |
p03329 | s264929321 | Accepted | # dp answer
N = int(input())
dp = [N for i in range(N+1)]
dp[0] = 0
Y = [1] + [6**i for i in range(1, 10) if 6**i <= N] + [9**i for i in range(1, 10) if 9**i <= N]
Y = sorted(Y)
for i in range(1, N+1):
for y in Y:
if i-y < 0:
break
dp[i] = min(dp[i], dp[i-y]+1)
print(dp[N])
|
p04005 | s814501989 | Accepted | a = list(map(int,input().split()))
a.sort()
if a[-1]%2 == 0:
print(0)
else:
print(a[0]*a[1]) |
p03076 | s361183497 | Accepted | import math
ary1 = [int(input()) for x in range(5)]
x1 = sum(10*math.ceil(x/10) for x in ary1)
x2 = max([10-(y % 10) if y % 10 !=0 else 0 for y in ary1 ])
ans = x1 - x2
print(ans)
|
p02888 | s682461522 | Accepted | from sys import stdin
import bisect
N = int(stdin.readline().rstrip())
L = [int(x) for x in stdin.readline().rstrip().split()]
L.sort()
ans = 0
for a in range(len(L)-2):
for b in range(a + 1, len(L)-1):
c = bisect.bisect_left(L, L[a] + L[b])
if c > b:
ans += c - 1 - b
print(ans) |
p02814 | s335993075 | Wrong Answer | N, M = map(int, input().split())
a = list(map(int, input().split()))
import functools
def euclid(a, b):
if b == 0:
return a
else:
return euclid(b, a % b)
def multiple(a, b):
return a * b // euclid(a, b)
def lcm(nums):
return functools.reduce(multiple, nums)
for i in range(len(a)):
a[i] = a[i]//2
min = lcm(a)
#M = M // 2
Sum = 0
x = 1
while min * x <= M:
#print(min*x,M)
Sum += 1
x += 2
print(Sum) |
p03043 | s368518166 | Accepted | import math
n, k = map(int, input().split())
ans = 0
x = [max(0, math.ceil(math.log2(k / i))) for i in range(1, n + 1)]
for i in x:
ans += ((2 ** i) * n) ** -1
print(ans) |
p02691 | s339839782 | Accepted | import sys
input = sys.stdin.buffer.readline
from collections import defaultdict
def main():
N = int(input())
a = list(map(int,input().split()))
pl = defaultdict(int)
ans = 0
for i,num in enumerate(a):
s = num+i
t = num-i
ans += pl[-t]
pl[s] += 1
print(ans)
if __name__ == "__main__":
main()
|
p02623 | s662313916 | 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 = 0
j = M
for i in range(N + 1):
if(a[i] > K):
break
while(a[i] + b[j] > K):
j -= 1
ans = max(ans, i+j)
print(ans) |
p02791 | s852286617 | Accepted | N = int(input())
P = list(map(int, input().split()))
dummy = 2*10**5
answer = 0
for p in P:
if p <= dummy:
answer += 1
dummy = p
print(answer) |
p03835 | s098433697 | Accepted | k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if z >= 0 and z <= k:
ans += 1
print(ans) |
p02706 | s138731525 | Wrong Answer | ip1 = input()
ip1list = ip1.split(" ")
N = int(ip1list[0])
M = int(ip1list[1])
ip2 = input()
A_sub = ip2.split(" ")
A = []
for a in A_sub:A.append(int(a))
for a in A:
N -= a
if N<=0:
print(-1)
else:
print(N) |
p02993 | s701472590 | Wrong Answer | S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
print("Good")
else:
print('Bad') |
p03107 | s450882619 | Wrong Answer | # input
S = list(input())
N = len(S)
# check
cnt = 0
del_ind = []
append = del_ind.append
for i in range(1, N):
if "".join(S[i - 1:i + 1]) in ["01", "10"]:
cnt += 2
N -= 2
del S[i - 1:i + 1]
print(cnt) |
p02796 | s799284234 | Accepted | N = int(input())
lls = []
rls = []
sels = []
for _ in range(N):
x,l = map(int, input().split())
lls.append(x-l)
rls.append(x+l)
sels.append([x-l,x+l])
sels = sorted(sels,key=lambda x:x[1])
start = -float('inf')
ans = 0
for item in sels:
if start <= item[0]:
ans += 1
start = item[1]
print(ans)
|
p03250 | s727604220 | Wrong Answer | (a, b, c) = map(int, input().split())
print(max(10 * a + b + c, a + 10 * b + c)) |
p02647 | s521545515 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
for k in range(K):
imos = [0] * (N+1)
for i,a in enumerate(A):
l = max(0, i-a)
r = min(N, i+1+a)
imos[l] += 1
imos[r] -= 1
imos[0] = min(N, imos[0])
for i in range(N):
imos[i+1] = min(N, imos[i] + imos[i+1])
A = imos[:-1]
if all(a==N for a in A):
break
print(*A) |
p03387 | s257042135 | Accepted | #全然わからん
a, b, c = map(int, input().split())
m = max(a, b, c)
ans = 0
if 3 * m % 2 == (a + b + c) % 2 :
ans = (3 * m - (a + b + c)) // 2
else:
ans = (3 * (m + 1) - (a + b + c)) // 2
print(ans) |
p02548 | s954111413 | Wrong Answer | N = int(input())
ans = 0
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
for i in range(N):
num = len(make_divisors(i))
ans += num
print(ans)
print(ans) |
p02820 | s423662504 | Wrong Answer | N,K = map(int,input().split())
R,S,P = map(int,input().split())
T = str(input())
i = 0
point = 0
for i in range(N):
if T[i] == "r" and T[i-K] != "p":
point += P
elif T[i] == "s" and T[i-K] != "r":
point += R
elif T[i] == "p" and T[i-K] != "s":
point += S
else:
break
i += 1
print(point) |
p03408 | s352053836 | Wrong Answer | import collections
L01=collections.defaultdict(dict)
N=int(input())
L1=list(input() for _ in range(N))
M=int(input())
L2=list(input() for _ in range(M))
for i in set(L1):
L01[i]=L1.count(i)
for i in set(L2):
L01[i]=-L2.count(i)
print(max(L01.values()) if max(L01.values())>=0 else 0) |
p03146 | s540156559 | Accepted | S = int(input())
se = {S}
x = S
for i in range(2, 1000001):
if x%2 == 0:
x = x//2
else:
x = 3*x+1
if x in se:
print(i)
exit()
se.add(x)
|
p03774 | s129350852 | Accepted | N, M = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
cd = [list(map(int, input().split())) for _ in range(M)]
for i in range(N):
ans = -1
dist = 10**12
for j in range(M):
tmp = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
if tmp < dist:
ans = j
dist = tmp
print(ans+1) |
p02681 | s454019178 | Wrong Answer | a = input()
b = input()
if a in b and (len(a) + 1) == len(b) and b.islower():
print("Yes")
else:
print("No") |
p03417 | s216980643 | Accepted | N, M = map(int, input().split())
print(abs((N - 2) * (M - 2)))
|
p03126 | s734268363 | Accepted | N,M=map(int,input().split())
l=list()
for i in range(N):
A=list(map(int,input().split()))
del A[0]
l+=A
result=0
for i in range(M):
if l.count(i+1)==N:
result+=1
print(result)
|
p03262 | s982430284 | Wrong Answer | import sys
from math import gcd
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, x, *X = map(int, read().split())
ans = X[0] - x
for i in range(1, N):
ans = gcd(ans, X[i] - x)
print(ans)
return
if __name__ == '__main__':
main()
|
p03323 | s239382492 | Wrong Answer | a, b = map(int, input().split())
if a <= 8 and b <= 8:
print('Yay')
else:
print(':(') |
p03986 | s984609813 | Wrong Answer | s=input()
n=len(s)
for i in range(n-1,-1,-1):
if s[i]=='T':
p=i+1
break
else:
p=0
k=s[:p].count('T')
l=s[:p].count('S')
print(n-p+abs(s[:p].count('T')-s[:p].count('S'))) |
p03220 | s879366333 | Accepted | n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
l = []
for i in range(n):
ans = abs((t -h[i] * 0.006) - a )
l.append(ans)
x = (min(l))
print(l.index(x) + 1) |
p02730 | s121529994 | Wrong Answer | def partpall(s,n):
if s!=s[::-1]:
return False
else:
return True
def pall(s,n):
if s!=s[::-1]:
return False
return partpall(s[n//2 +1 :],n) and partpall(s[:n//2 ],n)
# s=input("enter:")
s="akakaka"
# print("sucess",s,s[::-1])
# revStr=s[::-1]
n=len(s)
print(n)
if pall(s,n):
print("True")
else:
print("False") |
p03951 | s757111595 | Accepted | n = int(input())
s = str(input())
t = str(input())
val = s+t
for i in range(min(len(s),len(t))):
if s[-1-i:] == t[:i+1]:
val = s+t[i+1:]
print(len(val)) |
p03730 | s152680015 | Accepted | a,b,c = map(int, input().split())
flg = 0
for i in range(1,101):
tmp = a * i % b
if tmp == c:
flg = 1
if flg == 1:
print('YES')
else:
print('NO') |
p03319 | s206428857 | Wrong Answer | import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
saishou=A.index(1)
if saishou==0:
answer=math.ceil((N-1)/(K-1))
print(answer)
elif saishou+1<=K:
answer=1+math.ceil((N-K)/(K-1))
print(answer)
elif N-saishou<=K:
answer=math.ceil((N-K)/(K-1))+1
print(answer)
else:
print(math.ceil(saishou/(K-1))+math.ceil((N-1-saishou)/(K-1)))
|
p03037 | s614326702 | Accepted | def myAnswer(N,M,L,R) -> int:
MAXL=max(L)
MINR =min(R)
ans = [i for i in range(1,N+1) if(MAXL<= i and MINR >= i)]
return len(ans)
def modelAnswer():
tmp=1
def main():
N, M = map(int,input().split())
L =[]
R = []
for _ in range(M):
l,r = map(int,input().split())
L.append(l)
R.append(r)
print(myAnswer(N,M,L[:],R[:]))
if __name__ == '__main__':
main() |
p03289 | s585645370 | Accepted | s=input()
if s[0] !="A":
print("WA")
exit()
cnt=0
for i in range(2,len(s)-1):
if s[i] == "C":
cnt+=1
if cnt!=1:
print("WA")
exit()
for i in range(1,len(s)):
if s[i] == "C" and 2<=i<len(s)-1:
continue
if not s[i].islower():
print("WA")
exit()
print("AC") |
p02618 | s953711969 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
D = int(input())
C = [int(x) for x in input().split()]
S = [[int(x) for x in input().split()] for _ in range(D)]
for i in range(D):
print(i % 26 + 1)
if __name__ == '__main__':
main()
|
p02916 | s289220152 | Wrong Answer | N = int(input())
dishes = list(map(int, input().split()))
satisfaction = list(map(int, input().split()))
additional = list(map(int, input().split()))
res = 0
for i in range(N-1):
res += satisfaction[i]
if dishes[i] + 1 == dishes[i+1]:
res += additional[dishes[i] - 1]
print(res)
print(res + satisfaction[-1])
|
p03038 | s484386775 | Accepted | from sys import stdin
na=lambda: map(int,stdin.readline().split())
n,m=map(int,input().split())
a=sorted(list(na()))
l=[list(na()) for i in range(m)]
l=sorted(l,key=lambda x:x[1], reverse=True)
p=0
comp=[]
for b,c in l:
comp+=[c]*b
p+=b
if p>=n:
break
ans=0
for i in range(n):
if i<len(comp):
ans+=max(a[i],comp[i])
else:
ans+=a[i]
print(ans) |
p02683 | s028311564 | Wrong Answer | n, m, x = list(map(int, input().split()))
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append([])
for j in range(m):
a[i].append(tmp[j])
ab = []
for i in range(m):
sum = 0
for j in range(n):
sum += a[j][i]
ab.append(bool(sum > x))
print(300 if all(ab) else -1) |
p02676 | s199358705 | Accepted | K = int(input())
S = str(input())
if len(S) <= K:
print(S)
else:
print(S[:K] + "...") |
p03105 | s777798099 | Accepted | def atc_120a(input_value: str) -> int:
A, B, C = map(int, input_value.split(" "))
return min(C, B // A)
input_value = input()
print(atc_120a(input_value))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.