ZhenlongDai/ACPR huggingface dataset:
Problem: p02326
Buggy submission (Python3, verdict: Wrong Answer):
H, W = map(int, input().split())
c = []
for i in range(H):
    c.append([int(i) for i in input().split()])
dp = [[0 for i in range(W)] for i in range(H)]
dp[0][0] = 1 if c[0][0] == 0 else 0
for j in range(W):
    if c[0][0] == 1:
        dp[0][j] = 0
    else:
        dp[0][j] = 1

for j in range(H):
    if c[0][0] == 1:
        dp[j][0] = 0
    else:
        dp[j][0] = 1

maxwidth = 0
for i in range(1, H):
    for j in range(1, W):
        if c[i][j] == 1:
            dp[i][j] = 0
        else:
            dp[i][j] = min(dp[i-1][j], dp[i-1][j-1], dp[i][j-1]) + 1
            maxwidth = max(maxwidth,dp[i][j])

print(maxwidth**2)


Failing test case input:
3 5
0 1 1 0 1
0 0 0 -1 1
1 0 0 0 1
0 -1 0 0 -1

Expected output:
4


Actual output:
9


Fixed submission (verdict: Accepted):
H, W = map(int, input().split())
c = []
for i in range(H):
    c.append([int(i) for i in input().split()])
dp = [[0 for i in range(W)] for i in range(H)]
maxwidth = 0
for i in range(H):
    for j in range(W):
        dp[i][j] = (c[i][j] + 1) % 2
        maxwidth |= dp[i][j]

for i in range(1, H):
    for j in range(1, W):
        if c[i][j]:
            dp[i][j] = 0
        else:
            dp[i][j] = min(dp[i-1][j], dp[i-1][j-1], dp[i][j-1]) + 1
            maxwidth = max(maxwidth,dp[i][j])

print(maxwidth**2)

Problem: p02326
Buggy submission (Python3, verdict: Wrong Answer):
H,W = map(int,input().split())
tile = [[0 for i in range(W)] for i in range(H)]
buf = [[0 for i in range(W+1)] for i in range(H+1)]
maxsquare = 0

for i in range(H):
    tile[i] = list(map(int,input().split()))

for i in range(1,H+1):
    for j in range(1,W+1):
        if tile[i-1][j-1]!=1:
            if tile[i-2][j-1]==1 or tile[i-1][j-2]==1 or tile[i-2][j-2]==1:
                buf[i][j] = 1
            elif tile[i-2][j-1]==tile[i-1][j-2]:
                buf[i][j] = buf[i-1][j-1]+1
            else:
                buf[i][j] = min(buf[i-1][j] , buf[i][j-1])+1

            if buf[i][j] > maxsquare:
                maxsquare = buf[i][j]


print(maxsquare**2)

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

Expected output:
4


Actual output:
9


Fixed submission (verdict: Accepted):
H,W = map(int,input().split())
tile = [[0 for i in range(W)] for i in range(H)]
buf = [[0 for i in range(W+1)] for i in range(H+1)]
maxsquare = 0

for i in range(H):
    tile[i] = list(map(int,input().split()))

for i in range(1,H+1):
    for j in range(1,W+1):
        if tile[i-1][j-1]!=1:
            buf[i][j] = min(buf[i-1][j],buf[i][j-1],buf[i-1][j-1]) + 1

            if buf[i][j] > maxsquare:
                maxsquare = buf[i][j]

print(maxsquare**2)
Problem: p02326
Buggy submission (Python3, verdict: Wrong Answer):
def solve():
    H, W = map(int, input().split())
    c = []
    for _ in range(H):
        c.append(list(map(int, input().split())))

    dp = [[0] * W for _ in range(H)]

    for x in range(H):
        dp[x][0] = 1 if c[x][0] == 0 else 0
    for y in range(W):
        dp[0][y] = 1 if c[0][y] == 0 else 0

    for x in range(H-1):
        for y in range(W-1):
            if c[x+1][y+1] == 1:
                dp[x+1][y+1] = 0
            elif c[x][y+1] == 0 and c[x+1][y] == 0:
                dp[x+1][y+1] = dp[x][y] + 1
            else:
                dp[x+1][y+1] = 1

    print(max([max(item) for item in dp])**2)


if __name__ == '__main__':
    solve()

Failing test case input:
3 5
0 0 1 0 0
0 0 0 -1 1
0 0 0 0 1
0 -1 0 0 0

Expected output:
4


Actual output:
9


Fixed submission (verdict: Accepted):
def solve():
    H, W = map(int, input().split())
    c = []
    for _ in range(H):
        c.append(list(map(int, input().split())))

    dp = [[0] * W for _ in range(H)]

    for x in range(H):
        dp[x][0] = 1 if c[x][0] == 0 else 0
    for y in range(W):
        dp[0][y] = 1 if c[0][y] == 0 else 0

    for x in range(H-1):
        for y in range(W-1):
            if c[x+1][y+1] == 0:
                dp[x+1][y+1] = min([dp[x][y], dp[x][y+1], dp[x+1][y]]) + 1

    print(max([max(item) for item in dp])**2)


if __name__ == '__main__':
    solve()

Problem: p02326
Buggy submission (Python3, verdict: Wrong Answer):




import sys


def solve():
    dp = [[0] * W for _ in range(H)]
    max_width = 0

    
    
    
    
    

    for i in range(1, H):
        for j in range(1, W):
            if not int(carpet_info[i][j]):
                dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
                max_width = max(max_width, dp[i][j])

    return pow(max_width, 2)


if __name__ == '__main__':
    _input = sys.stdin.readlines()
    H, W = map(int, _input[0].split())
    carpet_info = list(map(lambda x: x.split(), _input[1:]))
    print(solve())

Failing test case input:
1 1
0 0 -1 -1 1
1 0 0 0 1
0 -2 0 1 -1
0 -1 0 2 0

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):




import sys


def solve():
    dp = [[0] * W for _ in range(H)]
    max_width = 0
    for m in range(H):
        for n in range(W):
            dp[m][n] = (int(carpet_info[m][n]) + 1) % 2
            max_width |= dp[m][n]

    for i in range(1, H):
        for j in range(1, W):
            if not int(carpet_info[i][j]):
                dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
                max_width = max(max_width, dp[i][j])
                
    return pow(max_width, 2)


if __name__ == '__main__':
    _input = sys.stdin.readlines()
    H, W = map(int, _input[0].split())
    carpet_info = list(map(lambda x: x.split(), _input[1:]))
    print(solve())
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

A, P = map(int, input().split())
print((A*3+P)/2)


Failing test case input:
845 0

Expected output:
1267


Actual output:
1267.5


Fixed submission (verdict: Accepted):

import math
A, P = map(int, input().split())
print(math.floor((A*3+P)/2))

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



input_code = input()
A = int(input_code.split()[0])
P = int(input_code.split()[1])

X = A*3 + P
N = 0

if A>3:
    N = A

else:
    N = 0
    
print(N)

Failing test case input:
845 4

Expected output:
1269


Actual output:
845


Fixed submission (verdict: Accepted):



input_code = input()
A = int(input_code.split()[0])
P = int(input_code.split()[1])

X = A*3 + P

print(X

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,p = map(int, input().split())
print(((3*a+p)-(3*a+p)%2)/2)


Failing test case input:
-25 -2

Expected output:
-39


Actual output:
-39.0


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
print(int(((3*a+p)-(3*a+p)%2)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P = map(int, input().split())
A = round((A * 3 + P) / 2)
print(A)

Failing test case input:
34 21

Expected output:
61


Actual output:
62


Fixed submission (verdict: Accepted):
A,P = map(int, input().split())
A = round((A * 3 + P) 
print(A)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P=map(int, input().split())
if (3*A+P)/2==0: print((3*A+P)/2)
else: print(int((3*A+P-1)/2))

Failing test case input:
493 3

Expected output:
741


Actual output:
740


Fixed submission (verdict: Accepted):
A,P=map(int, input().split())
if (3*A+P)%2==0: print(int((3*A+P)/2))
else: print(int((3*A+P-1)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

a, p = map(int, input().split())
p = p + math.floor(a / 3)
print(math.floor(p / 2))

Failing test case input:
53 21

Expected output:
90


Actual output:
19


Fixed submission (verdict: Accepted):
import math

a, p = map(int, input().split())
p = p + math.floor(a * 3)
print(math.floor(p / 2))

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,p = map(int, input().split())
print(int((3*a+p)-(3*a+p)%2)/2)

Failing test case input:
13 14

Expected output:
26


Actual output:
26.0


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
print(int(((3*a+p)-(3*a+p)%2)/2))

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b=map(int,input().split())
c=(3*a+b)/2
import math
math.floor(c)

Failing test case input:
416 1

Expected output:
624


Actual output:

Fixed submission (verdict: Accepted):
a,b=map(int,input().split())
c=(3*a+b)/2
import math
print(math.floor(c))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P= map(int, input().split())

B=P

print(A+B)

Failing test case input:
-17 1

Expected output:
-25


Actual output:
-16


Fixed submission (verdict: Accepted):
A,P= map(int, input().split())

B=A*3


D=B+P
print(D
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P = (int(i) for i in input().split()) 

print((3*A + P)%2)

Failing test case input:
53 21

Expected output:
90


Actual output:
0


Fixed submission (verdict: Accepted):
A, P = (int(i) for i in input().split()) 

print((3*A + P)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = map(int,input().split())

print(((3 * A + P)-((3 * A + P) % 2)) / 2)

Failing test case input:
-22 0

Expected output:
-33


Actual output:
-33.0


Fixed submission (verdict: Accepted):
A, P = map(int,input().split())

print(int(((3 * A + P)-((3 * A + P) % 2)) / 2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = list(map(int, input().split())) 
Apple = 3 * i[0] + i[1]
Apple

Failing test case input:
416 1

Expected output:
624


Actual output:

Fixed submission (verdict: Accepted):
i = list(map(int, input().split())) 
Apple = 3 * i[0] + i[1]
print(Apple

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = map(int, input().split())
if (3*A + P) % 2== 0:
    print((3*A + P) /2)
else:
    print((3*A + P-1)/2)

Failing test case input:
-30 0

Expected output:
-45


Actual output:
-45.0


Fixed submission (verdict: Accepted):
A, P = map(int, input().split())
if (3*A + P) % 2== 0:
    print(int((3*A + P) /2))
else:
    print(int((3*A + P-1)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, p = map(int, input().split())
total_fraction = p + a * 3
print(int((total_fraction + 2 - 1) / 2))


Failing test case input:
-15 -2

Expected output:
-24


Actual output:
-23


Fixed submission (verdict: Accepted):
a, p = map(int, input().split())
total_fraction = p + a * 3
print(total_fraction

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P = map(int,input().split())
clc = A*3 + P
print(round(clc/2))

Failing test case input:
-24 -1

Expected output:
-37


Actual output:
-36


Fixed submission (verdict: Accepted):
A,P = map(int,input().split())
clc = A*3 + P
print(clc

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
ap=(a*3+p)
if ap%2==0:
    print(ap/2)
else:
    print((ap-1)/2)

Failing test case input:
-18 0

Expected output:
-27


Actual output:
-27.0


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
ap=(a*3+p)
if ap%2==0:
    print(int(ap/2))
else:
    print(int((ap-1)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=(int(x) for x in input().split())
s=(a*3)+p
print(round(s/2))


Failing test case input:
-24 -1

Expected output:
-37


Actual output:
-36


Fixed submission (verdict: Accepted):
import math
a,p=(int(x) for x in input().split())
s=(a*3)+p
print(math.floor(s/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = map(int, input().split())
print((A*3+P)/2)

Failing test case input:
-25 -2

Expected output:
-39


Actual output:
-38.5


Fixed submission (verdict: Accepted):
A, P = map(int, input().split())
print((A*3+P)
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int, input().split())
print((a*3+p)/2)


Failing test case input:
-5 -1

Expected output:
-8


Actual output:
-8.0


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
print((a*3+p)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = map(int,input().split())

P += A * 3

print(round(P / 2))


Failing test case input:
845 0

Expected output:
1267


Actual output:
1268


Fixed submission (verdict: Accepted):
import math

A, P = map(int,input().split())

P += A * 3

print(math.floor(P / 2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b=map(int,input().split()) 
print((a*3+b)/2)

Failing test case input:
-12 0

Expected output:
-18


Actual output:
-18.0


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

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



v = list(map(int, input().split()))
a, p = v[0], v[1]

apples = a*3+p
print(round(apples/2))

Failing test case input:
-15 0

Expected output:
-23


Actual output:
-22


Fixed submission (verdict: Accepted):



v = list(map(int, input().split()))
a, p = v[0], v[1]

apples = a*3+p
print(apples

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int,input().split())
c = a*3+p
print(c % 2)

Failing test case input:
-10 2

Expected output:
-14


Actual output:
0


Fixed submission (verdict: Accepted):
a,p = map(int,input().split())
c = a*3+p
print(c

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int, input().split())
print((a*3 + p)%2)


Failing test case input:
845 0

Expected output:
1267


Actual output:
1


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
print((a*3 + p)

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a, p = map(int, input().split())

print(round((3 * a + p) / 2))

Failing test case input:
-25 -2

Expected output:
-39


Actual output:
-38


Fixed submission (verdict: Accepted):
import math

a, p = map(int, input().split())

print(math.floor((3 * a + p) / 2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math


def main(x,y):
    P = 3*x+y
    num = math.ceil(P/2)
    print(num)


    
x, y = map(int,input().split())
main(x,y)


Failing test case input:
845 4

Expected output:
1269


Actual output:
1270


Fixed submission (verdict: Accepted):
import math


def main(x,y):
    P = 3*x+y
    num = math.floor(P/2)
    print(num)


    
x, y = map(int,input().split())
main(x,y)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
a,p=map(int,input().split())
f=a*3
print(math.floor(f/2))

Failing test case input:
-18 -1

Expected output:
-28


Actual output:
-27


Fixed submission (verdict: Accepted):
import math
a,p=map(int,input().split())
f=a*3
print(math.floor((f+p)/2))
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
b=3*a+p
if b%2==0:
  print(b/2)
else:
  print((b-1)/2)


Failing test case input:
-24 -1

Expected output:
-37


Actual output:
-37.0


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
b=3*a+p
if b%2==0:
  print(b
else:
  print((b-1)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
apple_one, apple_kakera = (int(i) for i in input().split())  
apple_kakera += apple_one * 3
print(math.floor(apple_one / 2) )

Failing test case input:
95 5

Expected output:
145


Actual output:
47


Fixed submission (verdict: Accepted):
import math
apple_one, apple_kakera = (int(i) for i in input().split())  
apple_kakera += apple_one * 3
print(math.floor(apple_kakera / 2) )

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

A, P =map(int,input().split())
print(A , P)

x = 3*A + P

print(math.floor(x/2))

Failing test case input:
-47 0

Expected output:
-71


Actual output:
-47 0
-71


Fixed submission (verdict: Accepted):
import math

A, P =map(int,input().split())


x = 3*A + P

print(math.floor(x/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = [int(i) for i in input().split()]

N = A + P

print(N)

Failing test case input:
-14 0

Expected output:
-21


Actual output:
-14


Fixed submission (verdict: Accepted):
A, P = [int(i) for i in input().split()]

print((3 * A + P)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P = map(int,input().split())
print((A*3+P)/2)

Failing test case input:
198 5

Expected output:
299


Actual output:
299.5


Fixed submission (verdict: Accepted):
A,P = map(int,input().split())
print((A*3+P)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int,input().split())
print(((a*3)+p)%2)

Failing test case input:
493 1

Expected output:
740


Actual output:
0


Fixed submission (verdict: Accepted):
a,p = map(int,input().split())
c = a*3+p
print(c

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


A,P=map(int, input().split())

print(round((A*3+P)/2))

Failing test case input:
-11 0

Expected output:
-17


Actual output:
-16


Fixed submission (verdict: Accepted):


A,P=map(int, input().split())

print((A*3+P)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
a,p=map(int,input().split())
p=p+a*3
print(math.floor(p/3))

Failing test case input:
-13 1

Expected output:
-19


Actual output:
-13


Fixed submission (verdict: Accepted):
import math
a,p=map(int,input().split())
p=p+a*3
print(int(math.floor(p/2)))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
A, P = map(int, input().split())

print(math.ceil((P+3*A)/2))

Failing test case input:
58 3

Expected output:
88


Actual output:
89


Fixed submission (verdict: Accepted):
import math
A, P = map(int, input().split())

print(math.floor((P+3*A)/2))
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P = map(int, input().split())
sum_apple = A*3+P
print(sum_apple/2)

Failing test case input:
845 4

Expected output:
1269


Actual output:
1269.5


Fixed submission (verdict: Accepted):
A,P = map(int, input().split())
sum_apple = A*3+P
print(sum_apple

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int, input().split())
parts = ((a*3)+p)
print(parts/2)

Failing test case input:
65 3

Expected output:
99


Actual output:
99.0


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
parts = ((a*3)+p)
print(parts

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,p=map(int,input().split())

print((a*3+p)/2)

Failing test case input:
167 5

Expected output:
253


Actual output:
253.0


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

print((a*3+p)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
a,p=map(int,input().split())
p=p+a*3
print(int(math.floor(p/3)))

Failing test case input:
-15 -2

Expected output:
-24


Actual output:
-16


Fixed submission (verdict: Accepted):
import math
a,p=map(int,input().split())
p=p+a*3
print(int(math.floor(p/2)))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A , P = map(int , input() . split())

print(round( (3 * A + P)/ 2 ))

Failing test case input:
582 1

Expected output:
873


Actual output:
874


Fixed submission (verdict: Accepted):
A , P = map(int , input() . split())

print(round( (3 * A + P)

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a, b = list(map(int, input().split()))
n = a * 3 + b
c = n % 2
my_result = (n - c) / 2
print(my_result)

Failing test case input:
58 3

Expected output:
88


Actual output:
88.0


Fixed submission (verdict: Accepted):
a, b = list(map(int, input().split()))
n = a * 3 + b
c = n % 2
my_result = (n - c) / 2
print(int(my_result))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=(int(x) for x in input().split())
s=a*3+p
print(round(s/2))


Failing test case input:
466 1

Expected output:
699


Actual output:
700


Fixed submission (verdict: Accepted):
import math
a,p=(int(x) for x in input().split())
s=(a*3)+p
print(math.floor(s/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int,input().split())
z = a*3+p
if z % 2 == 0:
  print(z/2)
else:
  print((z-1)/2)


Failing test case input:
-11 0

Expected output:
-17


Actual output:
-17.0


Fixed submission (verdict: Accepted):
a,p = map(int,input().split())
z = a*3+p
if z % 2 == 0:
  print(int(z/2))
else:
  print(int((z-1)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
print((a*3+p)/2)

Failing test case input:
594 1

Expected output:
891


Actual output:
891.5


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
print((a*3+p)
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, p = map(int, input().split())
print(int(a * 3 + p / 2))

Failing test case input:
-30 -2

Expected output:
-46


Actual output:
-91


Fixed submission (verdict: Accepted):
a, p = map(int, input().split())
print(int((a * 3 + p)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, P = map(int, input().split())

print(round((P+3*A)/2))

Failing test case input:
-8 -1

Expected output:
-13


Actual output:
-12


Fixed submission (verdict: Accepted):
import math
A, P = map(int, input().split())

print(math.floor((P+3*A)/2))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,N = map(int,input().split())
A_N = A*3 + N

print(A_N/2)

Failing test case input:
416 1

Expected output:
624


Actual output:
624.5


Fixed submission (verdict: Accepted):
A,N = map(int,input().split())
A_N = A*3 + N

print(A_N

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p = map(int, input().split())
b = a*2+p
print(b%2)

Failing test case input:
468 1

Expected output:
702


Actual output:
1


Fixed submission (verdict: Accepted):
a,p = map(int, input().split())
b = a*3+p
print(b

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



a,p=map(int,input().split(" "))
print(round((a*3+p)/2))

Failing test case input:
594 1

Expected output:
891


Actual output:
892


Fixed submission (verdict: Accepted):


import math
a,p=map(int,input().split(" "))
print(math.floor((a*3+p)/2))

Problem: p03029
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,p = map(int,input().split())
p += a * 3
print(round(p / 2))

Failing test case input:
-47 0

Expected output:
-71


Actual output:
-70


Fixed submission (verdict: Accepted):
a,p = map(int,input().split())
p += a * 3
print(round(p

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
print(3*a+p)

Failing test case input:
4 13

Expected output:
12


Actual output:
25


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
print((3*a+p)

Problem: p03029
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = list(map(int, input().split()))
print((n[0]*3+n[1])/2)

Failing test case input:
-30 0

Expected output:
-45


Actual output:
-45.0


Fixed submission (verdict: Accepted):
n = list(map(int, input().split()))
print((n[0]*3+n[1])

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input().split()
t=int(s[0])*3+int(s[1])
print(t/3)

Failing test case input:
-13 0

Expected output:
-20


Actual output:
-13.0


Fixed submission (verdict: Accepted):
s = input().split()
t=int(s[0])*3+int(s[1])
print(t

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,P=map(int, input().split())
if (3*A+P)/2==0: print(int((3*A+P)/2))
else: print(int((3*A+P-1)/2))

Failing test case input:
1829 1

Expected output:
2744


Actual output:
2743


Fixed submission (verdict: Accepted):
A,P=map(int, input().split())
if (3*A+P)%2==0: print(int((3*A+P)/2))
else: print(int((3*A+P-1)/2))
Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
b=3*a+p
if b%2==0:
  print(b/2)
else:
  print((b-1)/2)

Failing test case input:
-24 -1

Expected output:
-37


Actual output:
-37.0


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
b=3*a+p
if b%2==0:
  print(b
else:
  print((b-1)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b = map(int, input().split())

sum = a*3 + b

p = sum/2

print(p)

Failing test case input:
582 1

Expected output:
873


Actual output:
873.5


Fixed submission (verdict: Accepted):
import math

a,b = map(int, input().split())
 
sum = a*3 + b
p = sum/2
print(math.floor(p))

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, p = map(int, input().split())
print((a*3 + p) / 2)


Failing test case input:
468 1

Expected output:
702


Actual output:
702.5


Fixed submission (verdict: Accepted):
a, p = map(int, input().split())
print((a*3 + p)

Problem: p03029
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,p=map(int,input().split())
s=3*a+p
if s%2==0:
  print(s/2)
else:
  print((s-1)/2)

Failing test case input:
-47 0

Expected output:
-71


Actual output:
-71.0


Fixed submission (verdict: Accepted):
a,p=map(int,input().split())
s=3*a+p
if s%2==0:
  print(int((s/2)))
else:
  print(int(((s-1)/2)))
Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = list( input() )
istwo = [ x == 2 for x in N ]
print( sum( istwo ) )

Failing test case input:
1269

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = list( input() )
istwo = [ x == "2" for x in N ]
print( sum( istwo ) )

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = list( input() )
istwo = [ x == 2 for x in N ]
print( sum( istwo ) )


Failing test case input:
2595

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N = list( input() )
istwo = [ x == "2" for x in N ]
print( sum( istwo ) )

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
N.count("2")

Failing test case input:
1052

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
N = input()
print(N.count("2"))

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = list(map(int, input()))
print(n.count("2"))


Failing test case input:
2595

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = list(input())
print(n.count("2"))

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


s=input()
res =0
for i in s:
    if i==2:
        res+=1

print(res)

Failing test case input:
924

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):


s = input()
res = 0

for i in s:
	if i =='2':
		res +=1
		
print(res)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
suuji = input()
print('input', suuji)
kaisu = 0
for i in suuji:
	if i == "2":
		kaisu += 1
	else:
		pass
print(kaisu)

Failing test case input:
6607

Expected output:
0


Actual output:
input 6607
0


Fixed submission (verdict: Accepted):
suuji = input()
kaisu = 0
for i in suuji:
	if i == "2":
		kaisu += 1
	else:
		pass
print(kaisu)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=list(input())
c=0
for i in N:
  if i==2 :
    c+=1
print(c)

Failing test case input:
1251

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N=list(input())
c=0
for i in N:
  if i=='2':
    c+=1
print(c)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
b = 0
for i in range(len(a)):
    if a[i]==2:
        b=b+1
    else:
        b=b
print(b)


Failing test case input:
1972

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a = input()
a = str(a)
b = 0
for i in range(len(a)):
    if a[i]=="2":
        b=b+1
    else:
        b=b
print(b)

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

N = input()
cnt = 0
for i in N:
    if i == '2':
        cnt +- 1
print(cnt)



Failing test case input:
9592

Expected output:
1

Actual output:
0


Fixed submission (verdict: Accepted):

N = input()
cnt = 0
for i in N:
    if i == '2':
        cnt += 1
print(cnt)
Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(str(input()).count("1"))

Failing test case input:
529

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
print(str(input()).count("2"))

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
text = input()
cnt = 0
for i in range(len(text)):
	if text[i] == "2":
		cnt += 1
print (i)

Failing test case input:
1269

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):
text = input()
cnt = 0
for i in text:
	if i == "2":
		cnt += 1
print (cnt)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = list(input())

cnt = 0

for i in range(len(n)):
    if n[i] == 2:
        cnt += 1
print(cnt)


Failing test case input:
2468

Expected output:
1


Actual output:
0


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

cnt = 0

for i in range(len(n)):
    if n[i] == "2":
        cnt += 1
print(cnt)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
text = input()
cnt = 0
for i in text:
	print (i)
	if i == "2":
		cnt += 1
print (cnt)

Failing test case input:
805

Expected output:
0


Actual output:
8
0
5
0


Fixed submission (verdict: Accepted):
text = input()
cnt = 0
for i in text:
	if i == "2":
		cnt += 1
print (cnt)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(4-input().count('2'))

Failing test case input:
7107

Expected output:
0


Actual output:
4


Fixed submission (verdict: Accepted):
print(input().count('2'))

Problem: p03192
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=input()

if n.count('2')==1:
  print(1)
if n.count('2')==2:
  print(2)
if n.count('2')==3:
  print(3)
if n.count('2')==4:
  print(4)

Failing test case input:
4410

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
n=input()
if n.count('2')==0:
  print(0)
if n.count('2')==1:
  print(1)
if n.count('2')==2:
  print(2)
if n.count('2')==3:
  print(3)
if n.count('2')==4:
  print(4)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input().count("2")

Failing test case input:
18919

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
print(input().count("2"))

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
text = input()
cnt = 0
for i in range(len(text)):
  if i == 2:
    cnt += 1
print (i)

Failing test case input:
1052

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):
text = input()
cnt = 0
for i in text:
	if i == "2":
		cnt += 1
print (cnt)

Problem: p03192
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
num=0

for i in range(len(N)):
    if N[i] ==2:
        num += 1
print(num)

Failing test case input:
2852

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
N = input().strip()
num=0

for i in range(len(N)):
    if N[i] == '2':
        num += 1
        
print(num)
Problem: p00100
Buggy submission (Python3, verdict: Wrong Answer):
import sys

while True:
    n = int(sys.stdin.readline().rstrip())
    if n == 0:
        break
    member = {}
    for i in range(n):
        e,p,q = sys.stdin.readline().rstrip().split(' ')
        if not e in member.keys():
            member[e] = 0
        member[e] += int(p) * int(q)
    ret = sorted(member.items(), key=lambda d: d[1])[::-1]
    ret = [k for k,v in ret if v >= 1000000]
    if len(ret) != 0:
        for d in ret:
            print(d)
    else:
        print("NA")

Failing test case input:
4
0000 2995 520
80 1800 450
2874 3111 566
0001 200 2276
2
1001 100 4
1005 1010 100
2
683 5000 100
2013 5000 100
0

Expected output:
0000
2874
NA
NA


Actual output:
2874
0000
NA
NA


Fixed submission (verdict: Accepted):
import sys

while True:
    n = int(sys.stdin.readline().rstrip())
    if n == 0:
        break
    members = []
    sales  = {}
    for i in range(n):
        e,p,q = sys.stdin.readline().rstrip().split(' ')
        if not e in members:
            members.append(e)
            sales[e] = 0
        sales[e] += int(p) * int(q)
    ret = [member for member in members if sales[member] >= 1000000]
    if len(ret) != 0:
        for d in ret:
            print(d)
    else:
        print("NA")
Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
kaibun = input()
print(kaibun)
print(kaibun[::-1])
if kaibun == kaibun[::-1]:
	print('Yes')
else:
	print('No')

Failing test case input:
492

Expected output:
No


Actual output:
492
294
No


Fixed submission (verdict: Accepted):
kaibun = str(input())


if kaibun == kaibun[::-1]:
	print('Yes')
else:
	print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=input();print('NYoe s'[N[0]==N[2]])

Failing test case input:
808

Expected output:
Yes


Actual output:
Y


Fixed submission (verdict: Accepted):
N=input();print('NYoe s'[N[0]==N[2]::2])

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
print('Yes' if reversed(N) == N else 'No')

Failing test case input:
262

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = input()
print('Yes' if ''.join(list(reversed(N))) == N else 'No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = sorted(input())
if n[0] == n[1]:
  print("Yes")
else:
  print("No")

Failing test case input:
558

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = input()
if n[0] == n[2]:
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()

'Yes' if S[0] == S[2] else 'No'

Failing test case input:
5328

Expected output:
No


Actual output:

Fixed submission (verdict: Accepted):
S = input()
 
print('Yes' if S[0] == S[2] else 'No')

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


import sys
a=input()
if a==a[::-1]:
    print("YES")
else:
    print("NO")


Failing test case input:
371

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):


import sys
a=input()
if a==a[::-1]:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
NN = list(N)
checker = ""
for i in range(len(NN)):
    checker += NN[-1]
if N == checker:
    print("Yes")
else:
    print("No")

Failing test case input:
757

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = input()
NN = list(N)
checker = ""
for i in range(len(NN)):
    checker += NN[-i-1]
if N == checker:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = list(input())
if N == N.reverse():
  print("Yes")
else:
  print("No")

Failing test case input:
666

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = list(input())
new = list(reversed(N))
if N == new:
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=input()
print('YES' if n==n[::-1] else 'NO')

Failing test case input:
654

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n=input()
print('Yes' if n==n[::-1] else 'No')
Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = list(input())
if n[0] == n[1]:
    print('Yes')
else:
    print('No')

Failing test case input:
646

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = list(input())
if n[0] == n[2]:
    print('Yes')
else:
    print('No')

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

import sys


YES = "Yes"  
NO = "No"  


def solve(N: int):
    s = str(N)
    print(s[0] == s[2])


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)


if __name__ == '__main__':
    main()


Failing test case input:
336

Expected output:
No


Actual output:
False


Fixed submission (verdict: Accepted):

import sys


YES = "Yes"  
NO = "No"  


def solve(N: int):
    s = str(N)
    print(YES if s[0] == s[2] else NO)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)


if __name__ == '__main__':
    main()

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=input()
print(list(a))
if list(a) ==list(reversed(a)): print('Yes')
else: print('No')

Failing test case input:
679

Expected output:
No


Actual output:
['6', '7', '9']
No


Fixed submission (verdict: Accepted):
a=input()
if list(a) ==list(reversed(a)): print('Yes')
else: print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A = input()

if A == A[:-1]:
    print('Yes')
else:
    print('No')

Failing test case input:
646

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
A = input()

if A == A[::-1]:
    print('Yes')
else:
    print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()

if N == N[::-1]:
  print("YES")
else:
  print("NO")

Failing test case input:
1681

Expected output:
No


Actual output:
NO


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

if N == N[::-1]:
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A = input()

B = A[::-1]
flag = True
for i in range(len(A)):
    if A[i] != B[i]:
        flag = False
        break

if flag: print('YES')
else: print('NO')

Failing test case input:
666

Expected output:
Yes


Actual output:
YES


Fixed submission (verdict: Accepted):
A = input()

B = A[::-1]
flag = True
for i in range(len(A)):
    if A[i] != B[i]:
        flag = False
        break

if flag: print('Yes')
else: print('No')

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

if n[0] == n[2]:
  print('YES')
else:
  print('NO')

Failing test case input:
2534

Expected output:
No


Actual output:
NO


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

if n[0] == n[2]:
  print('Yes')
else:
  print('No')
Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n_str = input()
n_list = list(n_str)
n_list_reverse = n_list.reverse()
if n_list == n_list_reverse:
    print("Yes")
else:
    print("No")

Failing test case input:
262

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n_str = input()
n_list = list(n_str)
n_list_reverse = list(n_str)
n_list_reverse.reverse()
if n_list == n_list_reverse:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
print("Yes" if a == reversed(a) else "No")

Failing test case input:
262

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
a = input()
print("Yes" if a == a[::-1] else "No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=str(input())

if int(N[-1])==int(N):
  print("Yes")
else:
  print("No")

Failing test case input:
515

Expected output:
Yes


Actual output:
No


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

if int(N[::-1])==int(N):
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = list(input())
if N == N[::-1]:print('YES') 
else: print('NO')

Failing test case input:
559

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N = list(input())
if N == N[::-1]:print('Yes') 
else: print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input().strip()

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


Failing test case input:
515

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = input().strip()

if n == n[::-1]:
    print('Yes')
else:
    print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
if N[0] == N[2]: print("Yes")

Failing test case input:
1808

Expected output:
No


Actual output:

Fixed submission (verdict: Accepted):
N = input()
if N[0] == N[2]: print("Yes")
else: print("No")

Problem: p03631
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = str(input())
if n[0]==n[2]:
  print('yes')
else:
  print('no')

Failing test case input:
665

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n = str(input())
if n[0]==n[2]:
  print('Yes')
else:
  print('No')

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

a = 0
b = 0

for i in range(1,10):
    if N > 100:
        N = N - 100
        a = a + 1

for j in range(1,10):
    if N > 10:
        N = N - 10
        b = b + 1
c = N

if a == c:
    print("yes")
else:
    print("no")

Failing test case input:
679

Expected output:
No


Actual output:
no


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

a = 0
b = 0

for i in range(1,10):
    if N > 100:
        N = N - 100
        a = a + 1

for j in range(1,10):
    if N > 10:
        N = N - 10
        b = b + 1
c = N

if a == c:
    print("Yes")
else:
    print("No")
Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

s = str(N)
if s[0] == s[2]:
    print("Yes")
else:
    print("NO")

Failing test case input:
304

Expected output:
No


Actual output:
NO


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

s = str(N)
if s[0] == s[2]:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = input()
ans = "Yes" if N == reversed(N) else "No"
print(ans)

Failing test case input:
646

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = input()
ans = "Yes" if N == N[::-1] else "No"
print(ans)

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=input()
if N==N[::-1]:
 print('yes')
else:
 print('no')

Failing test case input:
731

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
N=input()
if N==N[::-1]:
 print('Yes')
else:
 print('No')

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

def II(): return int(input())
def ILI(): return list(map(int, input().split()))


def read():
    N = II()
    return (N, )


def solve(N):
    n = str(N)
    if n == reversed(n):
        ans = "Yes"
    else:
        ans = "No"
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()


Failing test case input:
515

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):

def II(): return int(input())
def ILI(): return list(map(int, input().split()))


def read():
    N = input()
    return (N, )


def solve(N):
    rev = str(int("".join(reversed(N))))
    if N == rev:
        ans = "Yes"
    else:
        ans = "No"
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input()
if n == n[::-1]:
    print("YES")
else:
    print("NO")

Failing test case input:
1190

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = input()
if n == n[::-1]:
    print("Yes")
else:
    print("No")

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



input_num = input()
input_len = len(input_num)
input_lis = list(input_num)
rvrsd_lis = list(reversed(input_lis))
flag = 0

print(input_lis)
print(rvrsd_lis)

for i in range(input_len):
    print(input_lis[i])
    print(rvrsd_lis[i])
    if input_lis[i] != rvrsd_lis[i]:
        flag = 1
        print("No")
        break

if flag == 0:
    print("Yes")


Failing test case input:
1306

Expected output:
No


Actual output:
['1', '3', '0', '6']
['6', '0', '3', '1']
1
6
No


Fixed submission (verdict: Accepted):



input_num = input()
input_len = len(input_num)
input_lis = list(input_num)
rvrsd_lis = list(reversed(input_lis))
flag = 0




for i in range(input_len):
    
    
    if input_lis[i] != rvrsd_lis[i]:
        flag = 1
        print("No")
        break

if flag == 0:
    print("Yes")
Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

n=str(input())
if(n[0]==n[1]):
  print("Yes")
else:
  print("No")

Failing test case input:
1190

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):

n=str(input())
if(n[0]==n[2]):
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = input()
if list(s) == reversed(list(s)):
  print("Yes")
else:
  print("No")

Failing test case input:
515

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
s = input()

if list(s) == list(reversed(list(s))):
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
num=int(input())

if num%10==num/100:
    print("YES")
else:
    print("NO")

Failing test case input:
1190

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
num=input()

if num[0]==num[2]:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = ""
for i in range(len(a)):
    b += a[i]
if a == b:
    print("Yes")
else:
    print("No")

Failing test case input:
1230

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a = input()
b = ""
for i in range(len(a)):
    b += a[len(a) - i - 1]
if a == b:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=input()

if int(N[-1])==int(N):
  print("Yes")
else:
  print("No")

Failing test case input:
515

Expected output:
Yes


Actual output:
No


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

if int(N[::-1])==int(N):
  print("Yes")
else:
  print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = str(input())
print("Yes" if n[0] == n[1] else "No")

Failing test case input:
757

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = str(input())
print("Yes" if n[0] == n[2] else "No")

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

N = list(input().split())
N1 = list(reversed(N))
if N == N1:
    print("Yes")
else:
    print("No")

Failing test case input:
1035

Expected output:
No


Actual output:
Yes


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

N1 = N[2]+N[1]+N[0]
if N == N1:
    print("Yes")
else:
    print("No")

Problem: p03631
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n_str = input()
n_list = list(n_str)
n_list_reverse = list(n_str)
n_list_reverse.reverse()
if n_list == n_list.reverse():
    print("Yes")
else:
    print("No")


Failing test case input:
808

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n_str = input()
n_list = list(n_str)
n_list_reverse = list(n_str)
n_list_reverse.reverse()
if n_list == n_list_reverse:
    print("Yes")
else:
    print("No")