problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02778 | s960666102 | Accepted | S = input()
res = ""
for i in range(len(S)):
res += "x"
print(res) |
p02957 | s254740028 | Wrong Answer | A,B=map(int,input().split())
if (A+B)%2==0:
print (A+B/2)
else:
print ('IMPOSSIBLE') |
p03698 | s568805212 | Accepted | s=str(input())
t=[]
t.append(s[0])
for i in range(1,len(s)):
if s[i] in t:
print("no")
exit()
t.append(s[i])
print("yes") |
p03624 | s269428549 | Wrong Answer | S = input()
S = sorted(S)
S_dict = {}
cnt = 0
for s in S:
if s not in S_dict:
S_dict[s] = 1
print(S_dict)
ALL = 'abcdefghijklmnopqrstuvwxyz'
answer= None
for c in ALL:
if c not in S_dict:
answer = c
break
print(answer)
|
p03797 | s732552966 | Wrong Answer | N, M = map(int,input().split())
ans = 0
for i in range(max(0,M//2-N-100), max(0, M//2-N+100)):
ans = max(ans,min(N+i//2,(M-i)//2))
print(ans) |
p02684 | s704376691 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
done = [0]*n
stay = 1
for i in range(1, k+1):
if done[stay-1] != 0:
break
done[stay-1] = i
stay = a[stay-1]
nokori = k + 1 - i
if nokori != 1:
loop = i - done[stay-1]
for i in range(nokori%loop):
stay = a[stay-1]... |
p03073 | s437268458 | Wrong Answer | S=list(input())
A=[]
B=[]
a=0
b=0
for i in range(len(S)):
if i%2==0:
A.append("0")
else:
A.append("1")
for i in range(len(S)):
if A[i]!=S[i]:
a+=1
for j in range(len(S)):
if i%2==0:
B.append("1")
else:
B.append("0")
for j in range(len(S)):
if B[j]!=S[j]:
... |
p03632 | s966154442 | Accepted | a, b, c, d = map(int, input().split())
print(max(min(b, d) - max(a, c), 0)) |
p03607 | s796744141 | Accepted | N = int(input())
A = [int(input()) for _ in range(N)]
d = {}
#key設定
for i in A:
d[i]=0
#数字keyが偶数回出たら0,奇数回出たら1になるようにvalueを設定
for i in A:
if d[i]==1:
d[i]=0
else:
d[i]=1
print(sum(d.values())) |
p02777 | s598536661 | Accepted | s,t=input().split()
a,b=map(int,input().split())
if input()==s:
print(str(a-1)+" "+str(b))
else:
print(str(a)+" "+str(b-1)) |
p03419 | s403390060 | Accepted | n,m=map(int,input().split())
if n==1 and m==1:
ans=1
print(ans)
exit()
if min(n,m)==1:
ans=max(n,m)-2
print(ans)
exit()
print((n-2)*(m-2))
|
p02732 | s072191608 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = [0] * (n+1)
for x in a: cnt[x] += 1
s = 0
for x in cnt: s += x * (x-1) // 2
for x in a:
ans = s
if cnt[x] >= 2: ans -= cnt[x]-1
print(ans)
|
p02817 | s548212540 | Wrong Answer | if __name__ == '__main__':
a, b = input().split(' ')
print(a+b) |
p02696 | s102090713 | Accepted | A,B,N = map(int,input().split())
if B>N:
print(int(A*N/B)-A*(int(N/B)))
else:
print(int(A*(B-1)/B)-A*(int((B-1)/B))) |
p03095 | s372655877 | Wrong Answer | from collections import Counter
n = int(input())
s = list(input())
c = Counter(s)
ans = 1
for i in c.values():
ans *= ((i+1) % 1000000007)
print(ans-1) |
p03211 | s564858761 | Accepted | S = input()
c = ''
L = []
i = 0
j = 3
min = 10**9
while j<=len(S):
c = S[i:j]
L.append(int(c))
i += 1
j += 1
for element in L:
if abs(753-element) < min:
min = abs(753-element)
print(min) |
p03379 | s882277193 | Accepted | n,*x=map(int,open(0).read().split())
y=sorted(x)[n//2-1:n//2+1]
for i in x:print(y[i<=y[0]])
|
p02552 | s085183269 | Accepted | x=int(input())
if (x==1):
print(0)
else:
print(1) |
p03997 | s029531749 | Wrong Answer | data = [int(input()) for i in range(3)]
print((data[0]+data[1])*data[2]*0.5) |
p03494 | s420985548 | Accepted | N=int(input())
A=list(map(int,input().split()))
count=0
while all(a%2==0 for a in A):
A=[a//2 for a in A]
count+=1
print(count) |
p03796 | s008223697 | Accepted | N = int(input())
power = 1
for i in range(1,N+1):
power *= i
if power >= 10**9 + 7:
power %= 10**9 + 7
print(power % (10**9 + 7)) |
p03545 | s317040159 | Wrong Answer | a=input()
n=len(a)
for i in range(1<<n):
sum=0
st=''
for j in range(n):
if i & (1 <<j):sum +=int(a[j]); st+= '+' + a[j]
else: st+= '-' + a[j]
if sum==7:break
print(st[1:] + '=7') |
p03109 | s537010644 | Wrong Answer | apple = list(map(int, input().split("/")))
if apple[0] >= 2020:
print("TBD")
elif apple[0] <= 2018:
print("Hesise")
else:
if apple[1] <= 4:
print("Heise")
elif apple[1] >= 5:
print("TBD")
|
p03835 | s827032144 | Wrong Answer | k, s = list(map(int, input().split()))
count = 0
for p in range(k+1):
if p > s:
break
for q in range(k+1):
if p + q < s:
break
for r in range(k+1):
t = p + q + r
if t == s:
count += 1
break
print(count) |
p03627 | s259009219 | Accepted | n = int(input())
A = list(map(int, input().split()))
import collections
c = collections.Counter(A)
M = 0
N = 0
for x in c.items():
if x[1] >= 4 and x[0] > M:
M = x[0]
N = x[0]
elif x[1] >= 2 and x[0] > M:
N = M
M = x[0]
elif x[1] >= 2 and x[0] > N:
N = x[0]
print(M... |
p03293 | s447330282 | Accepted | s = input()
t = input()
s_list = list(s)
flg = False
for i in range(len(s)):
s_list.insert(0,s_list[-1])
del s_list[-1]
if "".join(s_list) == t:
print('Yes')
flg = True
break
if not flg:
print('No') |
p02879 | s500679072 | Accepted | A, B = map(int,input().split())
if A<10 and B<10:
print(A*B)
else:
print(-1) |
p03814 | s362461603 | Accepted | def solve():
S = input()
# print(S)
head = S.index("A")
tail = S[::-1].index("Z")
tail = len(S) - tail
return S[head:tail]
if __name__ == '__main__':
res = solve()
print(len(res))
|
p02658 | s899103785 | Wrong Answer | n = int(input())
ans = 1
x = 10 ** 18
a = list(map(int,input().split()))
for i in range(n):
ans = ans * a[i]
answer = ans
if (ans > x):
print(-1)
else:
print(answer) |
p02647 | s313728814 | Accepted | from itertools import accumulate
import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
c_sum = [0] * (n+1)
now = [0] * n
if k > 50:
ans = [n] * n
print(*ans)
exit()
for i in range(k):
c_sum = [0] * (n+1)
for x, d in enumerate(a):
s = max(0, x - d)
c_sum[... |
p02813 | s968811803 | Accepted | from itertools import permutations
N=int(input())
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
P="".join(map(str,P))
Q="".join(map(str,Q))
for i,v in enumerate(permutations(range(1,N+1))):
v="".join(map(str,v))
if P==v:
a=i
if Q==v:
b=i
print(abs(a-b)) |
p02817 | s666705196 | Wrong Answer | s,t=input().split()
print(s+t) |
p02696 | s440212602 | Accepted | A,B,N = map(int, input().split())
if B>N:
print(int(A*N/B)-A*int(N/B))
else:
print(int(A*(B-1)/B)) |
p03261 | s009783651 | Accepted | N = int(input())
s_li = []
ans = "Yes"
for i in range(N):
s = input()
if i > 0:
if s in s_li or s_li[i - 1][-1] != s[0]:
ans = "No"
s_li.append(s)
print(ans)
|
p03324 | s633636554 | Wrong Answer | d, n = map(int, input().split())
print(int(100**d *n)) |
p02711 | s956861415 | Accepted | N = input()
if N[0] == '7' or N[1] == '7' or N[2] == '7' :
print ('Yes')
else :
print ('No' ) |
p03774 | s287058160 | Accepted | N, M = map(int, input().split())
sp = [list(map(int, input().split())) for i in range(N)]
cp = [list(map(int, input().split())) for i in range(M)]
def mah(p1, p2):
return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])
sci = []
for i in range(N):
mindis = 0
minind = 0
for j in range(M):
m = mah(sp[i]... |
p03000 | s560806812 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
sum = 0
ans = 0
for i in range(n):
if sum + l[ans] > x:
break
sum += l[ans]
ans += 1
print(ans+1)
|
p03329 | s328434195 | Accepted | N = int(input())
ans = 10**5
for a in range(0, N+1):
cnt = 0
t = 1
for i in range(7):
cnt += (a//t)%6
t *= 6
t = 1
for i in range(6):
cnt += ((N-a)//t)%9
t *= 9
ans = min(ans, cnt)
print(ans) |
p03910 | s393928021 | Accepted | n=int(input())
a=0
i=1
while a<n:
a+=i
i+=1
tmp=a-n
for j in range(1,i):
if j!=tmp:
print(j) |
p02900 | s372496076 | Wrong Answer | def factorization(n):
arr = [1]
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
while temp%i==0:
temp //= i
arr.append(i)
if len(arr)==1:
arr.append(n)
return arr
A, B = map(int,input().split())
print(len(set(factori... |
p02791 | s340725443 | Accepted | from sys import stdin
import sys
import math
from functools import reduce
import itertools
n = int(stdin.readline().rstrip())
p = [int(x) for x in stdin.readline().rstrip().split()]
m = n
count = 0
for i in range(n):
m = min([m, p[i]])
if m == p[i]: count = count + 1
print(count) |
p02948 | s759178920 | Accepted | import heapq
N,M = map(int,input().split())
jobs = [ [] for _ in range(M+1) ]
for _ in range(N):
a,b = map(int,input().split())
if a <= M:
jobs[a].append(b)
pq = []
d = 1
res = 0
for _ in range(M-1, -1, -1):
for b in jobs[d]:
heapq.heappush(pq, -b)
if pq:
res += -heapq.heappop(pq)
d += 1
print(r... |
p02847 | s641918558 | Wrong Answer | s=input()
if s=="SUN":
print(7)
elif s=="SAT":
print(1)
elif s=="FRI":
print(2)
elif s=="THU":
print(3)
elif s=="WED":
print(4)
elif s=="THE":
print(5)
elif s=="MON":
print(6) |
p03759 | s878243239 | Accepted | a, b, c = map(int, input().split())
if b - a == c - b:
print('YES')
else:
print('NO') |
p03493 | s663021383 | Wrong Answer | from sys import stdin |
p02771 | s251317321 | Accepted | def solve():
A, B, C = map(int, input().split())
if A == B and A != C:
print('Yes')
elif A == C and A != B:
print('Yes')
elif B == C and A != B:
print('Yes')
else:
print('No')
if __name__ == '__main__':
solve()
|
p04044 | s682869896 | Wrong Answer | n,l = map(int, input().split())
Li = []
i = 0
while i<n:
li = list(input())
li.sort()
Li.append("".join(li))
i += 1
else:
Li.sort()
print("".join(Li)) |
p02723 | s054232494 | Wrong Answer | s = input()
f = True
if s[2] == s[3] and s[4] == s[5]:
print('Yes')
else:
print('NO')
|
p02900 | s260612400 | Accepted | import math
def primes(n):
l= []
for i in range(2,math.floor(math.sqrt(n))):
while n % i == 0:
n = n//i
l.append(i)
if n == 1:
break
if n > 1:
l.append(n)
return l
a,b=map(int,input().split())
sa=set(primes(a))
sb=set(primes(b))
sans=sa.... |
p02630 | s262106099 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
kosu = dict(Counter(a))
ans = sum(a)
for i in range(q):
b, c = map(int, input().split())
if b in kosu:
if c not in kosu:
kosu[c] = 0
ans += (c - b) * kosu[b]
kosu[c] += k... |
p03338 | s288840199 | Wrong Answer | n = int(input())
s = list(input())
ans = 0
for i in range(n):
x = s[:i+1]
y = s[i:]
ans = max(ans,len(set(x)&set(y)))
print(ans) |
p03073 | s295620997 | Accepted | a = input()
x = 0
y = 0
for t in range(0,len(a)):
if t%2 == 0 and a[t] == "1":
x = x+1
if a[t] == "0" and t%2 == 1:
x = x+1
for t in range(0,len(a)):
if t%2 == 0 and a[t] == "0":
y = y+1
if t%2 == 1 and a[t] == "1":
y= y+1
print (min(y,x))
|
p02881 | s546736747 | Wrong Answer | def main():
n = int(input())
count = n + 1
for i in range(1,int(n**0.5)):
if n % i == 0 and n // i + i < count:
count = n // i + i
print(count-2)
if __name__ == '__main__':
main() |
p02761 | s956266400 | Wrong Answer | N, M = [int(x) for x in input().split()]
S = []
for i in range(N):
S.append(None)
for i in range(M):
s, c = [int(x) for x in input().split()]
if S[s - 1] == None:
S[s - 1] = c
elif S[s - 1] == c:
pass
else:
S[0] = 0
break
if S[0] == 0 and N > 1:
print(-1)
... |
p03012 | s734965486 | Accepted | n = int(input())
w = list(map(int, input().split()))
ans = 10**6
for i in range(n-1):
ans = min(ans, abs(sum(w[:i+1]) - sum(w[i+1:])))
print(ans) |
p02726 | s116426697 | Accepted | from collections import defaultdict as dd
N,X,Y = map(int, input().split())
D = dd(int)
for i in range(1,N):
for j in range(i+1,N+1):
D[min(abs(i-j),abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1)] += 1
for k in range(1,N):
print (D[k]) |
p02571 | s639738766 | Accepted | s, t = open(0).read().split()
n, m = len(s), len(t)
a = 2000
for i in range(n - m + 1):
b = 0
for j in range(m):
b += s[i + j] != t[j]
a = min(a, b)
print(a) |
p02548 | s996693932 | Accepted | n=int(input())
ans=0
for i in range(1,n):
ans+=(n-1)//i
print(ans) |
p02548 | s704209576 | Accepted | N = int(input())
ans = 0
for a in range(1, N):
ans += (N-1) // a
print(ans) |
p03943 | s485201435 | Wrong Answer | a,b,c = map(int,input().split())
if (a+b+c) % 2 == 0:
print("Yes")
else:
print("No")
|
p02897 | s448216371 | Accepted | import math
N = int(input())
if N % 2 == 0:
ans = 0.5
else :
ans = math.ceil(N / 2) / N
print(ans) |
p02748 | s027503509 | Accepted | def main():
A, B, M = map(int, input().split())
aryA = [int(v) for v in input().split()]
aryB = [int(v) for v in input().split()]
minPrice = min(aryA) + min(aryB)
for _ in range(M):
x, y, c = map(int, input().split())
x -= 1
y -= 1
minPrice = min(minPrice, aryA[x... |
p03719 | s288853194 | Wrong Answer | a,b,c = map(int,input().split())
if a<c<b:
print("Yes")
else:
print("No") |
p03796 | s688023471 | Accepted | n = int(input())
mod = 10**9+7
ans = 1
for i in range(n):
ans *= (i+1)
ans %= mod
print(ans) |
p03607 | s535957161 | Accepted | import collections
n = int(input())
a = [int(input()) for _ in range(n)]
c = list(collections.Counter(a).values())
print(sum([c_i % 2 for c_i in c]))
|
p02595 | s046561928 | Wrong Answer | from math import *
n,d=map(int,input().split())
k=d*d
ans=0
for i in range(n):
x,y=map(int,input().split())
x1=x**2
y1=y**2
m=x1+y1
if m>=k:
ans=ans+1
print(ans) |
p02747 | s137031662 | Wrong Answer | import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict, deque
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(input())
def MI(): return map(int, input().split())
def L... |
p02628 | s853568248 | Wrong Answer | import heapq
N,K = map(int,input().split())
p = list(map(int,input().split()))
sum(heapq.nsmallest(K,p)) |
p03419 | s009620873 | Wrong Answer | n,m=map(int,input().split())
n,m=min(n,m),max(n,m)
if n==1:
print(max(0,m-2))
exit()
else:
print(max(0,(n-2)*(m-2))) |
p03592 | s618654866 | Wrong Answer | n, m, k = map(int, input().split())
for i in range(n + 1):
for j in range(m + 1):
black = n * (m - j) + (n - i) * m
if black == k:
print("Yes")
exit()
print("No") |
p03779 | s291004327 | Accepted |
def main():
n = int(input())
pos = 0
count = 0
while pos < n:
count += 1
pos += count
print(count)
if __name__ == '__main__':
main() |
p02835 | s784267952 | Accepted | a,b,c=map(int,input().split())
if a+b+c>=22:
print("bust")
else:
print("win") |
p03548 | s803746484 | Wrong Answer | X,Y,Z = map(int, input().split())
X -= 2 * Z
X -= Y
ans = 0
if 0 < X:
ans = 1 + X // (Y + Z)
print(ans)
|
p02836 | s795734648 | Accepted | S = input()
num = len(S)//2
if num % 2 == 0:
for i in range(num):
if S[i] == S[-i-1]:
num -= 1
else:
for i in range(num):
if S[i] == S[-i-1]:
num -= 1
print(num) |
p03380 | s305662509 | Accepted | from itertools import combinations
n = int(input())
a = [int(i) for i in input().split()]
a.sort()
ai = a[-1]
aj = -1
for i in range(n-1):
if abs(a[i] - ai/2) <= abs(aj - ai/2):
aj = a[i]
print(ai, aj) |
p02682 | s741796920 | Accepted | a,b,c,k=map(int,input().split())
'''l=[]
for _ in range(a):
l.append(1)
for _ in range(b):
l.append(0)
for _ in range(c):
l.append(-1)
print(sum(l[:k]))'''
su=0
if a>=k:
print(k)
else:
su=su+a
tem=k-a
if b>=tem:
print(su)
else:
tem1=tem-b
print(su-tem1) |
p04034 | s094857701 | Wrong Answer | n, m = map(int, input().split())
s = [0] * n
s[0] = 1
b = [1] * n
for i in range(m):
x, y = map(int, input().split())
b[x-1] -= 1
b[y-1] += 1
s[x-1] = int(b[x-1] != 0)
s[y-1] = s[x-1]
print(sum(s))
|
p03407 | s494571868 | Accepted | a, b, c = map(int, input().split())
total = a + b
if total >= c:
print("Yes")
else:
print("No") |
p02596 | s918798577 | Accepted | import sys
k=int(input())
mae=0
for i in range(10**6+1):
now=(10*mae+7)
if now%k==0:
print(i+1)
sys.exit()
mae=now%k
print(-1) |
p02785 | s713854158 | Wrong Answer | n,k = map(int,input().split())
h= list(map(int,input().split()))
sorted(h)
print(sum(h[:-k+1])) |
p02829 | s360512246 | Wrong Answer | a = int(input())
b = int(input())
for i in (1,4):
if i not in [1,2,3]:
print(i) |
p02723 | s322022663 | Accepted | string=input()
print("Yes" if string[2]==string[3] and string[4]==string[5] else "No") |
p03645 | s869777568 | Accepted | n,m=map(int,input().split())
edg1=[0]*(n+1)
edgn=[0]*(n+1)
for i in range(m):
a,b=map(int,input().split())
if a==1:
edg1[b]=1
if b==n:
edgn[a]=1
f=1
for i in range(2,n+1):
if edg1[i]==1 and edgn[i]==1:
f=0
print("POSSIBLE" if f==0 else "IMPOSSIBLE")
|
p02690 | s614034527 | Accepted | x = int(input())
for a in range(10**3):
for b in range(10**3):
frag = False
if a ** 5 - b ** 5 == x:
print(a,b)
frag = True
break
elif (-a) ** 5 - b ** 5 == x:
print(-a,b)
frag = True
break
elif a ** 5 - (-b) ** 5 == x:
print(a,-b)
frag = True
... |
p02665 | s701576489 | Wrong Answer | N = int(input())
An = list(map(int,input().split()))
Sum = 0
Sum += 2**N
for i in An:
Sum+=2**i |
p02953 | s522624627 | Wrong Answer | import sys
N = int(input())
H = list(map(int,input().split()))
for i in range(1,N-1):
if not(H[i-1] <= H[i] <= H[i+1]):
tmp = H[i] - 1
if not(H[i-1] <= tmp <= H[i+1]):
print('No')
sys.exit()
H[i] = tmp
H[i] -= 1
print('Yes') |
p02917 | s818806560 | Accepted | n = int(input())
b = list(map(int, input().split()))
a = [b[0]]
for num, i in enumerate(b[1:]):
a.append(min(i, b[num]))
a.append(b[-1])
print(sum(a))
|
p03565 | s634681594 | Accepted | s = input()
t = input()
ans = []
a = ''
for i in range(len(s)-len(t)+1):
flag = True
a = s[:i]
for j in range(len(t)):
if s[i+j] == t[j] or s[i+j] == '?':
a += t[j]
else:
flag = False
break
a += s[i+j+1:]
if flag:
ans.append(a.replace('?','... |
p02553 | s661480038 | Accepted | #!/usr/bin/python
# -*- coding: UTF-8 -*-
import sys
def get_ints():
return map(int, sys.stdin.readline().strip().split())
def main():
a, b, c, d = get_ints()
print(max(a*c, a*d, b*c, b*d))
if __name__ == "__main__":
main()
|
p02753 | s118691289 | Wrong Answer | test_input = str(input())
if test_input.count("A") == 3 or test_input.count("B") == 3:
print ("FALSE")
else:
print("TRUE")
|
p02832 | s151364053 | Wrong Answer | n = int(input())
a_list = list(map(int,input().split()))
n_len = len(a_list)
left = 0
count = 0
for i in range(1,n+1):
for j in range(left,n):
if a_list[j] == i:
left = j+1
break
count += 1
if left > n_len-1:
print(count)
break
else:
print(-1) |
p02570 | s147832923 | Wrong Answer | x,y ,z= map(int,input().split())
ans=x/z
print(ans)
if ans>=y:
print('Yes')
else:
print('No') |
p03385 | s516149148 | Accepted | s = input()
print("Yes" if len(set(s))==3 else "No") |
p03720 | s203583096 | Accepted | n,m=map(int,input().split())
A=[]
B=[]
for i in range(m):
a,b=map(int,input().split())
A.append(a)
B.append(b)
for j in range(n):
print(A.count(j+1)+B.count(j+1)) |
p02911 | s994039183 | Wrong Answer | import sys
n,k,q = map(int,input().split())
if k > q:
for _ in range(n):
print('Yes')
sys.exit()
A = []
for _ in range(q):
a = int(input())
A.append(a)
ans = [0]*n
from collections import Counter
cnt = Counter(A)
for key,v in cnt.items():
if v >= q-k+1:
ans[key-1] = 1
for i... |
p02783 | s082655798 | Wrong Answer | h, a = map(int, input().split())
print((h+a-1)/a) |
p03469 | s457440850 | Accepted | S=str(input())
print('2018/'+S[5:10]) |
p03281 | s681047258 | Accepted | N = int(input())
def make_divisors(n: int):
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)
return divisors
ans = 0
for i in range(1, N+1, 2):
if len(make_divisors(i)) == 8:
... |
p03162 | s602249066 | Accepted | '''
Created on 2020/09/15
@author: harurun
'''
import sys
pin=sys.stdin.readline
N=int(pin())
dp=[[0]*3 for _ in [0]*N]
dp[0][0],dp[0][1],dp[0][2]=map(int,pin().split())
for i in range(1,N):
a,b,c=map(int,pin().split())
dp[i][0]=max(dp[i-1][1]+a,dp[i-1][2]+a)
dp[i][1]=max(dp[i-1][0]+b,dp[i-1][2]+b)
dp[i][2]=... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.