TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
n = int(input())
s1 = str(input())
s2 = str(input())

cnt = 1

for i in range(n):
    if i == 0:
        if s1[i] == s2[i]:
            cnt = cnt * 3
            previous = 'tate'
        else:
            cnt = cnt * 6
            previous = 'yoko1'
    else:
        if s1[i] == s2[i]:   #tate
            if previous == 'tate':
                cnt = cnt * 2
            elif previous == 'yoko2':
                cnt = cnt * 3
        else:   #yoko
            if previous = 'tate':
                cnt = cnt * 2
            elif previous = 'yoko2':
                cnt = cnt * 3
print(cnt%1000000007)

n = int(input())
s1 = str(input())
s2 = str(input())

cnt = 1

for i in range(n):
    if i == 0:
        if s1[i] == s2[i]:
            cnt = cnt * 3
            previous = 'tate'
        else:
            cnt = cnt * 6
            previous = 'yoko1'
    else:
        if s1[i] == s2[i]:   #tate
            if previous == 'tate':
                cnt = cnt * 2
            elif previous == 'yoko2':
                cnt = cnt * 1
                previous = 'tate'
        else:   #yoko
            if previous == 'tate':
                cnt = cnt * 2
                previous = 'yoko1'
            elif previous == 'yoko2':
                cnt = cnt * 3
                previous = 'yoko1'
            elif previous == 'yoko1':
                previous = 'yoko2'
        
print(cnt%1000000007)

Verdicts: Runtime Error

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
n = int(input())
s1 = input()
s2 = input()
mod = 10**9+7
b = 0
2did = 0
ans = 0
if s1[0] == s2[0]:
  b = 1
  ans += 3
else:
  2did = 1
  ans = 6
for i in range(1,n):
  if s1[i] == s2[i]:
    if b:
      ans = ans*2%mod
    b = 1
  elif not 2did:
    if b:
      ans = ans*2%mod
    else:
      ans = ans*3%mod
    2did = 1
    b = 0
  else:
    2did = 0
print(ans)

n = int(input())
s1 = input()
s2 = input()
mod = 10**9+7
b = 0
did = 0
ans = 0
if s1[0] == s2[0]:
  b = 1
  ans += 3
else:
  did = 1
  ans = 6
for i in range(1,n):
  if s1[i] == s2[i]:
    if b:
      ans = ans*2%mod
    b = 1
  elif not did:
    if b:
      ans = ans*2%mod
    else:
      ans = ans*3%mod
    did = 1
    b = 0
  else:
    did = 0
print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
MOD = 1000000007

N = int(input())
S = []
for i in range(2):
    S.append(input())
    

# make XYline
xy = ""
for i in range(len(S[0])):
    if S[0][i] == S[1][i]:
        xy += "X"
    elif i==len(S[0])-1:
        break
    elif S[0][i] == S[0][i+1]:
        xy += "Y"

# proceed
if xy[0] == "X":
    ans = 3
else:
    ans = 6

if len(xy)==1:
    pass
else:
    for i in range(1,len(xy)):
        if xy[i-1] == "X" and xy[i] == "X":
            ans *= 2
        elif xy[i-1] == "X" and xy[i] == "Y":
            ans *= 2
        elif xy[i-1] == "Y" and xy[i] == "X":
            ans *= 1
        elif xy[i-1] == "Y" and xy[i] == "Y":
            ans *= 3

        ans = ans%MOD


import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


def scan_domino(a: list, b: list):
    n = len(a)
    cnt = 0
    domino = ""

    while cnt < n:
        if a[cnt] == b[cnt]:
            domino += "x"
            cnt += 1
        else:
            domino += "y"
            cnt += 2

    return domino


def cnt_pattern(domino, mod):
    ans = 3 if domino[0] == "x" else 6
    for dleft, dright in zip(domino[:-1], domino[1:]):
        if dleft == "x" and dright == "x":
            ans *= 2
        elif dleft == "x" and dright == "y":
            ans *= 2
        elif dleft == "y" and dright == "x":
            ans *= 1
        else:
            ans *= 3

        ans %= mod

    return ans


n = ni()
a = lc()
b = lc()

MOD = 10**9 + 7

domino = scan_domino(a, b)
pats = cnt_pattern(domino, MOD)

print(pats)

Verdicts: Wrong Answer

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
# encoding:utf-8
import sys

def main():
	n = int(input())
	str1 = input()
	str2 = input()

	ptrn = []
	i = 0
	while True:
		if str1[i] == str2[i]:
			ptrn.append("t")
			i += 1
		else:
			ptrn.append("y")
			i += 2
		if i >= n:
			break
	
	print(ptrn)

	if ptrn[0] == "t":
		n_ptrn = 3
	else:
		n_ptrn = 6

	for i in range(1, len(ptrn)):
		print(n_ptrn)
		if ptrn[i - 1] == "t" and ptrn[i] == "t":
			n_ptrn = n_ptrn * 2
		elif ptrn[i - 1] == "t" and ptrn[i] == "y":
			n_ptrn = n_ptrn * 2
		elif ptrn[i - 1] == "y" and ptrn[i] == "y":
			n_ptrn = n_ptrn * 3

	print(n_ptrn % 1000000007)

if __name__ == '__main__':
	main()

# encoding:utf-8
import sys

def main():
	n = int(input())
	str1 = input()
	str2 = input()

	ptrn = []
	i = 0
	while True:
		if str1[i] == str2[i]:
			ptrn.append("t")
			i += 1
		else:
			ptrn.append("y")
			i += 2
		if i >= n:
			break
	
	#print(ptrn)

	if ptrn[0] == "t":
		n_ptrn = 3
	else:
		n_ptrn = 6

	for i in range(1, len(ptrn)):
		#print(n_ptrn)
		if ptrn[i - 1] == "t" and ptrn[i] == "t":
			n_ptrn = n_ptrn * 2
		elif ptrn[i - 1] == "t" and ptrn[i] == "y":
			n_ptrn = n_ptrn * 2
		elif ptrn[i - 1] == "y" and ptrn[i] == "y":
			n_ptrn = n_ptrn * 3

	print(n_ptrn % 1000000007)



if __name__ == '__main__':
	main()

Verdicts: Wrong Answer

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
def check(i,j):
    if i > 0:
        k = S[j][i-1] 
        if k in checked and not k in C:
            C.append(k)
    if j > 0:
        l = S[j-1][i]
        if l in checked and not l in C:
            C.append(l)
N = int(input())
S = [list(input()) for _ in range(2)]
ans = 1
checked = {}
for i in range(N):
    for j in range(2):
        p = S[j][i]
        print(p,ans)
        if not p in checked:
            C = []
            check(i,j)
            if j < 1 and S[j+1][i] == p:
                check(i,j+1)
            checked[p] = C
            print(C)
            print([checked[i] for i in C] if C != [] else 0)
            if len(C) > 1:
                if not C[0] in checked[C[-1]]:
                    ans = ((ans*3)//2)
            else:
                ans = (ans*(3-len(C)))
            print(ans)
print(ans%(10**9+7))

def check(i,j):
    if i > 0:
        k = S[j][i-1] 
        if k in checked and not k in C:
            C.append(k)
    if j > 0:
        l = S[j-1][i]
        if l in checked and not l in C:
            C.append(l)
N = int(input())
S = [list(input()) for _ in range(2)]
ans = 1
checked = {}
for i in range(N):
    for j in range(2):
        p = S[j][i]
        if not p in checked:
            C = []
            check(i,j)
            if j < 1 and S[j+1][i] == p:
                check(i,j+1)
            checked[p] = C
            if len(C) > 1:
                if not C[0] in checked[C[-1]]:
                    ans = ((ans*3)//2)
            else:
                ans = (ans*(3-len(C)))
print(ans%(10**9+7))

Verdicts: Wrong Answer

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
M = 10**9+7
n = int(input())
s = input()
t = input()
ans = 3 if s[0] == t[0] else 6
for i in range(1, n):
  if s[i-1] == s[i]:
    continue
  if s[i-1] == t[i-1]:
    ans = ans * 2 % M
  else if s[i] != t[i]:
    ans = ans * 3 % M
print(ans)

M = 10**9+7
n = int(input())
s = input()
t = input()
ans = 3 if s[0] == t[0] else 6
for i in range(1, n):
  if s[i-1] == s[i]:
    continue
  if s[i-1] == t[i-1]:
    ans = ans * 2 % M
  elif s[i] != t[i]:
    ans = ans * 3 % M
print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square.  Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.  Find the number of such ways to paint the dominoes, modulo 1000000007.  The arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:    * Each domino is represented by a different English letter (lowercase or uppercase).   * The j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

Submission attempts (in order):
n=int(input())
s=input()
t=input()
n=len(s)
mod=10**9+7
ans=1
i=0
while i<n:
  if i==0:
    if s[i]==t[i]: 
      ans*=3
      i+=1
    else:
      ans*=3
      i+=2
    continue
  if s[i-1]!=t[i-1] and s[i]==t[i]:
    ans*=1
    i+=1
  elif s[i-1]==t[i-1] and s[i]!=t[i]:
    ans*=2
    i+=2
  elif s[i-1]!=t[i-1] and s[i]!=t[i]:
    ans*=3
    i+=2
  elif s[i-1]==t[i-1] and s[i]==t[i]:
    ans*=2
    i+=1
  ans%=mod
print(ans)


n=int(input())
s=input()
t=input()
n=len(s)
mod=10**9+7
ans=1
i=0
while i<n:
  if i==0:
    if s[i]==t[i]: 
      ans*=3
      i+=1
    else:
      ans*=6
      i+=2
    continue
  if s[i-1]!=t[i-1] and s[i]==t[i]:
    ans*=1
    i+=1
  elif s[i-1]==t[i-1] and s[i]!=t[i]:
    ans*=2
    i+=2
  elif s[i-1]!=t[i-1] and s[i]!=t[i]:
    ans*=3
    i+=2
  elif s[i-1]==t[i-1] and s[i]==t[i]:
    ans*=2
    i+=1
  ans%=mod
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = int(input())
if (int)n/100==n%10:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=int(input())

if N//100=N%10:
  print("Yes")
else:
  print("No")
  

N=int(input())

if N//100==N%10:
  print("Yes")
else:
  print("No")
  

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()
if n = n[::-1]:
  print('Yes')
else:
  print('No')

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
print('YNeos'[input()!=input()[::-1]::2])

n=input();print('YNeos'[n!=n[::-1]::2])

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a,b,c=input()
print("YES" if a==c else "NO")

a,b,c=input()
print("Yes" if a==c else "No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()
print('Yes' if n[0] == n[1] else 'No')

n = input()
print('Yes' if n[0] == n[2] else 'No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a,b,c = input()
print("Yes" if a == c else: "No")

a,b,c = input()
print('Yes' if a == c else: 'No')

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

a,b,c = input()
print('Yes' if a == c:else: 'No')

a,b,c=input()
print("Yes" if a==c else "No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=input()
if(N[0]==N[1]):
  print("Yes")
else:
  print("No")

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


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a,b,c=int(input())
if a==c:
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()

    for i in range(len(s)/2):
        if s[i] = s[len(s)-1 -i]:
            print('No')
            return
    
    print('Yes')

solve()


import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()


    for i in range(len(s)//2):
        if s[i] != s[len(s)-1 -i]:
            print('No')
            return
    
    print('Yes')

solve()


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a,b,c,d = map(int, input().split())
if a==c:
    print(abs(b-d))
elif a>c:
    if a>d:
        print(0)
    elif a<d<b:
        print(abs(a-d))
    else:
        print(abs(a-b))
else:
    if c>b:
        print(0)
    elif c<b<d:
        print(abs(c-b))
    else:
        print(abs(c-d))

x = input()↲
if x[0] == x[2]:↲
    print('Yes')↲
else:↲
    print('No')↲

a,b,c,d = map(int, input().split())
if a==c:
    print(abs(b-d))
elif a>c:
    if a>d:
        print(0)
    elif a<d<b:
        print(abs(a-d))
    else:
        print(abs(a-b))
else:
    if c>b:
        print(0)
    elif c<b<d:
        print(abs(c-b))
    else:
        print(abs(c-d))

a,b,c,d = map(int, input().split())
if a==c:
    print(abs(b-d))
elif a>c:
    if a>d:
        print(0)
    elif a<d<b:
        print(abs(a-d))
    else:
        print(abs(a-b))
else:
    if c>b:
        print(0)
    elif c<b<d:
        print(abs(c-b))
    else:
        print(abs(c-d))

x = input()
if x[0] == x[2]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=input()
print("Yes" if N[0]=N[2] else "No")

N=input()
print("Yes" if N[0]==N[2] else "No")


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()
if n == n[::-1]:
    print("YES")
else:
    print("NO")

n = input()
x = n[::-1]
if n == x:
    print("YES")
else:
    print("NO")


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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = int(input())

lcm = 0
gcd = 0

for i in range(n):
    t = int(input())
    if(i == 0):
        lcm, gcd = t, t
        continue
    lcm = t
    r = gcd % t
    while(r!=0):
        lcm = r
        r = t % r
    gcd *= t
    gcd //= lcm
print(gcd)


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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input()

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

N = input()

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

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=input()
n=int(n)
og=n
rev=0
while(n>0):
    d=n%10  
    n=n/10
    rev=rev*10+d
if(rev==og):
    print("Yes")
else:
    print("No")
    
        
  


        


n=input()
n=int(n)
og=n
rev=0
while(n>0):
    d=n%10
    n=n/10
    rev=rev+d
if(og==rev):
    print("Yes)
    else:
    print("No")    


n=input()
n=int(n)
og=n
rev=0
while(n>0):
    d=n%10  
    n=n//10
    rev=rev*10+d
if(rev==og):
    print("Yes")
else:
    print("No")
    
        
  


        


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=input()

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

n=input()

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

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a=input()
print(list(a))
if list(a) ==list(reversed(a)): print('Yes')
else: print('No')

a=input()
if list(a) ==list(reversed(a)): print('Yes')
else: print('No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
from math import gcd


def lcm(x, y):
    return (x*y) // gcd(x, y)


N = int(input())
ans = 0
for i in range(N):
    T = int(input())

    if i == 0:
        ans = T

    else:
        ans = lcm(ans, T)

print(ans)


import math


def lcm(x, y):
    return (x*y) // math.gcd(x, y)


N = int(input())
ans = 0
for i in range(N):
    T = int(input())

    if i == 0:
        ans = T

    else:
        ans = lcm(ans, T)

print(ans)


N = input()

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a = input()
print("yes" if a[0]==a[2] else "no")


a,b,c = input()
print("yes" if a == c else "no")

a,b,c = input()
print("Yes" if a == c else "No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input()

if N = N[::-1]:
  r = 'Yes'
else:
  r = 'No'

print(r)

N = input()
 
rN = N[::-1]
if N = rN:
  r = 'Yes'
else:
  r = 'No'

print(r)

N = input()

rN = N[::-1]
if N == rN:
  r = 'Yes'
else:
  r = 'No'
 
print(r)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = [i for i in input()]
check = True
for i in range(N):
    if N[i] != N[-i]:
       check = False
       break
if check ==True:
    print("Yes")
else:
    print("No")

N = [i for i in input()]
check = True
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=input();print('NYoe s'[N[0]==N[2]])

N=input();print('NYoe s'[N[0]==N[2]::2])


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=input()
print("YES" if n[0]==n[-1] else "NO")

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

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=str(input())

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

N=input()

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

N=input()

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
S = input()

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

S = input()
 
print('Yes' if S[0] == S[2] else 'No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()

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

n = input()

if n[0] == n[2]:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=str(input().split())
print("Yes" if n[0]==n[2] else "No")

a,b,c=input()
print("Yes" if a==c else "No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
s = input()
if s == reversed(s):
    print("Yes")
else:
    print("No")


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


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):

n = input()

if n(0) == n(-1):
    print("Yes")
else:
    print("No")



n = input()

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


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()
if n[0] == n[1]:
  print('Yes')
else:
  print('No')

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

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
import sys;sys.setrecursionlimit(int(1e7))
from sys import stdin
from collections import deque
 
input = stdin.readline
N = int(input())
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
    a, b, c = map(int,input().split())
    tree[a].append((b,c))
    tree[b].append((a,c))
 
Qn,K = map(int,input().split())
XY = [tuple(map(int,input().split())) for _ in range(Qn)]
 
depth = [None]*(N+1)
def DFS(v,p,d):
    depth[v] = d
    for e in tree[v]:
        if e[0] != p:
            DFS(e[0], v, d + e[1])
DFS(K,0,0)
 
for i in range(Qn):
    print(depth[XY[i][0]] + depth[XY[i][1]])

def gcd(a,b):
    #a=min(a,b)
    #b=max(a,b)
    while b:
        a,b= b, a%b
    return a

def lcm(a,b):
    return a*b//gcd(a,b)
T=[]
N=int(input())
for i in range(N):
    T.append(int(input()))

ans=1
for t in T:
    ans=lcm(ans, t)

print(ans)

S=list(map(int, input()))

if S[0]==S[2]:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
x=input()
y=list(x)
if y[0]==y[2]:
    print("yes")
else:
    print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input().split
 
if N == list(reversed(N)):
    print("Yes")
else:
    print("No")

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

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

N = input()

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a=input()
print(["No","Yes"][a[0]==a[2])

a=input()
print(["No","Yes"][a[0]==a[2]])

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = list(input())
m = n.reverse()
print('Yes' if n == m else 'No')

n = list(input())
m = n.reverse()
print('Yes' if ''.join(n) == ''.join(m) else 'No')

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input()
M = N[2] + N[1] + N[0]
if N == M:


N = int(input())
M = N[2] + N[1] + N[0]
if N == M:
	print('Yes')
else:
	print('No')

N = input()
M = N[2] + N[1] + N[0]
if N == M:
	print('Yes')
else:
	print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input()

half = N // 2

if N%2 == 0:
  left_N = N[:half]
  right_N = N[half:]
else:
  left_N = N[:half]
  right_N = N[half+1:]

for l,r in zip(left_N, right_N[::-1]):
  if l != r:
    print('No')
    exit()
    
print('Yes')

N = input()

half = len(N) // 2

if len(N)%2 == 0:
  left_N = N[:half]
  right_N = N[half:]
else:
  left_N = N[:half]
  right_N = N[half+1:]

for l,r in zip(left_N, right_N[::-1]):
  if l != r:
    print('No')
    exit()
    
print('Yes')

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a,b,c,d=map(int,input().split())
s=max(b,d)-min(a,c)
s_i=(c-a)+(d-b)
if b<c:
    print(0)
else:
    print(abs(s_i-s))

a,b,c,d=map(int,input().split())
s=max(b,d)-min(a,c)
s_i=(c-a)+(d-b)
if b<c:
    print(0)
else:
    print(s-s_i)

a,b,c,d=map(int,input().split())
if b<c:
    print(0)
else:
    print(min(b,d)-max(a,c))

n=list(map(int,input().split))
n_re=n.reverse()
if n==n_re:
    print("Yes")
else:
    print("No")


a,b,c,d=map(int,input().split())
print(min(b,d)-max(a,c))


n=list(map(int,input()))
if n[0]==n[2]:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=input()
if n[0]==n[-1]:
  return 'Yes'
else:
  return 'No'

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):

class edge():
    def __init__(self,_to,_cost):
        self.to = _to;
        self.cost = _cost;

N = int(input())
tree = [[] for i in range(N)]

for i in range(N-1):
    a,b,c = list(map(int,input().split()))
    a = a - 1
    b = b - 1
    tree[a].append(edge(b,c))
    tree[b].append(edge(a,c))
Q,K = list(map(int,input().split()))
K = K - 1

depth = [-1] * N

def DFS(v,p,d):
    depth[v] = d
    for e in tree[v]:
        if e.to == p:
            continue
        DFS(e.to, v, d + e.cost)
DFS(K,-1,0)

for _ in range(Q):
    x,y = list(map(int, input().split()))
    x = x - 1
    y = y - 1
    print(depth[x] + depth[y])


class edge():
    def __init__(self,_to,_cost):
        self.to = _to;
        self.cost = _cost;

N = int(input())
tree = [[] for i in range(N)]

for i in range(N-1):
    a,b,c = list(map(int,input().split()))
    a = a - 1
    b = b - 1
    tree[a].append(edge(b,c))
    tree[b].append(edge(a,c))
Q,K = list(map(int,input().split()))
K = K - 1
dmax = 10**14 + 1
depth = [dmax for _ in range(N+1)]
depth[K] = 0

def DFS(v,p,d):
    depth[v] = d
    for e in tree[v]:
        if e.to == p:
            continue
        DFS(e.to, v, d + e.cost)
DFS(K,-1,0)

for _ in range(Q):
    x,y = list(map(int, input().split()))
    x = x - 1
    y = y - 1
    print(depth[x] + depth[y])


N = int(input())

class edge:
    def __init__(self,_to,_cost):
        self.to = _to;
        self.cost = _cost;

tree = [[] for i in range(N)]

for i in range(N-1):
    a,b,c = list(map(int, input().split()))
    a = a - 1
    b = b - 1
    tree[a].append(edge(b,c))
    tree[b].append(edge(a,c))

Q, K = list(map(int, input().split()))
K = K - 1
depth = [0]*N

def DFS(v,p,d):
    depth[v] = d
    for e in tree[v]:
        if e.to==p :
            continue
        DFS(e.to, v, d + e.cost)

DFS(K,-1,0)

for q in range(Q):
    x,y = list(map(int, input().split()))
    x = x - 1
    y = y - 1
    print(depth[x] + depth[y])


n = input()
s = []
for i in range(len(n)):
    s.append(n[len(n)-1-i])
if(n=="".join(s)):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
#70

N = list(int(input()))

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

#70

N = list(input())

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
import sys





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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    inf = 10 ** 20
    n = read_int()
    adj = [[] for u in range(n)]
    for i in range(n - 1):
        a, b, c = map(int, input().split())
        a -= 1
        b -= 1
        adj[a].append((b, c))
        adj[b].append((a, c))

    q, k = read_int_list()
    k -= 1
    d = [inf for u in range(n)]

    d[k] = 0
    Q = [(k, -1)]
    while Q:
        u, parent = Q.pop(0)
        for v, w in adj[u]:
            if v == parent:
                continue
            d[v] = d[u] + w
        Q.extend([(v, u) for v, w in adj[u] if v != parent])

    res = [0] * q
    for i in range(q):
        x, y = map(int, input().split())
        res[i] = d[x-1] + d[y-1]
    print(*res, sep='\n')


main()


import sys




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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int_list()
    if reversed(n) == n:
        res = 'Yes'
    else:
        res = 'No'
    print(res)


main()


import sys




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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_str()
    if n == ''.join(list(reversed(n))):
        res = 'Yes'
    else:
        res = 'No'
    print(res)


main()


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
l = int(input())
if l[0] == l[2]:
    print("Yes")
else:
    print("No")

l = int(input())
if l[0] = l[2]:
    print("Yes")
else:
    print("No")
    
    

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
#coding:utf-8

a, b, c, d = map(int, input().split())

print(min(a,c)- max(b,d))


#coding:utf-8

a, b, c, d = map(int, input().split())
time = max(b,d) - min(a,c)
print(max(0, time))


#coding:utf-8

a, b, c, d = map(int, input().split())

print(max(b,d) - min(a,c))


#coding:utf-8

n = list(input())

if n[0] == n[2]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n=inupt()
if n==n[::-1]:
  print("Yes")
else:
  print("No")

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


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
def resolve():
    n = input()
    print("Yes" if reversed(n) == n else "No")


if __name__ == "__main__":
    resolve()


def resolve():
    n = input()
    print("Yes" if n[::-1] == n else "No")


if __name__ == "__main__":
    resolve()


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
l=list(map(int,input().split()))
ans=min(l[1],l[3])-max(l[0],l[2])
print(ans if ans>0 else 0)

i=input()
print("Yes" if i[0]==i[2] else "No")

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = list(map(int, input()))
x = 0
for i in range(N // 2):
  if N[i] != N[-i]:
    print('No')
    x = 1
    break
if x == 0:
  prin('Yes')


N = list(map(int, input()))
x = 0
for i in range(N // 2):
  if N[i] != N[-i]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')

N = list(map(int, input()))
x = 0
for i in range(len(N) // 2):
  if N[i] != N[-i-1]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
A,B,C,D = map(int, input().split())
if D<A or B<C: print("0")
else if D-A < B-C: print(D-A)
else: print(B-C)

N = input()
if N[0] == N[2]: print(Yes)

A,B,C,D = map(int, input().split())
if D<A or B<C: print("0")
elif A<C and D<B: print(D-C)
elif C<A and B<D: print(B-A)
elif D-A < B-C: print(D-A)
else: print(B-C)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = input()
a = int(int(n)/100);
c = int(n)%10;
if a == c:
    print("YES")
else :
    print("NO")

n = input()
a = int(int(n)/100);
c = int(n)%10;
if a == c:
    print("Yes")
else :
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
A,B,C,D = map(int,input().split())

if (B < C or D < A):
    print("0")
else:
    print(abs(max(A,C)-min(B,D)))

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = int(inout())
if n//100 == n%10:
  print('YES')
else:
  print('NO')

n = str(input())
rn = ''.join(list(reversed(list(n))))
print('yes' if n == rn else 'no')

n = str(input())
rn = ''.join(reversed(list(n)))
print('Yes' if n == rn else 'No')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N=list(int(input()))
if N[0]==N[2]:
  print("Yes")
else:
  print("No")

N=list(input())
if N[0]==N[2]:
  print("Yes")
else:
  print("No")


Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = int(input())
if n[0] == n[2]:
	print('Yes')
else:
	print('No')

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = list(int,input())
m = n.sort(reverse=True)
if n == m:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
N = input()
if N[0] == N[1]:
    print("Yes")
else:
    print("No")


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


Verdicts: Wrong Answer

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
a, b, c, d = map(int, input().split())


one = [i for i in range(a, b)]
two = [i for i in range(c, d)]

count = 0
for i in one:
    if i in two:
        count += 1
print(count)

n = input()

a = [i for i in n]
b = [i for i in reversed(n)]

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



Verdicts: Runtime Error

Accepted
Problem: You are given a three-digit positive integer N.   Determine whether N is a _palindromic number_.   Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.

Submission attempts (in order):
n = list(input())
if n == reversed(n):
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

Accepted