problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03565 | s801854272 | Accepted | s=input()
t=input()
ans=[]
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j]!=t[j] and s[i+j]!='?':break
else:
a=''
for k in s[0:i]+t+s[i+len(t):]:
if k=='?':a+='a'
else:a+=k
ans+=[a]
ans=sorted(ans)
if ans:print(ans[0])
else:print('UNRESTORABLE') |
p03136 | s061164320 | Accepted | n = int(input())
l = list(map(int,input().split()))
l.sort(reverse=True)
if l[0] < sum(l[1:]):
print("Yes")
else:
print("No") |
p03994 | s086072330 | Accepted | s = list(input())
n = len(s)
k = int(input())
for i in range(n):
x = ord(s[i]) - ord('a')
if x == 0 or 26 -x > k: continue
k -= 26 - x
s[i] = 'a'
if k:
s[-1] = chr((ord(s[-1]) - ord('a') + k) % 26 + ord('a'))
print(''.join(s))
|
p03062 | s282590392 | Accepted | def minus(n):
if n>=0:
return 0
else:
return 1
N=int(input())
L=list(map(int,input().split()))
c=sum(list(map(minus,L)))
if c%2==0:
t=sum(list(map(abs,L)))
print(t)
else:
L=list(map(abs,L))
print(sum(L)-min(L)*2) |
p02724 | s765220264 | Accepted | X = int(input())
s = X // 500
a = X % 500
t = a // 5
print(s*1000 + t*5)
|
p03773 | s025335552 | Accepted | A, B = map(int, input().split())
if A + B <= 23:
print(A + B)
else:
print((A + B) - 24) |
p02829 | s313710208 | Wrong Answer | n=int(input())
t=int(input())
print(3-n-t) |
p03106 | s509167079 | Wrong Answer | A, B, K = list(map(lambda x: int(x), input().split(" ")))
cd = []
for i in range(min([A,B])):
if A % (i + 1) == 0 and B % (i + 1) == 0:
cd.append(i+1)
print(cd[K - 1]) |
p03448 | s895846518 | Accepted | A=int(input())
B=int(input())
C=int(input())
X=int(input())
ans=0
for i in range(0,A+1):
for j in range(0,B+1):
for k in range(0,C+1):
if 500*i+100*j+50*k==X:
ans+=1
print(ans) |
p03544 | s810122375 | Accepted | n = int(input())
L = [0] * (n + 1)
L[0] = 2; L[1] = 1
for i in range(2, n + 1):
L[i] = L[i - 1] + L[i - 2]
print(L[n])
|
p03206 | s299185594 | Accepted | D=int(input())
if D==25:
print('Christmas')
if D==24:
print('Christmas Eve')
if D==23:
print('Christmas Eve Eve')
if D==22:
print('Christmas Eve Eve Eve') |
p02718 | s976129785 | Accepted | n,m = map(int,input().split())
a = list(map(int, input().split()))
ord = []
summ = sum(a)
isSmallThan = True
for j in range(m):
ord.append(max(a))
a.remove(max(a))
for k in range(m):
if ord[k]/summ >= 1/(4*m):
isSmallThan = True
else:
isSmallThan = False
break
print('Yes' if isSmallThan else 'No')
|
p03472 | s663933543 | Accepted | n,h,*d=map(int,open(0).read().split())
a=max(d[::2])
b=sorted(d[1::2])
c=0
while b and b[-1]>a>0<h:h-=b.pop();c+=1
print(c--h*(h>0)//a) |
p02813 | s874266012 | Accepted | import itertools as itool
N=int(input())
plist=list(map(int, input().split()))
qlist=list(map(int, input().split()))
mylist=list(itool.permutations(range(1,N+1)))
print(abs(mylist.index(tuple(plist))-mylist.index(tuple(qlist))))
|
p03345 | s547964249 | Accepted | A, B, C, K = list(map(int, input().split()))
if K % 2 == 0:
print(A-B)
else:
print(B-A) |
p04019 | s790041200 | Accepted | def main():
S = input()
we = ("W" in S and "E" in S) or ("W" not in S and "E" not in S)
ns = ("N" in S and "S" in S) or ("N" not in S and "S" not in S)
if we and ns:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p03545 | s531852137 | Accepted | lst = [int(a) for a in input()]
for bit in range(1 << len(lst)):
sum = 0
op_lst = []
for i in range(len(lst)):
if bit & (1 << i):
sum += lst[i]
op_lst.append('+')
else:
sum -= lst[i]
op_lst.append('-')
if sum == 7:
print(lst[0], op_lst[1], lst[1], op_lst[2], lst[2], op_lst[3], lst[3], '=7', sep='')
break |
p03456 | s865022527 | Accepted | a, b = input().split()
combine = int(a + b)
sqr_combine = combine ** 0.5
c = int(sqr_combine)
if sqr_combine == c :
print("Yes")
else :
print("No") |
p03472 | s462922764 | Wrong Answer | n,h=map(int,input().split())
ab=[]
ans=0
for i in range(n):
aa,bb=map(int,input().split())
ab.append([aa,bb])
ab.sort(key=lambda x: x[0],reverse=True)
katana=ab[0][0]
ab.sort(key=lambda x: x[1],reverse=True)
cnt=0
# print(ab)
for a,b in ab:
if b>=katana:
cnt+=1
ans+=cnt
for i in range(cnt):
h-=ab[i][1]
from math import ceil
ans+=ceil(h/katana)
print(ans) |
p03077 | s185035187 | Accepted | n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
x=min(a,b,c,d,e)
ans=-(-n//x)+4
print(ans) |
p03485 | s356149073 | Wrong Answer | a,b=map(int,input().split())
c=round(a+b/2)
print(c)
|
p02882 | s271328817 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
a,b,x = list(map(int, input().split()))
import math
if x*2>=a*a*b:
the = (a*b - x/a) / (0.5*a*a)
else:
the = (b*b*a) / (2*x)
ans = math.atan(the)
print(ans*180/math.pi) |
p03250 | s702754259 | Accepted | abc=sorted(list(map(int,input().split())),reverse=True)
a=[1]*10
for i in range(10**7+5*10**6):
a.append(a)
print(sum(abc)+abc[0]*9)
|
p02836 | s127791581 | Accepted | sentence = input()
sentence_len = len(sentence)
iter_num = int(sentence_len/2)-1 if sentence_len % 2 == 0 else int(sentence_len/2)
counter = 0
for i in range(iter_num+1):
if sentence[i] == sentence[sentence_len-i-1]:
pass
else:
counter += 1
print(counter) |
p02791 | s783360483 | Accepted | n = int(input())
p = list(map(int, input().split()))
ans = 1
min = p[0]
for i in range(1, n):
if min >= p[i]:
ans += 1
min = p[i]
print(ans) |
p02783 | s729442658 | Accepted | x, y = map(int,input().split())
if x % y == 0:
ans = x // y
else:
ans = x // y + 1
print(ans) |
p02598 | s465192432 | Accepted | # coding: utf-8
def solve(*args: str) -> str:
n, k = map(int, args[0].split())
A = tuple(map(int, args[1].split()))
l, r = 1, max(A)
while 0.1 < r-l:
m = (l+r)/2
cnt = 0
for a in A:
cnt += -int(-a//m)-1
if k < cnt:
l = m
else:
r = m
return str(-int(-l//1))
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
p02833 | s749438849 | Wrong Answer | n = int(input())
ans = 0
if n%2==0:
n /= 2
fives = 5
while 1:
if fives > n:
break
ans += n // fives
fives *= 5
print(ans)
|
p03803 | s546124308 | Accepted | A, B = map(int, input().split())
if A == 1:
A = 14
if B == 1:
B = 14
if A > B:
print("Alice")
elif A == B:
print("Draw")
else:
print("Bob") |
p03994 | s039914955 | Wrong Answer | makeA = lambda c: (ord('z')-ord(c)+1) % 26
s = list(map(makeA,list(input())))
print(s)
K = int(input())
len_s = len(s)
print(len_s)
for i in range(len_s-1):
if s[i] <= K:
K -= s[i]
s[i] = 0
print(s)
if K > 0:
s[-1] = (s[-1] + 26 - (K % 26)) % 26
print(s)
makeS = lambda n: chr((26-n)%26+ord('a'))
print(''.join(list(map(makeS,s)))) |
p02790 | s298706898 | Accepted | a,b=map(int,input().split())
print(min(str(a)*b,str(b)*a)) |
p02723 | s112290886 | Wrong Answer | s = input()
if s[2] == s[3]:
if s[4] == s[5]:
print("Yes")
else:
print("No")
|
p03416 | s565809435 | Accepted | A, B = map(int, input().split())
ans = 0
for i in range(A, B+1):
i = str(i)
if i == i[::-1]:
ans += 1
print(ans) |
p02701 | s875589059 | Accepted | # coding: utf-8
# Your code here!
import math
N = int(input())
S = ["" for i in range(N)]
for i in range(N):
S[i] = input()
S.sort()
if N==1:
print(1)
else:
count = 1
for i in range(N-1):
if S[i] != S[i+1] :
count += 1
print(count) |
p03160 | s186623102 | Wrong Answer | n=int(input())
h=list(map(int, input().split()))
dp=[10**5 for i in range(n)]
dp[0]=0
for i in range(n):
if i+1<n:dp[i+1] = min(dp[i+1], dp[i] + abs(h[i+1]-h[i]))
if i+2<n:dp[i+2] = min(dp[i+2], dp[i] + abs(h[i+2]-h[i]))
print(dp[n-1])
|
p02790 | s225287341 | Accepted | a, b = map(int, input().split())
print(*[min(a, b)] * max(a, b), sep='') |
p02615 | s016743659 | Wrong Answer | n = int(input())
a =[int(i) for i in input().split()]
a.sort(reverse=True)
s = sum(a)-a[-1]
print(s) |
p02683 | s873761537 | Accepted | import numpy as np
n,m,x=map(int,input().split())
ca=[list(map(int,input().split())) for i in range(n)]
ca=np.array(ca)
ans=np.array([])
ans_list=np.array([])
for i in range(2**n):
flag=True
ans=np.array([0]*(m+1))
for j in range(n):
if (i>>j)&1:
ans+=ca[j]
for i in range(1,len(ans)):
if x>ans[i]:
flag=False
break
if flag==True:
ans_list=np.append(ans_list,ans[0])
if len(ans_list)>=1:
print(int(min(ans_list)))
else:
print(-1) |
p02691 | s901384776 | Wrong Answer | from collections import *
n = int(input())
a = list(map(int, input().split()))
c = Counter()
r = 0
for i in range(n):
r += c[a[i]+i]
c[i-a[i]] += 1
print(r) |
p04019 | s349690983 | Wrong Answer | s = input()
ans = 0
if "N" in s:
if "S" in s: ans += 1
else: ans += 1
if "W" in s:
if "E" in s: ans += 1
else: ans += 1
print("Yes" if ans==2 else "No") |
p03721 | s314071320 | Accepted | N, K = map(int, input().split())
d = []
for i in range(N):
a, b = map(int, input().split())
d.append((a, b))
d.sort(reverse=True)
while K > 0:
a, b = d.pop()
K -= b
print(a) |
p03261 | s689899715 | Wrong Answer | def main():
N = int(input())
A = [input()]
for i in range(1, N):
W = input()
if A[-1][-1] == W[0]:
for j in range(i-1):
if A[j] == W:
print("No:重複")
return
A.append(W)
else:
print(A, "No:違う")
return
print("Yes")
main() |
p02922 | s545097046 | Accepted | a,b=map(int,input().split())
x = 1
ans = 0
while x < b:
x = x + a -1
ans = ans + 1
print(ans) |
p02690 | s465695528 | Accepted | import bisect
# 計算量を大体で見積もってぶん投げればおｋ
# この問題だとO(a**0.25)
x = int(input())
for i in range(-1000, 1000):
for j in range(-1000, 1000):
if i ** 5 - j ** 5 == x:
print(i, j)
quit() |
p03673 | s120098904 | Accepted | n = int(input())
a = input().split()
b = [0] * n
for i in range(n):
if i % 2 == 0:
b[i//2] = a[n-1-i]
else:
b[n-(i+1)//2] = a[n-1-i]
print(' '.join(b))
|
p02553 | s282343426 | Accepted | a, b, c, d = list(map(int, input().split()))
print(max([a*c, a*d, b*c, b*d]))
|
p03592 | s997729834 | Accepted | n,m,k = map(int, input().split())
for i in range(n+1):
for j in range(m+1):
if i*(m-j)+j*(n-i)==k:
print("Yes")
exit()
print("No") |
p02659 | s502405307 | Accepted | a, b = input().split()
a = int(a)
b = str(b).replace(".", "")
print(a * int(b) // 100)
|
p03607 | s242199023 | Wrong Answer | n=int(input())
a= [int(input()) for i in range(n)]
a.sort()
ans=0
m=1
print(a)
for i in range(1,n):
if a[i-1] == a[i]:
m+=1
else:
ans+=(m%2)
m=1
ans+=(m%2)
print(ans)
|
p02766 | s293262666 | Wrong Answer | N, K = map(int, input().split())
flag = True
ans = []
while flag:
M = N % K
N = N // K
ans.append(M)
if N // K == 0:
ans.append(N)
flag = False
print(len(ans)) |
p02783 | s080278034 | Wrong Answer | h, a = map(int, input().split())
if a>=h:
print(1)
else:
c = h//a
print(c+1) |
p02681 | s818226805 | Wrong Answer | S = str(input())
T = str(input())
if S[-1] == "e":
if T[-1] != "e":
print("Yes")
else:
print("No")
else:
print("Yes") |
p02813 | s003066653 | Wrong Answer | import itertools
n=int(input())
a=tuple(map(int,input().split()))
b=tuple(map(int,input().split()))
seq=range(n)
l=list(itertools.permutations(seq))
#print(l[0])
a_num=0
b_num=0
for i in range(len(l)):
if l[i]==a:
a_num=i
elif l[i]==b:
b_num=i
print(abs(a_num-b_num)) |
p02726 | s487627989 | Wrong Answer | n, x, y = map(int, input().split())
dists = [0 for i in range(n)]
for i in range(1, n+1):
for j in range(1, n+1):
dist = min(abs(j-i), 1 + abs(x-i)+abs(y-j), 1 + abs(y-i)+abs(x-j))
if dist > 0:
dists[dist-1]+=1
for dis in dists:
print(dis//2) |
p02554 | s014569386 | Accepted | import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque
input = sys.stdin.readline
def inp():
return int(input())
def inpl():
return list(map(int, input().split()))
def _dbg(o):
print(o, file=sys.stderr)
# ---------------------------------------
N = inp()
mod = 10**9 + 7
_dbg(mod)
a = 1
b = 1
c = 1
for _ in range(N):
a = (a * 10) % mod
b = (b * 9) % mod
c = (c * 8) % mod
print((a - 2 * b + c) % mod)
|
p02848 | s275167587 | Accepted | #!/usr/bin/env python3
N = int(input())
S = input()
sli = [ord(c) for c in S]
sli_mod = [n + N for n in sli]
for i, s in enumerate(sli_mod):
if s > ord('Z'):
sli_mod[i] -= 26
# print(sli_mod)
final = [chr(c) for c in sli_mod]
out = "".join(final)
print(out)
|
p02700 | s119115128 | Accepted | A, B, C, D = map(int, input().split())
while A>1 :
C=C-B
A=A-D
else:
if C>0 and A<=0:
print("No")
elif C<0 or C-B<=0:
print("Yes")
else:
print("No") |
p03494 | s695284654 | Accepted | def resolve():
'''
code here
'''
N = int(input())
As = [int(item) for item in input().split()]
cnt = 0
is_not_found = True
while is_not_found:
for i in range(N):
if As[i] % 2 == 0:
As[i] //= 2
else:
is_not_found = False
break
else:
cnt += 1
print(cnt)
if __name__ == "__main__":
resolve()
|
p03632 | s614888766 | Accepted | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
A, B, C, D = LI()
ans = max(min(B, D) - max(A, C), 0)
print(ans)
if __name__ == '__main__':
resolve()
|
p03827 | s673791536 | Wrong Answer | a = input()
b = list(input())
count = 0
ans = 0
for c in a:
if c == "I":
count += 1
else:
count -= 1
if count >= ans:
ans += 1
print(ans)
|
p03379 | s498302255 | Accepted | n = int(input())
x = list(map(int, input().split()))
y = sorted(x)
k, l = y[n//2-1], y[n//2]
for i in range(n):
if x[i] <= k:
print(l)
else:
print(k)
|
p02819 | s416737653 | Accepted | from math import sqrt, floor
def is_prime(x: int) -> bool:
if x <= 1:
return False
for i in range(2, floor(sqrt(x))):
if x % i == 0:
return False
return True
x = int(input())
while not is_prime(x):
x += 1
print(x)
|
p02823 | s783603839 | Accepted | n,a,b = [int(x) for x in input().split()]
if (b-a)%2==0:
print((b-a)//2)
else:
print(min(a+(b-a-1)//2,n-b+1+(b-1-a)//2)) |
p02647 | s330135963 | Wrong Answer | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
tmp = [0] * n
for i in range(n):
left = i-a[i]-k+1 if i-a[i]-k+1 >= 0 else 0
right = i+a[i]+k-1 if i+a[i]+k-1 <= n-1 else n-1
for j in range(left, right+1):
tmp[j] += 1
print(' '.join(map(str, tmp)))
|
p02657 | s331832335 | Accepted | A,B = map(int,input().split())
print(A*B)
|
p03543 | s105137782 | Accepted | N=input()
if ((N[0]==N[1])&(N[1]==N[2]))|((N[1]==N[2])&(N[2]==N[3])):
print("Yes")
else:
print("No") |
p02813 | s660669521 | Wrong Answer | import itertools
n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
a = [i+1 for i in range(n)]
cnt = 0
ans = 0
for x in itertools.permutations(a):
cnt += 1
if list(x) == p: ans -= cnt
if list(x) == q:
ans += cnt
break
print(ans) |
p03107 | s377900487 | Accepted | s=input()
print(min(s.count("0"),s.count("1"))*2)
|
p03644 | s382360311 | Accepted | N = int(input())
x = 1
while x <= N:
x *= 2
print(x // 2)
|
p03360 | s534441353 | Accepted | abc = list(map(int, input().split()))
k = int(input())
for i in range(k):
abc.sort()
abc[-1] *= 2
print(sum(abc))
|
p02777 | s991780471 | Accepted | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
a, b = list(map(int, readline().split()))
if s == str(readline().rstrip().decode('utf-8')):
print(a - 1, b)
else:
print(a, b - 1)
if __name__ == '__main__':
solve() |
p03804 | s261109679 | Accepted | import numpy as np
N,M = map(int,input().split())
A = np.array([list(input()) for _ in range(N)])
B = np.array([list(input()) for _ in range(M)])
ans="No"
bl = False
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M] == B).all():
ans="Yes"
break
print(ans) |
p02910 | s081166852 | Wrong Answer | s=input()
if s[0::2]=='L' or s[1::2]=='R':
print('No')
else:
print('Yes')
|
p03162 | s732424549 | Accepted | def main():
N = int(input())
abc = [list(map(int, input().split())) for _ in range(N)]
dp = [[0]*3 for _ in range(N)]
for i in range(3):
dp[0][i] = abc[0][i]
for i in range(1, N):
for j in range(3):
dp[i][j] = max(dp[i-1][(j+1) % 3], dp[i-1][(j+2) % 3])+abc[i][j]
print(max(dp[N-1][0], dp[N-1][1], dp[N-1][2]))
if __name__ == '__main__':
main()
|
p03469 | s859009172 | Accepted | s = input()
print(s[:3]+'8'+s[4:]) |
p02952 | s290266892 | Accepted | n = int(input())
print(sum(len(str(i + 1)) % 2 for i in range(n))) |
p03161 | s325214072 | Accepted | n, k, *h = map(int, open(0).read().split())
h += [0] * 200
dp = [0] + [float("inf")] * 100200
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, k + 1))
print(dp[n - 1]) |
p02847 | s636046217 | Accepted | S=["SUN","MON","TUE","WED","THU","FRI","SAT"]
T=input()
for i in range(len(S)):
if T==S[i]:
print(7-i)
|
p02596 | s244962769 | Accepted | k = int(input())
t = 7
t %= k
for i in range(k + 1):
if t == 0:
print(i + 1)
break
t = (t * 10 + 7) % k
else:
print(-1) |
p03041 | s688378456 | Wrong Answer | n,k = map(int,input().split())
#print(n,k)
S=list(input())
print(S)
s=S.pop(k-1)
print(s)
s=s.lower()
print(s)
S.insert(k-1, s)
print(''.join(S)) |
p03705 | s994856731 | Accepted | import sys
N,A,B=map(int,input().split())
print(max(B*(N-1)+A-(A*(N-1)+B)+1,0)) |
p03163 | s166351800 | Accepted | import numpy as np
n, w = list(map(int, input().split()))
wv = np.array([list(map(int, input().split(" "))) for _ in range(n)])
dp = np.zeros((w + 1, n), dtype=np.int)
dp[wv[0, 0] :, 0] = np.full(dp[wv[0, 0] :, 0].shape, wv[0, 1])
for i in range(1, n):
dp[:, i] = dp[:, i - 1]
wNew, vNew = wv[i, 0], wv[i, 1]
dp[wNew:, i] = np.fmax(dp[wNew:, i - 1], vNew + dp[:-wNew, i - 1])
print(dp[w, n - 1])
|
p02784 | s060577454 | Accepted | H,N = map(int,input().split())
A = list(map(int,input().split()))
if H <= sum(A):
print('Yes')
else:
print('No') |
p02775 | s078760617 | Wrong Answer | N = input()
a = 0 # not carried
b = 0 # carried
for i in range(len(N) - 1, -1, -1):
t = int(N[i])
a, b = min(a + t, b + (t + 1)), min(a + (10 - t), b + (10 - (t + 1)))
print(min(a, b + 1))
|
p02866 | s227702443 | Wrong Answer | from collections import Counter
N = int(input())
D = list(map(int, input().split()))
MOD = 998244353
if D[0] != 0:
print(0)
else:
c = Counter(D)
c = sorted(c.items(), key=lambda x: x[0])
ans = 1
prev = 1
for k, v in c:
if k == 0:
if v > 1:
print(0)
break
else:
ans *= prev ** v
prev = v
print(ans)
|
p02647 | s779452678 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
L = [0 for _ in range(N+1)]
cnt = 0
while min(A) < N and cnt < K:
cnt += 1
for i in range(N):
L[max(i-A[i], 0)] += 1
L[min(i+A[i]+1, N)] -= 1
for i in range(N):
L[i+1] += L[i]
A[i] = L[i]
L[i] = 0
for i in range(N):
print(A[i], end = ' '*(i!=N-1)) |
p03723 | s542280541 | Accepted | a, b, c = map(int, input().split())
if a == b == c and a % 2 == 0:
print(-1)
else:
cnt = 0
for _ in range(10**5):
if a % 2 == 1 or b % 2 == 1 or c % 2 == 1:
print(cnt)
break
else:
a, b, c = (b + c) / 2, (c + a) / 2, (a + b) / 2
cnt += 1 |
p02818 | s710613751 | Wrong Answer | A,B,K = map(int,input().split())
if A >= K:
A -= K
K = 0
else:
A = 0
K -= A
if B >= K:
B -= K
K = 0
else:
B = 0
K -= B
print(A,B)
|
p03219 | s669545648 | Wrong Answer | a,b = [int(_) for _ in input().split()]
print(a + b/2) |
p02664 | s677371667 | Accepted | t = input()
t = t.replace('P?', 'PD').replace('?D', 'PD').replace('??', 'PD').replace('?', 'D')
print(t) |
p02789 | s406878826 | Wrong Answer | n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("no") |
p02916 | s633504969 | Wrong Answer | n = int(input())
la = list(map(int,input().split()))
lb = list(map(int,input().split()))
lc = list(map(int,input().split()))
con = 0
for i in range(len(la)-1):
if la[(i+1)%3]==la[i]+1:
con += lc[la[i]-1]
print(sum(lb)+con) |
p02647 | s664904022 | Wrong Answer | N,K=map(int,input().split())
light=list(map(int,input().split()))
copy=[0]*N
for k in range(K):
imo=[0]*(N+1)
x=0
for i in range(N):
kido=light[i]
imo[max(0,i-kido)]+=1
imo[min(N-1,i+kido)+1]-=1
for j in range(N):
x+=imo[j]
copy[j]=x
if light==copy:
break
else:
light=copy
print(*light) |
p02933 | s061129144 | Accepted | a = int(input())
s = input()
print(s if a >= 3200 else "red") |
p02694 | s435352290 | Accepted | X = int(input())
cnt = 0
y = 100
while y < X:
y += y // 100
cnt += 1
print(cnt) |
p02831 | s956082097 | Wrong Answer | import math
a, b = map(int, input().split())
print(math.gcd(a, b)) |
p02784 | s766603621 | Accepted | i=list(map(int,input().split()))
j=list(map(int,input().split()))
h=i[0]
a=True
c=0
j.sort(reverse=True)
for b in j:
c+=b
if c>=h:
print("Yes")
a=False
break
if a:
print("No")
|
p02720 | s090231768 | Wrong Answer | k=int(input())
from collections import deque
q = deque(range(1, 10))
for i in range(k-1):
d = q.popleft()
if d % 10 != 0:
q.append(10 * d + d % 10 - 1)
q.append(10*d)
if d % 10 != 9:
q.append(10 * d + d % 10 +1)
print(q.popleft())
|
p04033 | s644659134 | Accepted | a, b = map(int, input().split())
if a*b <= 0:
print('Zero')
elif 0 < a:
print("Positive")
else:
cnt = b - a + 1
if cnt % 2 == 0:
print('Positive')
else:
print("Negative") |
p03696 | s047520156 | Wrong Answer | n=int(input())
s=input()
c=0
x=s.rfind(")")
if x==-1:
print(s+")"*n)
else:
s1=s[0:x+1]
s2=s[x+1:]+")"*len(s[x+1:])
if s1.count("(")>=s1.count(")"):
print(s1+")"*(s1.count("(")-s1.count(")"))+s2)
else:
print("("*(-s1.count("(")+s1.count(")"))+s1+s2) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.