problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p04029 | s835452915 | Accepted | n=int(input())
print(((1+n)*n)//2) |
p02600 | s552036645 | Wrong Answer | x=int(input())
if 400<=x<=599:
print(8)
elif 600<=x<=799:
print(7)
elif 800<=x<=999:
print(6)
elif 1000<=x<=1199:
print(5)
elif 1200<=x<=1399:
print(4)
elif 1400<=x<=1599:
print(3)
elif 1600<=x<=1799:
print(2)
elif 1800<=x<=1899:
print(1)
|
p03627 | s315725703 | Wrong Answer | n = int(input())
li = list(map(int, input().split()))
li.sort(reverse=True)
check = -1
flag = 0
ans = []
for i in li:
if len(ans) == 2:
break
if flag == 0:
check = i
flag = 1
continue
if check == i:
ans.append(i)
flag = 0
else:
flag = 0
if len(ans) < 2:
print(0)
else:
print(ans[0] * ans[1]) |
p04011 | s586400956 | Accepted | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
n = I()
k = I()
x = I()
y = I()
if n <= k:
print(n*x)
else:
print(k*x + (n-k)*y)
if __name__ == '__main__':
main() |
p02771 | s205809563 | Accepted | a,b,c = map(int,input().split())
if (a == b and a != c) or (b == c and b != a) or (c == a and c != b) :
print('Yes')
else :
print('No') |
p03778 | s042636679 | Wrong Answer | w, a, b = map(int, input().split())
if b + w >= w + a >= b:
print(0)
elif a + w < b:
print(b - a - w)
elif b + w < a:
print(a - b - w)
|
p03220 | s645970656 | Wrong Answer | n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
m = h[0]
ans = 0
for i in range(1, n):
num = abs(a-(t-h[i]*0.006))
if num < m:
ans = i
m = num
print(ans+1) |
p02843 | s773054784 | Wrong Answer | x = int(input())
d = x%100
c = 0
for i in [6,5,4,3,2,1]:
c += d//i
d = d%i
if c*100 + x%100 > x:
print(0)
else:
print(1) |
p02790 | s047362252 | Wrong Answer | n, m = input().strip().split()
if(n<m):
for i in range(int(m)-1):
print(n)
else:
for i in range(int(n)-1):
print(m) |
p02817 | s201225125 | Accepted | S,T = input().split()
print(T + S) |
p02818 | s578357244 | Wrong Answer | a, b, k = map(int, input().split())
if a > k:
print(str(a-k) + ' ' + str(b))
elif a <= k:
print(str(0) + ' ' + str(a + b -k)) |
p03679 | s683701693 | Accepted | x, a, b = map(int, input().split())
if b-a <= 0:
print('delicious')
elif 0 < b-a <= x:
print('safe')
else:
print('dangerous') |
p02768 | s537127066 | Accepted | def inverse(n: int, mod: int) -> int:
return pow(n, mod - 2, mod)
def cmb(n: int, m: int, mod) -> int:
p, q = 1, 1
for i in range(m):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return p * inverse(q, mod) % mod
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
ans = pow(2, n, mod) - 1
ans -= cmb(n, a, mod)
ans -= cmb(n, b, mod)
print(ans % mod) |
p02676 | s471394176 | Accepted | k = int(input())
s = input()
if len(s) > k:
print(s[:k] + '...')
else:
print(s) |
p03282 | s367011406 | Wrong Answer | S = input()
K = int(input())
if S[0] != 1:
print(S[0])
else:
print(1) |
p02582 | s946707068 | Wrong Answer | t = input()
rain = 0
for i in t:
if i == 'R':
rain +=1
print(rain) |
p02765 | s516691718 | Wrong Answer | from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
print(R - (100*(10-N))) |
p02547 | s607119976 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
D = [list(map(int, input().split())) for _ in range(N)]
zorome_count = 0
for d in D:
if d[0] == d[1]:
zorome_count += 1
else:
zorome_count = 0
if zorome_count == 3:
break
print('Yes' if zorome_count == 3 else 'No')
if __name__ == "__main__":
main()
|
p04033 | s944775940 | Wrong Answer | A,B=map(int,input().split())
if A>0:
print('Positive')
elif A==0 or B==0:
print(0)
elif A<0 and 0<B:
print(0)
else:
if A==B:
print('Negative')
elif (B-A)%2==0:
print('Negative')
else:
print('Positive')
|
p02820 | s661019529 | Accepted | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
scoreMap = {'r': P, 'p': S, 's': R}
score = 0
for i in range(0, K):
a, b = scoreMap[T[i]], 0
for j in range(i+K, N, K):
na = b + scoreMap[T[j]]
if T[j] != T[j-K]:
na = max(na, a + scoreMap[T[j]])
nb = max(a, b)
a, b = na, nb
score += max(a, b)
print(score) |
p02612 | s526549724 | Wrong Answer | N=int(input())
S=N%1000
print(1000-S)
|
p04030 | s046101656 | Accepted | *s, = input()
ans = []
for _s in s:
if _s == "0":
ans.append("0")
elif _s == "1":
ans.append("1")
elif _s == "B" and 0 < len(ans):
ans.pop()
print("".join(ans))
|
p03331 | s460045936 | Wrong Answer | n = int(input())
min_sum = 99999999999999
for i in range (1, n - 1):
first = i
second = n - i
first_sum = 0
second_sum = 0
while first > 0 :
last_digit_first = first % 10
first = first // 10
first_sum += last_digit_first
while second > 0 :
last_digit_second = second % 10
second = second // 10
second_sum += last_digit_second
if first_sum + second_sum <= min_sum :
min_sum = first_sum + second_sum
print(min_sum) |
p03309 | s083846595 | 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():
n = ni()
A = nl()
A = sorted(list(map(lambda x: A[x] - (x + 1), range(n))))
b = A[n // 2]
print(sum(list(map(lambda x: abs(x - b), A))))
if __name__ == '__main__':
main()
|
p03327 | s795005331 | Accepted | n = int(input())
if n <= 999:
print('ABC')
else:
print('ABD') |
p03719 | s181836373 | Wrong Answer | a,b,c=(int(x)for x in input().split())
if a<=c<=b:
print("YES")
else:
print("NO") |
p03494 | s330250944 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = []
flg = True
for a in A:
i = 0
while flg:
if a % 2 ** i == 0:
i += 1
else:
B.append(i)
flg = False
B.sort()
print(B[0])
|
p03721 | s694815908 | Accepted | N, K = map(int, input().split())
ab = [tuple(map(int, input().split())) for i in range(N)]
ab.sort()
id = 0
for a, b in ab:
if id + b >= K:
print(a)
break
else:
id += b
|
p02772 | s769523764 | Accepted | input()
A=list(map(int,input().split()))
print("APPROVED" if all(a%2!=0 or a%3==0 or a%5==0 for a in A) else "DENIED") |
p02947 | s526403391 | Accepted | from collections import Counter
n = int(input())
s = []
for i in range(n):
a = list(input())
s.append("".join(sorted(a)))
c = Counter(s)
ans = 0
for i in c.values():
ans += i*(i-1)//2
print(ans)
|
p03251 | s442810337 | Wrong Answer | n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x.append(X)
# y.append(Y)
x.sort()
y.sort()
if x[-1] >= y[0]:
print("War")
else:
print("No War")
|
p02702 | s701688974 | Wrong Answer | S = input()
mod_list = [str(i * 2019) for i in range(1, 100)]
count = 0
for s in mod_list:
ps = 0
while True:
temp = S[ps:].find(s)
if temp == -1:
break
else:
ps += temp + len(s) - 1
count += 1
print(count) |
p03145 | s353357394 | Accepted | c,a,b=map(int,input().split())
print(int(c*a/2)) |
p03360 | s329251017 | Accepted | a,b,c = map(int,input().split())
k = int(input())
print(max(a,b,c)*(2**k-1)+a+b+c) |
p02900 | s449063099 | Wrong Answer | def main():
import fractions
import math
A, B = map(int, input().split())
gcd = fractions.gcd(A, B)
tmp = gcd
primes = set()
for i in range(2, math.ceil(gcd**(1/2)) + 2):
if tmp % i == 0:
while(tmp % i == 0):
tmp = tmp//i
primes.add(i)
if len(primes) == 0 and gcd != 1:
primes.add(gcd)
print(len(primes) + 1)
main()
|
p03730 | s318723257 | Wrong Answer | a,b,c=map(int,input().split())
d=a%b
if d!=0:
if c%d==0:
frag="YES"
else:
frag="NO"
else:
frag="NO"
print(frag) |
p03220 | s869730902 | Accepted | import numpy as np
N = int(input())
T,A = np.array(list(map(int,input().split())))
H = np.array(list(map(int,input().split())))
ave = T-H*0.006
dif = abs(ave - A)
print(np.where(min(dif) == dif)[0][0]+1)
|
p02697 | s155952371 | Wrong Answer | N, M = map(int,input().split())
r = 1
l = N
for i in range(M):
print(r,l)
r += 1
l -= 1
|
p03293 | s212117160 | Wrong Answer | S = list(input())
T = list(input())
S.sort()
T.sort()
print('Yes' if S == T else 'No') |
p03605 | s929064581 | Wrong Answer | a = input()
if a[0] == 9 or a[1] == 9:
print('Yes')
else:
print('No') |
p02796 | s155400286 | Wrong Answer | n = int(input())
r = [list(map(int,input().split())) for _ in range(n)]
for i in range(n):
r[i] = [r[i][0] - r[i][1], r[i][0] + r[i][1]]
r.sort(key = lambda x:x[1])
print(r)
cur = -1001001001
ans = 0
for i in range(n):
if cur <= r[i][0]:
ans += 1
cur = r[i][1]
print(ans) |
p03252 | s974211344 | Accepted | from collections import Counter
s=sorted(Counter(input()).values())
t=sorted(Counter(input()).values())
print("Yes" if s==t else "No") |
p02748 | s166179612 | Wrong Answer | a,b,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=min(A)+min(B)
for i in range(m):
x,y,c=map(int,input().split())
tmp=A[x-1]+B[y-1]+c
ans=min(ans,tmp)
print(ans) |
p03821 | s045752568 | Accepted | N = int(input())
A, B = [], []
for _ in range(N):
a, b = map(int, input().split(" "))
A.append(a)
B.append(b)
ans = 0
added = 0
for a, b in zip(A[::-1], B[::-1]):
if (a + added) % b != 0:
ans += b - (a + added) % b
added += b - (a + added) % b
print(ans) |
p02647 | s134598166 | Accepted | import numpy as np
from numba import njit
@njit
def update(a):
n = len(a)
b = np.zeros_like(a)
for i,x in enumerate(a):
l = max(0, i-x)
r = min(n-1, i+x)
b[l] += 1
if r+1 < n:
b[r+1] -= 1
b = np.cumsum(b)
return b
n,k = map(int, input().split())
a = np.array(list(map(int, input().split())))
for _ in range(k):
a = update(a)
if np.all(a==n):
break
print(' '.join(map(str, a))) |
p03163 | s754836196 | Wrong Answer | def resolve():
n, w = map(int, input().split())
goods = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(n):
for j in range(w + 1):
if j < goods[i][0] + 1:
dp[i + 1][j] = dp[i][j]
else:
dp[i + 1][j] = max(dp[i][j], dp[i][j - goods[i][0] + 1] + goods[i][1])
print(dp[n][w])
resolve() |
p03456 | s001407551 | Accepted | a=int(input().replace(" ",""))
for i in range(20000):
if i**2==a:
print("Yes")
break
if i**2>a:
print("No")
break |
p02664 | s206593710 | Accepted | T=input()
print(T.replace("?","D")) |
p02897 | s480879353 | Wrong Answer | n = int(input())
ans=((n+1//2)/n)
print(ans) |
p03479 | s315468534 | Accepted | x,y=map(int,input().split())
count=0
while x<=y:
count+=1
x*=2
print(count) |
p02689 | s971203850 | Wrong Answer | n,m = map(int, input().split())
A = []
B = []
ans = 0
H = list(map(int,input().split()))
for i in range(m-1):
a, b = map(int, input().split())
A.append(int(a))
B.append(int(b))
for i in range(m-1):
if H[(A[i])-1] < H[(B[i])-1]:
ans += 1
for i in range(m-1):
if A.count(i) == 0 and B.count(i) == 0:
ans += 1
for i in range(m-1):
for j in range(m-1):
if A[i] == B[j] and B[i] == A[j]:
ans += 1
print(ans) |
p03285 | s123385141 | Accepted | n=int(input())
ans=0
for i in range(n+1):
for j in range(n+1):
if i*4+j*7==n:
ans=1
print(["No","Yes"][ans]) |
p02730 | s903524221 | Accepted | def isKaibun(str):
isKaibun = True
length = len(str)
for i in range(length):
if str[i] != str[length - i - 1]:
isKaibun = False
break
return isKaibun
# 整数の入力
S = input()
N = len(S)
output = "No"
flag1 = isKaibun(S)
flag2 = isKaibun(S[0 : int(((N-1)/2))])
flag3 = isKaibun(S[int(((N+3)/2)-1): N])
if flag1 and flag2 and flag3:
output = "Yes"
########### 出力
print(output)
|
p03251 | s468019314 | Wrong Answer | n, m, xx, yy = map(int, input().split())
x = list(map(int , input().split()))
y = list(map(int , input().split()))
x.sort()
y.sort()
zx = max(x[-1], xx)
zy = min(y[0], yy)
if yy == x[-1]:
print('War')
exit()
if xx == y[0]:
print('War')
exit()
if x[-1] == y[0]:
print('War')
exit()
print('No War') |
p03208 | s597903042 | Accepted | N,K = map(int,(input().split()))
h = [int(input())for _ in range(N)]
h.sort()
print(min(h[i+K-1]-h[i] for i in range(N-K+1))) |
p03293 | s680381364 | Accepted | s = input()
t = input()
n = len(s)
ans = 'No'
for a in range(0, n):
if s == t:
ans = 'Yes'
break
t = t[1:] + t[0]
print(ans)
|
p02548 | s962795742 | Wrong Answer | import numpy as np
N = int(input())
X_arr = np.empty(N - 1, dtype = int)
ans = 0
for c in range(1, N):
np.append(X_arr, N - c)
for b in range(1, N):
ans += np.count_nonzero(X_arr % b == 0)
print(ans) |
p02820 | s979176583 | Wrong Answer | n, k = map(int, input().split())
wp, wr, ws = map(int, input().split())
hand = {"p":wp, "r":wr, "s":ws}
t = input()
lst = []
for i in range(k):
lst.append([t[j] for j in range(len(t)) if j%k==i])
ans = 0
for b in lst:
tmp = ""
for i in b:
if i==tmp:
tmp=""
else:
ans+=hand[i]
tmp=i
print(ans) |
p03035 | s126943541 | Accepted | def solver():
A, B = [int(n) for n in input().split()]
if A <=5:
return 0
if 6 <= A <= 12:
return B//2
if 13 <= A:
return B
if __name__=='__main__':
print(solver())
|
p03338 | s129341141 | Wrong Answer | n = int(input())
s = list(input())
half = int(n/2)
max1 = 0
for i in range(half):
f = set(s[:half-i])
b = set(s[half-i:])
union = len(f&b)
if max1 <= union:
max1 = union
else:
break
max2 = 0
for i in range(half):
f = set(s[:half+i])
b = set(s[half+i:])
union = len(f&b)
if max2 <= union:
max2 = union
else:
break
ans = max1 if max1>max2 else max2
print(ans) |
p03324 | s816448145 | Wrong Answer | d, n = map(int, input().split())
print(100**d*n) |
p03407 | s050930342 | Accepted | a, b, c = map(int, input().split())
if a+b >= c:
print('Yes')
else:
print('No')
|
p02583 | s805180656 | Accepted | n = int(input())
ll = list(map(int, input().split()))
cnt = 0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
a,b,c = ll[i], ll[j], ll[k]
if a == b or b == c or c == a:
continue
vs = [a,b,c]
vs.sort()
if vs[0] + vs[1] > vs[2]:
cnt += 1
# print(vs)
print(cnt)
|
p03565 | s095842097 | Accepted | s = input()[::-1]
t = input()[::-1]
sl, tl = len(s), len(t)
for i in range(sl - tl + 1):
for j in range(tl):
if s[i + j] != "?" and s[i + j] != t[j]:
break
else:
print((s[:i] + t + s[i + tl:]).replace("?", "a")[::-1])
break
else:
print("UNRESTORABLE")
|
p03077 | s616551793 | Wrong Answer | n = int(input())
trans = [int(input()) for _ in range(5)]
x = min(trans)
t = n-1 // x
t += 4
print(t) |
p02970 | s630375511 | Wrong Answer | N,D = map(int, input().split())
print(N//D+1) |
p03862 | s447402247 | Wrong Answer | import sys
stdin = sys.stdin
from itertools import product
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
n, x = na()
a = na()
b = list()
apre = a[0]
ans = 0
for ai in a:
eat = max(0, apre + ai - x)
ans += eat
apre = ai - eat
print(ans) |
p03565 | s946434356 | Wrong Answer | import re
S,T=open(0)
S=S.replace('?','.')
s=len(S)
t=len(T)
for i in range(s-t,-1,-1):
if re.match(S[i:i+t],T):
print((S[:i]+T+S[i+t:]).replace('.','a'))
exit()
print('UNRESTORABLE')
|
p02699 | s385747929 | Accepted | s, w = list(map(int,input().split()))
if s > w:
print('safe')
else:
print('unsafe')
|
p03105 | s377103901 | Wrong Answer | S = str(input())
x = len(S)
if '0' in S:
y0 = S.count('0')
else:
y0 = 0
if '1' in S:
y1 = S.count('1')
else:
y1 = 0
d = abs(y0 - y1)
print(x - d) |
p02836 | s385326969 | Wrong Answer | s = input()
l1 = len(s)
res = 0
if l1%2 ==0:
for i in range(l1%2+1):
if s[i]!=s[-i-1]:
res +=1
else :
for i in range(l1//2):
if s[i]!=s[-i-1]:
res +=1
print(res) |
p03556 | s681259112 | Wrong Answer | import math
n = int(input())
for i in range (n,1,-1):
ans= math.sqrt(i)
sq= int(ans)
sq=float(sq)
#print(ans,sq)
if sq==ans:
print(i)
break
|
p02958 | s990689188 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N = int(input())
p = list(map(int, input().split()))
s_p = sorted(p)
c = 0
for i in range(N):
if p[i] != s_p[i]:
c += 1
if c > 2:
print('NO')
exit()
print('YES')
if __name__ == "__main__":
main()
|
p03557 | s645717039 | Accepted | import bisect
n = int(input())
*a, = sorted(map(int, input().split()))
*b, = sorted(map(int, input().split()))
*c, = sorted(map(int, input().split()))
ans = 0
for _b in b:
_a = bisect.bisect_left(a, _b)
_c = bisect.bisect_right(c, _b)
ans += _a*(len(c)-_c)
print(ans)
|
p03106 | s884375150 | Accepted | A,B,K = map(int, input().split(" "))
count = 0
for i in range(1,A+1)[::-1]:
if A%i==0 and B%i==0:
count+=1
if count==K:
print(i)
break
|
p04030 | s250202807 | Accepted | a = input()
test = ''
for i in range(len(a)):
if a[i] == '0':
test += '0'
elif a[i] == '1':
test += '1'
else:
if len(a) == 0:
pass
else:
test = test[:-1]
print(test) |
p02996 | s730362140 | Accepted | n = int(input())
ab = []
for i in range(n):
ab.append(tuple(map(int,input().split())))
ab.sort(key=lambda x: x[1])
m = 0
ans = "Yes"
for ai,bi in ab:
m += ai
if m > bi:
ans = "No"
print(ans)
|
p02971 | s229751665 | Accepted | import copy
n=int(input())
tmp=0
a=[]
for i in range(n):
a.append(int(input()))
s=copy.deepcopy(a)
s.sort(reverse=True)
t=s[0]
tt=s[1]
for i in range(n):
if a[i]==t:
print(tt)
else:
print(t) |
p03146 | s988877746 | Accepted | s = int(input())
arr = []
m = 1
while s not in arr:
arr.append(s)
if s % 2 == 0:
s //= 2
else:
s = 3 * s + 1
m += 1
print(m) |
p03385 | s716884346 | Accepted | s = raw_input()
if 'a' in s and 'b' in s and 'c' in s:
print 'Yes'
else:
print 'No'
|
p03293 | s580565948 | Accepted | s = input()
t = input()
for i in range(len(s)):
s = s[-1] + s[:-1]
#print(s)
if s == t:
print('Yes')
exit()
print('No') |
p03030 | s316844309 | Accepted | n = int(input())
d = []
for i in range(n):
s, p = input().split()
d.append((s,int(p),i+1))
d.sort(key = lambda x: x[1], reverse = True)
d.sort(key = lambda x: x[0])
for i in range(n):
print(d[i][2]) |
p02843 | s922801075 | Accepted | import math
x = int(input())
if (x >= 100) & (math.ceil(((x % 100) / 5)) <= x // 100):
print(1)
else:
print(0) |
p02723 | s425702115 | Wrong Answer | S = list(input())
if S[-1] == S[-2]:
if S[-3] == S[-4]:
print("Yes")
else:
print("No")
|
p02873 | s392322118 | Wrong Answer | S = input()
n = len(S) + 1
num = [0] * n
for i in range(n-1):
if S[i] == '<':
num[i + 1] = max(num[i] + 1, num[i + 1])
for i in range(n - 2, -1, -1):
if S[i] == '>':
num[i] = max(num[i + 1] + 1, num[i])
print(sum(num))
print(num)
|
p03417 | s247852258 | Accepted | n,m=map(int,input().split())
if n >2 and m >2:
ans = (n-2)*(m-2)
elif n ==2 or m ==2:
ans = 0
elif n == 1 and m == 1:
ans = 1
elif n == 1:
ans = m-2
else:
ans = n-2
print(ans) |
p03359 | s638077733 | Accepted | """
author : halo2halo
date : 24, Jan, 2020
"""
import sys
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b = map(int, readline().split())
print(a if a <= b else a - 1)
|
p03323 | s912185026 | Accepted | A, B = map(int, input().split())
if A <= 8 and B <= 8:
print('Yay!')
else:
print(':(') |
p02748 | s900253606 | Accepted | import numpy as np
A,B,M = map(int,input().split())
a = input().split()
b = input().split()
num = int(min(a)) + int(min(b))
for _ in range(M):
m1,m2,m3 = map(int,input().split())
res = int(a[m1-1])+int(b[m2-1]) - m3
num = min(num,res)
print(num) |
p03035 | s331633542 | Wrong Answer | a, b = map(int, input().split())
if a >= 13:
print(b)
elif 12 >= a >= 6:
print(b / 2)
else:
print(0) |
p03162 | s542615065 | Accepted | n = int(input())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
dp = [[0 for i in range(3)] for i in range(n+10)]
#print(a)
#print(dp)
for i in range(1,n+1):
dp[i][0] = max(dp[i-1][1] + a[i-1][0],dp[i-1][2] + a[i-1][0])
dp[i][1] = max(dp[i-1][0] + a[i-1][1],dp[i-1][2] + a[i-1][1])
dp[i][2] = max(dp[i-1][0] + a[i-1][2],dp[i-1][1] + a[i-1][2])
print(max(dp[n][0],dp[n][1],dp[n][2])) |
p03860 | s358501694 | Wrong Answer | import sys
input = sys.stdin.readline
x = input().split()
print("A" + x[0] + "C") |
p03469 | s731431261 | Accepted | s = input()
print("2018" + s[4:]) |
p03041 | s692552934 | Accepted | N=input("")
N=N.split(" ")
K=int(N[1])
N=N[0]
s=str(input(""))
print(s[0:K-1]+s[K-1].lower()+s[K:]) |
p03262 | s189511288 | Accepted | import fractions
N,X = map(int,input().split())
x = list(map(int,input().split()))
x = sorted([abs(i - X) for i in x])
ans = x[0]
for i in x[1:]:
ans = fractions.gcd(ans,i)
print(ans) |
p02859 | s309426476 | Accepted | import sys
a = int(sys.stdin.readline().rstrip())
print(a**2) |
p02711 | s341442570 | Accepted | a = input()
for aa in a:
if aa == '7':
print('Yes')
break
else:
print('No')
|
p03998 | s210546577 | Accepted | s_a = list(input())[::-1]
s_b = list(input())[::-1]
s_c = list(input())[::-1]
person = "a"
try:
while True:
if person == "a":
person = s_a.pop()
elif person == "b":
person = s_b.pop()
else:
person = s_c.pop()
except IndexError:
print(person.upper()) |
p03000 | s580943933 | Accepted | n, x = map(int,input().split())
l = list(map(int,input().split()))
SUM = 0
cnt = 1
for i in l:
SUM += i
if SUM > x:
print(cnt)
exit()
cnt += 1
else:
print(cnt) |
p02553 | s641542679 | Accepted | a,b,c,d = [int(_n) for _n in input().split()]
print(max([a*c, a*d, b*c, b*d])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.