ZhenlongDai/ACPR huggingface dataset:
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = []
b = []
c = []

for _ in range(n):
    x, y, z = [int(e) for e in input().split()]
    a.append(x)
    b.append(y)
    c.append(z)

q, w, r = 0, 0, 0
for i in range(n):
    q, w, r = q + max(b[i], c[i]), w + max(a[i], c[i]), r + max(a[i], b[i])
ans = max(q, w, r)
print(ans)


Failing test case input:
3
0 56 0
-1 19 5
22 1 6

Expected output:
83


Actual output:
97


Fixed submission (verdict: Accepted):
n = int(input())
a = []
b = []
c = []

for _ in range(n):
    x, y, z = [int(e) for e in input().split()]
    a.append(x)
    b.append(y)
    c.append(z)

q, w, r = a[0], b[0], c[0]
for i in range(1, n):
    q, w, r = a[i] + max(w, r), b[i] + max(q, r), c[i] + max(q, w)
ans = max(q, w, r)
print(ans)

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]

dp = [[0] * 3] * N
for idx, val in enumerate(abc):
    a, b, c = val
    if idx == 0:
        dp[0] = val
    else:
        tmp = []
        tmp.append(max(dp[idx - 1][1] + a, dp[idx - 1][2] + a))
        tmp.append(max(dp[idx - 1][0] + b, dp[idx - 1][2] + b))
        tmp.append(max(dp[idx - 1][1] + c, dp[idx - 1][0] + c))
        dp[idx] = tmp
print(max(dp))


Failing test case input:
1
000 2 0

Expected output:
2


Actual output:
[0, 2, 0]


Fixed submission (verdict: Accepted):
N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]

dp = [[0] * 3] * N
for idx, val in enumerate(abc):
    a, b, c = val
    if idx == 0:
        dp[0] = val
    else:
        tmp = []
        tmp.append(max(dp[idx - 1][1] + a, dp[idx - 1][2] + a))
        tmp.append(max(dp[idx - 1][0] + b, dp[idx - 1][2] + b))
        tmp.append(max(dp[idx - 1][1] + c, dp[idx - 1][0] + c))
        dp[idx] = tmp
print(max(dp[-1]))

Problem: p03162
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
def main():
    N = int(input())
    dp = [0] * N
    ans = 0
    for i in range(N):
        a, b, c = map(int, input().split())
        d = {'a': a, 'b': b, 'c': c}
        for k, v in sorted(d.items(), key=lambda x: -x[1]):
            if i == 0:
                ans += v
                dp[i] = k
                break
            elif i != 0 and dp[i-1] != k:
                ans += v
                dp[i] = k
                break
    print(ans)


if __name__ == '__main__':
    main()


Failing test case input:
7
6 2 176
2 3 -3
0 0 -1
6 9 4
-1 7 2
-4 1 7
0 1 -8

Expected output:
199


Actual output:
191


Fixed submission (verdict: Accepted):
import enum


def main():
    N = int(input())
    dp = [[] for _ in range(N)]
    for i in range(N):
        abc = list(map(int, input().split()))
        if i == 0:
            dp[0] = abc
        else:
            for k, v in enumerate(abc):
                vals = []
                for j in range(3):
                    if k != j:
                        vals.append(dp[i-1][j])
                dp[i].append(v + max(vals))

    print(max(dp[-1]))


if __name__ == '__main__':
    main()
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = []
b = []
c = []

for _ in range(n):
    x, y, z = [int(e) for e in input().split()]
    a.append(x)
    b.append(y)
    c.append(z)

q, w, r = a[0], b[0], c[0]
for i in range(1, n):
    q, w, r = q + max(b[i], c[i]), w + max(a[i], c[i]), r + max(a[i], b[i])
ans = max(q, w, r)
print(ans)



Failing test case input:
7
3 2 16
1 8 0
4 4 12
15 8 6
4 5 1
2 3 7
1 1 -1

Expected output:
64


Actual output:
52


Fixed submission (verdict: Accepted):
n = int(input())
a = []
b = []
c = []

for _ in range(n):
    x, y, z = [int(e) for e in input().split()]
    a.append(x)
    b.append(y)
    c.append(z)

q, w, r = a[0], b[0], c[0]
for i in range(1, n):
    q, w, r = a[i] + max(w, r), b[i] + max(q, r), c[i] + max(q, w)
ans = max(q, w, r)
print(ans)

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n=int(input())
A=B=C=0
for i in range(n):
    a,b,c=map(int,input().split())
    A,B,C=a+max(B,C),max(C,A),max(A,B)
print(max(A,B,C))

Failing test case input:
7
9 1 66
-1 1 2
-1 2 0
2 4 1
0 12 1
0 1 22
2 1 -3

Expected output:
105


Actual output:
13


Fixed submission (verdict: Accepted):
n=int(input())
A=B=C=0
for i in range(n):
    a,b,c=map(int,input().split())
    A,B,C=a+max(B,C),b+max(C,A),c+max(A,B)
print(max(A,B,C))

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
abc_list = [list(map(int, input().split())) for i in range(n)]
dp = [0] * n
dp[0] = max(abc_list[0])
abc_max_index = abc_list[0].index(max(abc_list[0]))


for i in range(1, n):
    abc_list[i][abc_max_index] = -1
    abc_max = max(abc_list[i])
    abc_max_index = abc_list[i].index(abc_max)
    dp[i] = dp[i - 1] + abc_max

print(dp[n - 1])

Failing test case input:
7
5 7 14
7 8 3
2 5 2
7 8 6
4 6 8
2 3 8
7 7 0

Expected output:
54


Actual output:
50


Fixed submission (verdict: Accepted):
n = int(input())
abc_list = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n)]
dp[0] = [abc_list[0][0], abc_list[0][1], abc_list[0][2]]

for i in range(1, n):
    dp[i][0] = abc_list[i][0] + max(dp[i - 1][1], dp[i - 1][2])
    dp[i][1] = abc_list[i][1] + max(dp[i - 1][0], dp[i - 1][2])
    dp[i][2] = abc_list[i][2] + max(dp[i - 1][0], dp[i - 1][1])

print(max(dp[n - 1]))
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

matrix = []
for _ in range(N):
    matrix.append(list(map(int, input().split())))
    
dp_matrix = [[0, 0, 0]]

for i in range(N):
    dp_matrix_list = [0, 0, 0]
    for j in range(3):
        for k in range(3):
            if (j != k) and (dp_matrix_list[j] < dp_matrix[i][j] + matrix[i][k]):
                dp_matrix_list[j] = dp_matrix[i][j] + matrix[i][k]
    dp_matrix.append(dp_matrix_list)
    
print(max(dp_matrix[-1]))

Failing test case input:
7
3 6 16
22 8 0
4 4 6
15 14 6
4 8 1
3 3 7
2 1 -1

Expected output:
76


Actual output:
72


Fixed submission (verdict: Accepted):
N = int(input())

matrix = []
for _ in range(N):
    matrix.append(list(map(int, input().split())))
    
dp_matrix = [[0, 0, 0]]

for i in range(N):
    dp_matrix_list = [0, 0, 0]
    for j in range(3):
        for k in range(3):
            if (j != k) and (dp_matrix_list[j] < dp_matrix[i][k] + matrix[i][j]):
                dp_matrix_list[j] = dp_matrix[i][k] + matrix[i][j]
    dp_matrix.append(dp_matrix_list)
    
print(max(dp_matrix[-1]))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = [0] * n
for x in range(n):
    a[x] = list(map(int, input().split()))
print(a)
dp = [[0 for _ in range(3)] for _ in range(n+1)]
print(dp)
for i in range(n):
    for j in range(3):
        for k in range(3):
            if j == k:
                continue
            dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])
print(dp)
print(max(dp[n]))

Failing test case input:
3
-1 38 0
1 15 18
19 7 3

Expected output:
75


Actual output:
[[-1, 38, 0], [1, 15, 18], [19, 7, 3]]
[[0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 38, 0], [39, 15, 56], [75, 63, 42]]
75


Fixed submission (verdict: Accepted):
n = int(input())
a = [0] * n
for x in range(n):
    a[x] = list(map(int, input().split()))

dp = [[0 for _ in range(3)] for _ in range(n+1)]

for i in range(n):
    for j in range(3):
        for k in range(3):
            if j == k:
                continue
            dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])

print(max(dp[n]))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = int(input())
x = [[0,0,0] for i in range(l)]
x[0] = list(map(int,input().split()))

for i in range(1,l):
    z = list(map(int,input().split()))
    x[i][0] = max(z[0]+x[i-1][1],z[0]+x[i-1][2])
    x[i][1] = max(z[1]+x[i-1][0],z[1]+x[i-1][2])
    x[i][2] = max(z[2]+x[i-1][0],z[0]+x[i-1][1])

print(max(x[-1]))

Failing test case input:
7
5 1 176
0 2 0
-2 2 -1
2 8 2
-1 3 1
0 1 4
0 1 -5

Expected output:
189


Actual output:
188


Fixed submission (verdict: Accepted):
l = int(input())
x = [[0,0,0] for i in range(l)]
x[0] = list(map(int,input().split()))

for i in range(1,l):
    z = list(map(int,input().split()))
    x[i][0] = max(z[0]+x[i-1][1],z[0]+x[i-1][2])
    x[i][1] = max(z[1]+x[i-1][0],z[1]+x[i-1][2])
    x[i][2] = max(z[2]+x[i-1][0],z[2]+x[i-1][1])

print(max(x[-1]))
Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
A = [list(map(int, input().split())) for _ in range(n)]

def chmax(a, b):
    if a > b:
        return a
    else:
        return b

dp = [[ 0 for _ in range(3)]for _ in range(n+10)]

for i in range(3):
    dp[0][i] = A[0][i]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][j] = chmax(dp[i][k], dp[i-1][j]+A[i][k])

print(max(dp[n-1]))


Failing test case input:
7
3 6 16
22 8 0
4 4 6
15 14 6
4 8 1
3 3 7
2 1 -1

Expected output:
76


Actual output:
54


Fixed submission (verdict: Accepted):
n = int(input())
A = [list(map(int, input().split())) for _ in range(n)]

def chmax(a, b):
    if a > b:
        return a
    else:
        return b

dp = [[ 0 for _ in range(3)]for _ in range(n+10)]

for i in range(3):
    dp[0][i] = A[0][i]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][k] = chmax(dp[i][k], dp[i-1][j]+A[i][k])

print(max(dp[n-1]))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]

dp = [[0,0,0] for _ in range(n)]
dp[0][0], dp[0][1], dp[0][2] = l[0][0], l[0][1], l[0][2]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][k] = max(dp[i][k], dp[i-1][j] + l[i][k])
print(dp)

Failing test case input:
3
10 40 70
20 50 80
30 60 90

Expected output:
210

Actual output:
[[10, 40, 70], [90, 120, 120], [150, 180, 210]]


Fixed submission (verdict: Accepted):
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]

dp = [[0,0,0] for _ in range(n)]
dp[0][0], dp[0][1], dp[0][2] = l[0][0], l[0][1], l[0][2]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][k] = max(dp[i][k], dp[i-1][j] + l[i][k])

print(max(dp[-1]))

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
happiness = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n + 1)]

for i in range(n):
  dp[i + 1][0] = max(dp[i][1], dp[i][2]) + happiness[i][0]
  dp[i + 1][1] = max(dp[i][2], dp[i][0]) + happiness[i][1]
  dp[i + 1][2] = max(dp[i][1], dp[i][0]) + happiness[i][2]

print(dp)
print(max(dp[n]))


Failing test case input:
7
3 7 14
11 9 0
4 5 3
15 13 6
4 8 1
3 3 7
2 3 -1

Expected output:
63


Actual output:
[[0, 0, 0], [3, 7, 14], [25, 23, 7], [27, 30, 28], [45, 41, 36], [45, 53, 46], [56, 49, 60], [62, 63, 55]]
63


Fixed submission (verdict: Accepted):
n = int(input())
happiness = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n + 1)]

for i in range(n):
  dp[i + 1][0] = max(dp[i][1], dp[i][2]) + happiness[i][0]
  dp[i + 1][1] = max(dp[i][2], dp[i][0]) + happiness[i][1]
  dp[i + 1][2] = max(dp[i][1], dp[i][0]) + happiness[i][2]

print(max(dp[n]))
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, *t = map( int, open( 0 ).read().split() )


A, B, C = 0, 0, 0
for i in  range( n ):
  A, B, C = t[ 3 * i  ] + max( B, A ), t[ 3 * i + 1 ] + max( A, C ), t[ 3 * i + 2 ] + max( A, B )

print( max( A, B, C ) )


Failing test case input:
3
2 39 1
0 10 5
14 1 4

Expected output:
58


Actual output:
53


Fixed submission (verdict: Accepted):
n, *t = map( int, open( 0 ).read().split() )
 

A, B, C = 0, 0, 0
for i in  range( n ):
  A, B, C = t[ 3 * i  ] + max( B, C ), t[ 3 * i + 1 ] + max( A, C ), t[ 3 * i + 2 ] + max( A, B )
 
print( max( A, B, C ) )

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]

da, db, dc = 0, 0, 0

for a, b, c in abc:
    na = max(db, dc) + a
    nb = max(da, dc) + a
    nc = max(da, db) + a
    da = na
    db = nb
    dc = nc
    
print(max([na, nb, nc]))

Failing test case input:
3
-1 5 -4
-1 0 8
21 4 10

Expected output:
34


Actual output:
19


Fixed submission (verdict: Accepted):

N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]

da, db, dc = 0, 0, 0

for a, b, c in abc:
    na = max(db, dc) + a
    nb = max(da, dc) + b
    nc = max(da, db) + c
    da = na
    db = nb
    dc = nc
    
print(max([na, nb, nc]))

Problem: p03162
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n = int(input())

aa = 0
bb = 0
cc = 0 

for i in range(n):
    a,b,c = map(int,input().split())
    aa,bb,cc = max(bb + a, cc + a),max(aa + b, cc + b),max(aa + c, bb + c)

    print(aa,bb,cc)
print(max(aa,bb,cc))

Failing test case input:
3
-1 12 -4
-1 0 8
21 4 10

Expected output:
41


Actual output:
-1 12 -4
11 -1 20
41 24 21
41


Fixed submission (verdict: Accepted):
n = int(input())

aa = 0
bb = 0
cc = 0 

for i in range(n):
    a,b,c = map(int,input().split())
    aa,bb,cc = max(bb + a, cc + a),max(aa + b, cc + b),max(aa + c, bb + c)

print(max(aa,bb,cc))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
hd=[list(map(int,input().split())) for _ in range(n)]
A,B,C=0,0,0
for a,b,c in hd:
  A,B,C=A+max(b,c),B+max(a,c),C+max(a,b)
print(max(A,B,C))

Failing test case input:
3
-2 6 -4
0 4 3
21 2 10

Expected output:
30


Actual output:
31


Fixed submission (verdict: Accepted):
n=int(input())
A,B,C=0,0,0

for _ in range(n):
  a,b,c=map(int,input().split())
  A,B,C=a+max(B,C),b+max(A,C),c+max(A,B)

print(max(A,B,C))
Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def main():
    N = int(input())
    happiness = []
    for i in range(N):
        happiness.append([int(num) for num in input().split()])

    hap_total = [[0] * 3] * N
    hap_total[0] = [happiness[0][0], happiness[0][1], happiness[0][2]]


    for i in range(1, N):
        for j in range(3):
            for k in {0, 1, 2} - {j}:
                hap_total[i][j] = max(hap_total[i][j], hap_total[i-1][k] + happiness[i][j])


    print(max(hap_total[N-1]))


if __name__ == '__main__':
    main()

Failing test case input:
7
6 2 176
1 3 -2
0 0 0
3 9 3
-1 7 2
-4 1 7
0 1 -5

Expected output:
197


Actual output:
212


Fixed submission (verdict: Accepted):
def main():
    N = int(input())
    happiness = []
    for i in range(N):
        happiness.append([int(num) for num in input().split()])

    hap_total = [[0] * 3 for _ in range(N)]
    hap_total[0] = [happiness[0][0], happiness[0][1], happiness[0][2]]


    for i in range(1, N):
        for j in range(3):
            for k in {0, 1, 2} - {j}:
                hap_total[i][j] = max(hap_total[i][j], hap_total[i-1][k] + happiness[i][j])


    print(max(hap_total[N-1]))


if __name__ == '__main__':
    main()

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
values_list = []
for i in range(N):
    values = list(map(int, input().split()))
    values_list.append(values)


dp = [[0,0,0] for i in range(N+1)]

for i in range(N):
    for j in range(0, 3):
        for k in range(0, 3):
            if j == k:
                continue
            dp[i][k] = max(dp[i][k], dp[i-1][j] + values_list[i][k])

print(dp)
print(max(dp[N-1]))


Failing test case input:
3
2 39 1
0 10 5
14 1 4

Expected output:
58


Actual output:
[[2, 39, 1], [39, 12, 44], [58, 45, 43], [0, 0, 0]]
58


Fixed submission (verdict: Accepted):
N = int(input())
values_list = []
for i in range(N):
    values = list(map(int, input().split()))
    values_list.append(values)


dp = [[0,0,0] for i in range(N+1)]

for i in range(N):
    for j in range(0, 3):
        for k in range(0, 3):
            if j == k:
                continue
            dp[i][k] = max(dp[i][k], dp[i-1][j] + values_list[i][k])

print(max(dp[N-1]))
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

happinesses_each_day = []
for n in range(N):
    happinesses_each_day.append(list(map(int, input().split())))

def get_max_and_index(list):
    index, max = (-1, 0)
    for i, l in enumerate(list):
        if max < l:
            index = i
            max = l
    return index, max


dp = [0] * N
prev = -1

for i, happinesses in enumerate(happinesses_each_day):
    if prev is not -1:
        happinesses[prev] = -1
    prev, dp[i] = get_max_and_index(happinesses)

print(sum(dp))

Failing test case input:
7
3 1 61
1 8 0
0 2 -1
27 3 6
4 8 0
0 4 13
2 0 -2

Expected output:
118


Actual output:
119


Fixed submission (verdict: Accepted):
N = int(input())

happinesses_each_day = []
for n in range(N):
    happinesses_each_day.append(list(map(int, input().split())))

dp = [[0, 0, 0] for x in range(N+1)]

for i, happinesses in enumerate(happinesses_each_day):
    for j, happiness in enumerate(happinesses):
        for k in range(3):
            if j == k:
                continue
            if dp[i + 1][k] < (dp[i][j] + happiness):
                dp[i + 1][k] = (dp[i][j] + happiness)

print(max(dp[N]))

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
ABC = [list(map(int,input().split())) for _ in range(N)]
hap = [[0,0,0] for _ in range(N)]
hap[0] = ABC[0]
for j in range(1,N):
  for i1,i2,i3 in [[0,1,2],[1,2,0],[2,0,1]]:
    hap[j][i1] = max(hap[j-1][i2]+ABC[j][i2], hap[j-1][i3]+ABC[j][i3])
print(max(hap[-1][:]))

Failing test case input:
3
-1 38 0
1 15 18
31 14 3

Expected output:
87


Actual output:
84


Fixed submission (verdict: Accepted):
N = int(input())
ABC = [list(map(int,input().split())) for _ in range(N)]
hap = [[0,0,0] for _ in range(N)]
hap[0] = ABC[0]
for j in range(1,N):
  for i1,i2,i3 in [[0,1,2],[1,2,0],[2,0,1]]:
    hap[j][i2] = max(hap[j][i2], hap[j-1][i1]+ABC[j][i2])
    hap[j][i3] = max(hap[j][i3], hap[j-1][i1]+ABC[j][i3])
print(max(hap[-1][:]))

Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
inf = 10 ** 9 + 7

n = int(input())

happiness = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[inf]*3 for _ in range(n)]

dp[0][0] = happiness[0][0]
dp[0][1] = happiness[0][1]
dp[0][2] = happiness[0][2]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][j] = dp[i-1][k] + happiness[i][j]

print(max(dp[n-1]))


Failing test case input:
7
5 7 14
7 8 3
2 5 2
7 8 6
4 6 8
2 3 8
7 7 0

Expected output:
54


Actual output:
43


Fixed submission (verdict: Accepted):
n = int(input())

happiness = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[0]*3 for _ in range(n)]

dp[0][0] = happiness[0][0]
dp[0][1] = happiness[0][1]
dp[0][2] = happiness[0][2]

for i in range(1, n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][j] = max(dp[i][j], dp[i-1][k] + happiness[i][j])
print(max(dp[n-1]))
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
dp=[0,0,0]
for i in range(n):
    a=list(map(int,input().split()))
    for j in range(3):
        x=a[j]
        b=a.copy()
        a.remove(x)
        dp[j]+=max(a)
        a=b.copy()
print(max(dp))
    


Failing test case input:
7
3 2 16
1 8 0
4 4 12
15 8 6
4 5 1
2 3 7
1 1 -1

Expected output:
64


Actual output:
57


Fixed submission (verdict: Accepted):
n=int(input())
dp=[0,0,0]
for i in range(n):
    a=list(map(int,input().split()))
    dpn=[0,0,0]
    for j in range(3):
        
        for k in range(3):
            if(j!=k):
                dpn[k]=max(dpn[k],dp[j]+a[k])
        
    dp=dpn.copy()
    
print(max(dp))

Problem: p03162
Buggy submission (Python (3.8.2), verdict: Wrong Answer):



N = int(input())





a = []



dp = [[0]*3 for _ in range(N+1)]

for _ in range(N):
    aa = list(map(int, input().split()))
    a.append(aa)

for i in range(1, N+1):
    for j in range(3):
        t = 0
        for k in range(3):
            if j != k:
                tt = dp[i - 1][j] + a[i - 1][k]
                if t < tt:
                    dp[i][k] = dp[i-1][j] + a[i - 1][k]


print(max(dp[-1]))

Failing test case input:
7
6 7 8
8 8 3
2 5 2
7 8 6
4 6 8
2 3 4
7 5 1

Expected output:
46

Actual output:
38


Fixed submission (verdict: Accepted):



N = int(input())





a = []



dp = [[0]*3 for _ in range(N+1)]

for _ in range(N):
    aa = list(map(int, input().split()))
    a.append(aa)

for i in range(1, N+1):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i][k] = max(dp[i][k], dp[i-1][j]+a[i-1][k])

print(max(dp[-1]))

Problem: p03162
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

n = int(input())
x = [-1]*n
for i in range(n):
    x[i] = list(map(int, input().split()))

ans = [[0]*3 for i in range(n)]
ans[0] = x[0]

for k in range(1,n):
    for j in range(3):
        ans[k][j] = max(ans[k-1][(j+1)%3], ans[k-1][(j+2)%3]) + x[k][j]
    print(ans[i])

print(max(ans[n-1]))



Failing test case input:
7
3 1 90
0 1 0
-2 2 0
2 4 2
-1 12 1
0 1 22
2 1 -3

Expected output:
130


Actual output:
[0, 0, 0]
[0, 0, 0]
[0, 0, 0]
[0, 0, 0]
[0, 0, 0]
[130, 129, 103]
130


Fixed submission (verdict: Accepted):

n = int(input())
x = [-1]*n
for i in range(n):
    x[i] = list(map(int, input().split()))

ans = [[0]*3 for i in range(n)]
ans[0] = x[0]

for k in range(1,n):
    for j in range(3):
        ans[k][j] = max(ans[k-1][(j+1)%3], ans[k-1][(j+2)%3]) + x[k][j]

print(max(ans[n-1]))
Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = ([list(map(int, input().split())) for _ in range(n)])

dp = [[0,0,0] for _ in range(n)]

for i, a in enumerate(a):
  dp_1 = dp[i-1]
  dp[i][0] = max(dp_1[1], dp_1[2]) + a[0]
  dp[i][1] = max(dp_1[0], dp_1[2]) + a[1]
  dp[i][2] = max(dp_1[0], dp_1[1]) + a[2]

print(max(dp[n-1]))


Failing test case input:
1
011 3 1

Expected output:
11


Actual output:
15


Fixed submission (verdict: Accepted):
n = int(input())
a = ([list(map(int, input().split())) for _ in range(n)])
a.insert(0,[0,0,0])

dp = [[0,0,0] for _ in range(n+1)]

for i, a in enumerate(a):
  dp_1 = dp[i-1]
  dp[i][0] = max(dp_1[1], dp_1[2]) + a[0]
  dp[i][1] = max(dp_1[0], dp_1[2]) + a[1]
  dp[i][2] = max(dp_1[0], dp_1[1]) + a[2]

print(max(dp[n]))

Problem: p03162
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
x=int(input())
days=[]
for i in range(x):
    days.append(list(map(int,input().split())))
print(days)
dp=[0]*3
dp=days[0]
for cur in range(1,x):
    m=[0]*3
    for i in range(3):
        for j in range(3):
            if i!=j:
                m[i]=max(m[i],days[cur][i]+dp[j])
    dp=m
print(max(dp))
            

Failing test case input:
7
5 1 66
0 1 1
0 2 -2
5 4 1
0 12 0
0 1 12
2 1 -5

Expected output:
99


Actual output:
[[5, 1, 66], [0, 1, 1], [0, 2, -2], [5, 4, 1], [0, 12, 0], [0, 1, 12], [2, 1, -5]]
99


Fixed submission (verdict: Accepted):
x=int(input())
days=[]
for i in range(x):
    days.append(list(map(int,input().split())))

dp=[0]*3
dp=days[0]
for cur in range(1,x):
    m=[0]*3
    for i in range(3):
        for j in range(3):
            if i!=j:
                m[i]=max(m[i],days[cur][i]+dp[j])
    dp=m
print(max(dp))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())

ab = []
for _ in range(n):
    a, b, c = (int(x) for x in input().split())
    ab.append([a, b, c])

dp = [0]*n
memo = -1
memos = -1

for i in range(n):
    for j in range(3):
        if i == 0:
            dp[i] = max(ab[0])
            memos = j
        elif memo != j and dp[i] < dp[i-1]+ab[i][j]:
            dp[i] = dp[i-1]+ab[i][j]
            memos = j
    memo = memos
print(dp)

Failing test case input:
1
010 3 0

Expected output:
10


Actual output:
[10]


Fixed submission (verdict: Accepted):
n=int(input())

ab = []
for _ in range(n):
    a, b, c = (int(x) for x in input().split())
    ab.append([a, b, c])

dp = [[0 for i in range(3)] for j in range(n+1)]

for i in range(n):
    for j in range(3):
        for k in range(3):
            if j != k:
                dp[i+1][k] = max([dp[i+1][k], dp[i][j]+ab[i][k]])

print(max(dp[n]))
Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
abc=[list(map(int,input().split())) for i in range(n)]
happy=[[0,0,0] for i in range(n)]
happy[0]=abc[0]
print(happy)
for i in range(n-1):
    for j in range(3):
        for k in range(3):
            if j==k:
                continue
            happy[i+1][k]=max(happy[i+1][k],happy[i][j]+abc[i+1][k])
    
print(max(happy[-1]))

Failing test case input:
3
-2 20 0
0 10 6
14 -1 1

Expected output:
40


Actual output:
[[-2, 20, 0], [0, 0, 0], [0, 0, 0]]
40


Fixed submission (verdict: Accepted):
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
abc=[list(map(int,input().split())) for i in range(n)]
happy=[[0,0,0] for i in range(n)]
happy[0]=abc[0]

for i in range(n-1):
    for j in range(3):
        for k in range(3):
            if j==k:
                continue
            happy[i+1][k]=max(happy[i+1][k],happy[i][j]+abc[i+1][k])
    
print(max(happy[-1]))

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]


score = [[0] * N for i in range(3)] 
for i in range(N):
    for dst in range(3):
        tmp = abc[i][dst]
        for src in range(3):
            if dst == src: continue
            elif score[src][i - 1] + tmp > score[dst][i]:
                score[dst][i] = score[src][i - 1] + tmp


print(max((score[0][-1], score[1][-1], score[2][-1])))

Failing test case input:
1
100 16 1

Expected output:
100


Actual output:
117


Fixed submission (verdict: Accepted):

N = int(input())
abc = [list(map(int, input().split())) for i in range(N)]


score = [[0] * N for i in range(3)] 
for i in range(N):
    for dst in range(3):
        tmp = abc[i][dst]
        for src in range(3):
            if dst == src: continue
            elif score[src][i - 1] + tmp > score[dst][i]:
                score[dst][i] = score[src][i - 1] + tmp


if N == 1: print(max(abc[-1]))
else: print(max((score[0][-1], score[1][-1], score[2][-1])))
Problem: p03162
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def main():
    N = int(input())
    dp = [[0] * 3 for _ in range(N+1)]
    for i in range(1, N+1):
        
        happiness = [int(i) for i in input().split()]
        
        for j in range(3):
            
            for k in range(3):
                
                if j == k:
                    continue
                
                dp[i][k] = max(dp[i][k], dp[i-1][j] + happiness[k])
    ans = dp[-1]
    print(ans)

if __name__ == "__main__":
    main()


Failing test case input:
3
0 61 -1
0 9 10
11 5 1

Expected output:
82


Actual output:
[82, 76, 62]


Fixed submission (verdict: Accepted):
def main():
    N = int(input())
    dp = [[0] * 3 for _ in range(N+1)]
    for i in range(1, N+1):
        
        happiness = [int(i) for i in input().split()]
        
        for j in range(3):
            
            for k in range(3):
                
                if j == k:
                    continue
                
                dp[i][k] = max(dp[i][k], dp[i-1][j] + happiness[k])
    ans = max(dp[-1])
    print(ans)

if __name__ == "__main__":
    main()

Problem: p03162
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
dp = [[0] * 3 for _ in range(N+1)]
A = [list(map(int,input().split())) for _ in range(N)]

for i in range(N):
    for j in range(3):
        for k in range(3):
            if j == k:
                continue
            dp[i+1][k] = max(dp[i+1][k], dp[i][j] + A[i][k])
            print(dp)
print(max(dp[N]))


Failing test case input:
3
-1 6 -4
-1 0 8
21 4 10

Expected output:
35


Actual output:
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 0], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [0, 0, 8], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 8], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [0, 0, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [0, 9, 0]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [0, 9, 15]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [21, 9, 15]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [21, 9, 15]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [35, 9, 15]]
[[0, 0, 0], [0, 6, 0], [5, 0, 14], [35, 18, 15]]
35


Fixed submission (verdict: Accepted):
N = int(input())
dp = [[0] * 3 for _ in range(N+1)]
A = [list(map(int,input().split())) for _ in range(N)]

for i in range(N):
    for j in range(3):
        for k in range(3):
            if j == k:
                continue
            dp[i+1][k] = max(dp[i+1][k], dp[i][j] + A[i][k])
print(max(dp[N]))
Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=input().split();print("YNeos"[n>m::2])

Failing test case input:
-2 -86

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n,m=map(int,input().split());print("YNeos"[n>m::2])

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=map(int,input().split())
if n==m:
  print('AC')
else:
  print('WA')

Failing test case input:
-2 -102

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())
if n==m:
  print('Yes')
else:
  print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = [ int(v) for v in input().split() ]
ans = "WA"
if n == m:
    ans = "AC"
print(ans)

Failing test case input:
0 -15

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = [ int(v) for v in input().split() ]
ans = "No"
if n == m:
    ans = "Yes"
print(ans)

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = input().split()

if n == m:
  print("yes")
else:
  print("no")

Failing test case input:
0 -15

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n,m = input().split()
 
if n == m:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int, input().split())
if n == m:
    print('Yes')
else:
    print('NO')


Failing test case input:
0 -50

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())
if n <= m:
    print('Yes')
else:
    print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = map(int, input().split())
if (n==m):
    print("AC")
else:
    print("WA")

Failing test case input:
0 -92

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n,m = map(int, input().split())
if (n==m):
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M=map(int, input().split())
if N==M:
  print('YES')
else:
  print('NO')


Failing test case input:
-2 -102

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N, M=map(int, input().split())
if N==M:
  print('Yes')
else:
  print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
	n,m = map(int, input().split())
	if n==m:
		print('Yes')
	else:
		print('no')
main()

Failing test case input:
-4 -86

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
def main():
	n,m = map(int, input().split())
	if n==m:
		print('Yes')
	else:
		print('No')
main()

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
num = list(input().split())

if num[0] == num[1]:
    print('yes')
else :
    print('no')

Failing test case input:
0 -64

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
num = list(input().split())

if num[0] == num[1]:
    print('Yes')
else :
    print('No')
Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int, input().split())
if n==m:
  print("AC")
else:
  print("WA")

Failing test case input:
-8 -21

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())
if n==m:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b = map(int,input().split())
if a==b:
  print('yes')
else: print('no')

Failing test case input:
0 -15

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
a,b = map(int,input().split())
if a==b:
  print('Yes')
else: print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
if __name__=='__main__':
  NM=input().split()
  N,M=int(NM[0]),int(NM[1])
  print('YES' if N<=M else 'NO')

Failing test case input:
0 -64

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
if __name__=='__main__':
  NM=input().split()
  N,M=int(NM[0]),int(NM[1])
  print('Yes' if N<=M else 'No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = [int(i) for i in input().split()]
if n == m:
    print("AC")
else:
    print("WA")

Failing test case input:
-8 -10

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n,m = [int(i) for i in input().split()]
if n == m:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = [int(v) for v in input().split()]
print("AC" if n == m else "WA")

Failing test case input:
-8 -13

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = [int(v) for v in input().split()]
print("Yes" if n == m else "No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = map(int, input().split())
if n >= m:
    print('Yes')
else:
    print('No')

Failing test case input:
1 -63

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n,m = map(int, input().split())
if n == m:
    print('Yes')
else:
    print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M=list(map(int,input().split()))
a=(N==M)
print("WAC"[a:a+2])

Failing test case input:
0 -46

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
N,M=list(map(int,input().split()))
print(["No","Yes"][N==M])

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=map(int,input().split())
if m>=n:
    print("YES")
else:
    print("NO")
    

Failing test case input:
0 -63

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())
if m>=n:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=map(int,input().split())

if n == m:
  print("Yes")
else:
  print("NO")
  
  

Failing test case input:
0 -76

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())

if n > m:
  print("No")

else:
  print("Yes")
Problem: p02789
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
if len(set((list(input().split()))))==1:
    print("Yes")
else:("No")

Failing test case input:
-8 -10

Expected output:
No


Actual output:

Fixed submission (verdict: Accepted):
if len(set((list(input().split()))))==1:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, m = [int for x in input().split()]

if n==m :
    print('Yes')
else:
    print('No')

Failing test case input:
0 -76

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n, m = [int(x) for x in input().split()]

if n==m :
    print('Yes')
else:
    print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = map(int, input().split())
 
if N == M:
  print('YES')
else:
  print('NO')

Failing test case input:
-1 -56

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N, M = input().split()
 
if N==M:
  print('Yes')
else:
  print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M = map(int,input().split())
if N == M :
    print ('yes')
else :
    print ('no')


Failing test case input:
-8 -19

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
N,M = map(int,input().split())
if N == M :
    print ('Yes')
else :
    print ('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = input().split()
if a > b:
  print("No")
else:
  print("Yes")

Failing test case input:
-4 -86

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a, b = input().split()
if a == b:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b = map(int,input().split())
print(a,b)
if a == b:
  print("Yes")
else:
  print("No")

Failing test case input:
0 -92

Expected output:
No


Actual output:
0 -92
No


Fixed submission (verdict: Accepted):
a,b = map(int,input().split())

if a == b:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
hoge = input()
tmp = hoge.split()

if tmp[0] == tmp[1]:
    print("YES")
else:
    print("NO")


Failing test case input:
0 -36

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
hoge = input()
tmp = hoge.split()

if tmp[0] == tmp[1]:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input().rstrip().split(' ')
case = int(s[0])
ans = int(s[1])
if case == ans:
    print("Yes")
else:
    print("NO")


Failing test case input:
-1 -102

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
s = input().rstrip().split(' ')
case = int(s[0])
ans = int(s[1])
if case == ans:
    print("Yes")
else:
    print("No")
Problem: p02789
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b=map(int,input().split())
if a<b:
    print('No')
else:
    print('Yes')

Failing test case input:
0 -63

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
if a==b:
    print('Yes')
else:
    print('No')

Problem: p02789
Buggy submission (Python (3.8.2), verdict: Wrong Answer):




def solve(n, m):
    if n == m: print("YES")
    else: print("NO")

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)


Failing test case input:
-1 -86

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):




def solve(n, m):
    if n == m: print("Yes")
    else: print("No")

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)

Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N,M = map(int, input().strip().split(' '))
print('Yes' if M <= N else 'No')

Failing test case input:
0 -15

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N,M = map(int, input().strip().split(' '))
print('Yes' if M >= N else 'No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M = (int(x) for x in input().split())
print(N)
print(M)

if N == M:
  print("yes")
else:
  print("no")

Failing test case input:
-1 -64

Expected output:
No


Actual output:
-1
-64
no


Fixed submission (verdict: Accepted):
N,M = (int(x) for x in input().split())
if N == M:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n, m = map(int, input().split())

if n == m:
    print('AC')

elif n > m:
    print('WA')


Failing test case input:
1 -63

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())

if n == m:
    print('Yes')

elif n > m:
    print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = map(int, input().split())

if N == M:
  print("AC")
else:
  print("WA")

Failing test case input:
0 -36

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
N, M = map(int, input().split())

if N == M:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M =map(int,input().split())
print(N)
print(M)
if N == M:
  print("Yes")
else:
  print("No")

Failing test case input:
0 -63

Expected output:
No


Actual output:
0
-63
No


Fixed submission (verdict: Accepted):
N,M =map(int,input().split())
if N == M:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
m,n=map(int,input().split())
if m==n:
  print('YES')
else:
  print('NO')

Failing test case input:
-2 -86

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
m,n=map(int,input().split())
if m==n:
  print('Yes')
else:
  print('No')
Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n,m = map(int,input().split())
print(n,m)
if n == m :
    print("yes")
else :
    print("no")


Failing test case input:
-8 -10

Expected output:
No


Actual output:
-8 -10
no


Fixed submission (verdict: Accepted):
n,m = map(int,input().split())

if n == m :
    print("Yes")
else :
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = input().split()

if N==M :
  print('YES')
else:
  print('NO')
        

Failing test case input:
-8 -13

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N, M = input().split()
 
if N==M:
  print('Yes')
else:
  print('No')

Problem: p02789
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n,m=map(int,input().split())
print("AC" if n==m else "WA")

Failing test case input:
0 -63

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())
print("Yes" if n==m else "No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=map(int,input().split())
if(n<m):
    print("No")
else:
    print("Yes")

Failing test case input:
0 -76

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())
if(n>m):
    print("No")
else:
    print("Yes")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = list(map(int, input().split()))

if n == m:
  print('AC')
else:
  print('WA')


Failing test case input:
-4 -86

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = list(map(int, input().split()))

if n == m:
  print('Yes')
else:
  print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = input().split(" ")
N = int(N)
M = int(N)

if N == M:
  print("Yes")
else:
  print("No")

Failing test case input:
-1 -86

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N, M = input().split(" ")
N = int(N)
M = int(M)

if N == M:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = map(int,input().split())

print('AC') if n==m else print('WA')


Failing test case input:
0 -15

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())

print('Yes') if n == m else print('No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
if a==b:
  print("YES")
else:
  print("NO")

Failing test case input:
0 -36

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
if a==b:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = map(int,input().split())
if N == N:
  print('Yes')
else:
  print('No')

Failing test case input:
-1 -102

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N, M = map(int, input().split())
print("Yes") if N == M else print("No")
Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = list(map(int,input().split()))
if N[0] == N[1]:
  print('YES')
else:
  print('NO')

Failing test case input:
0 -27

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N, M = map(int, input().split())
if N == M:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = [int(x) for x in input().split()]
print('AC' if n == m else 'WA')

Failing test case input:
-1 -86

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = [int(x) for x in input().split()]
print('Yes' if n == m else 'No')

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m = input().split()
 
if n == m:
  print("yes")
else:
  print("no")

Failing test case input:
0 -64

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n,m = input().split()
 
if n == m:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = list(map(int, input().split()))
if n==m:
    print("yes")
else:
    print("no")

Failing test case input:
0 -27

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n, m = list(map(int, input().split()))
if n==m:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = map(int, input().split())
if(a==b):
  print("YES")
else:
  print("NO")

Failing test case input:
-8 -13

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
a, b = map(int, input().split())
if(a==b):
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("no")

Failing test case input:
-1 -64

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b = [int(i) for i in input().split()]
if a == b:
  print("AC")
else:
  print("WA")

Failing test case input:
-8 -13

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
a, b = [int(i) for i in input().split()]
if a == b:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int, input().split())
if n == m:
  print("AC")
else:
  print("WA")

Failing test case input:
0 -92

Expected output:
No


Actual output:
WA


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())
if n == m:
  print("Yes")
else:
  print("No")

Problem: p02789
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, M = map(int, input().split())

if N == M:
    print('YES')
else:
    print('NO')


Failing test case input:
-8 -21

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')