Problem:


Score : 100 points

Problem Statement

You are given a grid with 2 rows and 3 columns of squares.
The color of the square at the i-th row and j-th column is represented by the character C_{ij}.

Write a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.

Constraints

C_{i,j}(1 \leq i \leq 2, 1 \leq j \leq 3) is a lowercase English letter.

Input

Input is given from Standard Input in the following format:

C_{11}C_{12}C_{13}
C_{21}C_{22}C_{23}

Output

Print YES if this grid remains the same when rotated 180 degrees; print NO otherwise.

Sample Input 1

pot
top

Sample Output 1

YES

This grid remains the same when rotated 180 degrees.

Sample Input 2

tab
bet

Sample Output 2

NO

This grid does not remain the same when rotated 180 degrees.

Sample Input 3

eye
eel

Sample Output 3

NO



Sample input:
pot
top


Sample output:
YES

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()

if s1[0]==s2[2] and s1[1]==s2[1] and s1[2]==s2[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
print('YES' if c1 == c2[::-1] else 'NO')

Submission status: Accepted

Solution code:
a = input()
b = input()

b_reverse = b[::-1]

if a == b_reverse:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()

print('YES' if C1 == C2[::-1] else 'NO')

Submission status: Accepted

Solution code:
C1=input()
C2=input()
if C1==C2[::-1]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:

import math

x=input()
y=input()
flag=True
if(x[0]!=y[2]):
    flag=False
elif(x[2]!=y[0]):
    flag=False
elif(x[1]!=y[1]):
    flag=False
if(flag):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
C1=input()
C2=input()

if C1[0]==C2[2] and C1[1]==C2[1] and C1[2]==C2[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
if (c1[0] == c2[2]) and (c1[1] == c2[1]) and (c1[2] == c2[0]):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s=input()
t=input()

if s==t[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
c = input()
d = input()

if c[0]==d[2] and c[1] == d[1] and c[2]==d[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
C = list(input() for i in range(2))
print("YES" if C[0]==C[1][::-1] else "NO")

Submission status: Accepted

Solution code:
a = str(input())
b = str(input())

if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())
print ("YES") if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0] else print ("NO")

Submission status: Accepted

Solution code:
a = input()
b = input()
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A = input()
B = input() 

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

Submission status: Accepted

Solution code:
A = input()
B = input() 
if A == B[::-1]:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
print('YES' if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0] else 'NO')

Submission status: Accepted

Solution code:
c1=input()
c2=input()

if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
ss = input()

if s[0] == ss[-1] and s[1] == ss[1] and s[-1] == ss[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
c1=input()
c2=input()
print('YES' if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0] else 'NO')

Submission status: Accepted

Solution code:
def main():
    g = [input() for _ in range(2)]
    for r in range(2):
        for c in range(3):
            if g[r][c] != g[1 - r][2 - c]:
                print('NO')
                return
    print('YES')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = input()
if s[::-1] == t:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
top = input()
bottom = input()
if top[0] == bottom[2] and top[1] == bottom[1] and top[2] == bottom[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()

if C1[0]==C2[2] and C1[1]==C2[1] and C1[2]==C2[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys
from collections import Counter
from collections import deque
import heapq
import math
import fractions
import bisect
import itertools
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

c=[input() for i in range(2)]
ans="YES"
if c[0][0]!=c[1][2]:
    ans="NO"
if c[0][1]!=c[1][1]:
    ans="NO"
if c[0][2]!=c[1][0]:
    ans="NO"
print(ans)

Submission status: Accepted

Solution code:
C1 = list(str(input()))
C2 = list(str(input()))[::-1]

for i in range(3):
    if not C1[i]==C2[i]:
        print('NO')
        break
else:
    print('YES')

Submission status: Accepted

Solution code:
n = input()
l = input()
ans = True
#print(n[0])
#print(n[])
for i in range(len(n)):
    if i ==0:
        if n[0] == l[-1]:
            continue
        else :
            ans = False
            break
        
    elif n[i] == l[-i-1]:
        continue
    else :
        ans = False
        break
if ans:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A = input()
B = input()
if A[0] == B[2] and A[1] == B[1] and A[2] == B[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s1=input()
    s2=input()
    if s1[0]==s2[2] and s1[1]==s2[1] and s1[2]==s2[0]:
        print('YES')
    else:
        print('NO')
resolve()

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()

if c1[0] == c2[-1] and c1[1] == c2[-2] and c1[2] == c2[-3]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
c1 = input()
c2 = input()
if c2[2] == c1[0] and c1[1] == c2[1] and c1[2] == c2[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
t = t[::-1]
ans = 'NO'
if s == t:
  ans = 'YES'
print(ans)

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()

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

Submission status: Accepted

Solution code:
C = [input().strip() for _ in range(2)]
if C[0][0]==C[1][2] and C[0][1]==C[1][1] and C[0][2]==C[1][0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
def resolve():
  a = input()
  b = input()
  if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
    print('YES')
  else:
    print('NO')
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
s = input()
t = input()
print("YES" if s==t[::-1] else "NO")

Submission status: Accepted

Solution code:
def examA():
    C1 = SI()
    C2 = SI()
    ans = "YES"
    if C1[0]!=C2[2] or C1[1]!=C2[1] or C1[2]!=C2[0]:
        ans = "NO"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    print("YES" if input() == input()[::-1] else "NO")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
c = [input() for _ in range(2)]
print("YES" if c[0]==c[1][::-1] else "NO")

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

s = input()
t = input()[::-1]

if s == t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
T = input()
if S==T[::-1]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
c1=input()
c2=input()
x=''.join(reversed(c1))
if c2==x:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a=input()
b=input()
print("YES") if a[0]==b[2] and a[1]==b[1] and a[2]==b[0] else print("NO")

Submission status: Accepted

Solution code:
a = input()
b = input()
if a[0] == b[-1] and a[1] == b[1] and a[-1] == b[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
first_line = input()
second_line = input()

if (first_line[0] == second_line[2]) and \
   (first_line[1] == second_line[1]) and (first_line[2] == second_line[0]):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input() + input()
print("YES" if s == s[::-1] else "NO")

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
if s1 == s2[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c = input()
s = input()
cl = list(c)
sl = list(s)

cr = list(reversed(cl))

if sl == cr:
    print("YES")

else:
    print("NO")

Submission status: Accepted

Solution code:
a = input()
b = input()
if a == b [::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
t = input()
if s == t[::-1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
c1=input()
c2=input()
if c1==c2[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s=input()
t=input()
b = True
for i in range(3):
  if s[i]!=t[2-i]:
    b=False
if not b:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
print("YES" if input()[::-1] == input() else "NO")

Submission status: Accepted

Solution code:
c_1=input()
c_2=input()
if c_1==c_2[::-1] and c_2==c_1[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a=input()
b=input()
if a[::-1]==b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c = [input() for i in range(2)]
for i in range(3):
    if c[0][i] != c[1][2-i]:
        print("NO")
        exit()
print("YES")

Submission status: Accepted

Solution code:

s1=list(input())
s2=list(input())

print('YES' if s1==s2[::-1] else 'NO')

Submission status: Accepted

Solution code:
S1 = str(input())
S2 = str(input())

if S1[0]==S2[2] and S1[1]==S2[1] and S1[2]==S2[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
print('YES' if c1[::-1] == c2 else 'NO')

Submission status: Accepted

Solution code:
s=input()
t=input()
if s[0]==t[2] and s[1]==t[1] and s[2]==t[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
x = list(input())
y = list(input())
if x[0] == y[2] and x[2] == y[0] and x[1] == y[1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
t = input()
print('YES') if s[0]==t[2] and s[1]==t[1] and s[2]==t[0] else print('NO')

Submission status: Accepted

Solution code:
s1 = [i for i in input()]
s2 = [i for i in input()]
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c1=input()
c2=input()
if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

c1, c2 = [list(readline().decode().rstrip()) for _ in range(2)]
ans = 'YES' if c1 == c2[::-1] and c2 == c1[::-1] else 'NO'
print(ans)

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()

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

Submission status: Accepted

Solution code:
ct = input()
cb = input()

if ct[0] == cb[2] and ct[1] == cb[1] and ct[2] == cb[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a=input()
b=input()
if a == b[::-1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())
c1.reverse()

if c1 == c2:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
c = []
c.append(list(input()))
c.append(list(input()))
if c[0][0] == c[1][2] and c[0][2] == c[1][0] and c[1][1] == c[0][1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
x = list(input())
y = list(input())
if x == list(reversed(y)):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s1 = str(input())
s2 = list(reversed(input()))
s3 = "".join(s2)
if s1 == s3:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b = [input() for i in range(2)]
if a[::-1] == b and b[::-1] == a:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

line_1 = input()
line_2 = input()
line = line_1 + line_2
print('YES' if line == line[::-1] else 'NO')

Submission status: Accepted

Solution code:
c = [list(input()) for _ in range(2)]
if c[0][2] == c[1][0] and c[0][1] == c[1][1] and c[0][0] == c[1][2]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()

if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A =input()
B =input()
if A==B[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
print("YES" if input()[::-1]==input() else "NO")

Submission status: Accepted

Solution code:
S1 = input()
S2 = input()
if S1 == S2[::-1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
t = input()
ok = True
if s[0] != t[2]: ok = False
if s[1] != t[1]: ok = False
if s[2] != t[0]: ok = False
if ok == 1: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
sa = input()
sb = input()
print("YES" if sa[0] == sb[-1] and sa[1] == sb[1] and sa[2] == sb[0] else "NO")

Submission status: Accepted

Solution code:
C = [input() for _ in range(2)]
tmp = C[0] + C[1]
if tmp == tmp[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(['NO', 'YES'][input() == input()[::-1]])

Submission status: Accepted

Solution code:
a=str(input())
b=str(input())
a=list(a)
b=list(b)
if a == b[::-1]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a=input()
b=input()
if b[::-1]==a:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())

print('YES') if (list(reversed(c1)) == c2 and list(reversed(c2)) == c1) else print('NO')

Submission status: Accepted

Solution code:
a=list(input())
b=list(input())

if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
C=[input() for _ in range(2)]
for i in range(3):
    if C[0][i]==C[1][-(i+1)]:
        continue
    else:
        print("NO")
        exit()
print("YES")

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
if c1[::-1]==c2:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
print("YES" if s1 == s2[::-1] and s2 == s1[::-1] else "NO" )

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

l = inputSLs(2)

if l[0][2]==l[1][0] and l[0][1]==l[1][1] and l[0][0]==l[1][2]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
N = list(input())
K = list(input())

if N[0]== K[2] and N[1]==K[1] and N[2]== K[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i): is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
def prime_factor(n):
    """Return a list of prime factorization numbers of n"""
    res = []
    for i in range(2,int(n**0.5)+1):
        while n%i==0: res.append(i); n //= i
    if n != 1: res.append(n)
    return res
## libs ##
from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

def main():
    s = IS()
    t = IS()
    if s == t[::-1]: print('YES')
    else: print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C11C12C13=input()
C21C22C23=input()
if (C11C12C13[0]==C21C22C23[2] and C11C12C13[2]==C21C22C23[0] and C11C12C13[1]==C21C22C23[1]):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())

if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    s = input()
    t = input()
    if s == t[::-1]:
        print('YES')
    else:
        print('NO')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()

ans = 'YES'
for i in range(1, len(C1)+1):
    if C1[i-1] != C2[-i]:
        ans = 'NO'

print(ans)

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
if c1[::-1] == c2:
    print('YES')
else:
    print("NO")

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())
c2.reverse()
if c1 == c2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A =input()
B=input()
if A==B[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
c3 = c1[::-1]
c4 = c2[::-1]
if c1 == c4 and c2 == c3:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
t = input()[::-1]
if s==t:print('YES');exit()
print('NO')

Submission status: Accepted

Solution code:
C=[0,0]
A=[0,0]
C[0]=list(input())
C[1]=list(input())
A[1]=[C[0][-1],C[0][-2],C[0][-3]]
A[0]=[C[1][-1],C[1][-2],C[1][-3]]
print('YES' if A==C else 'NO')

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()

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

Submission status: Accepted

Solution code:
def ABC_77_A():
    C1= input()
    C2 =input()
    
    if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':

    ABC_77_A()

Submission status: Accepted

Solution code:
C = [input() for i in range(2)]

if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0] and C[1][0] == C[0][2] and C[1][1] == C[0][1] and C[1][2] == C[0][0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
C = [input() for _ in range(2)]
if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
C = [input(), input()]
if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
c = [rs() for _ in range(2)]
c2 = [i[::-1] for i in c[::-1]]
print('YES' if c == c2 else 'NO')

Submission status: Accepted

Solution code:
def main():
    c1,c2 = (input() for _ in range(2))
    if c1 == c2[::-1]: print('YES')
    else: print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
	s = [input() for _ in range(2)]
	if s[0] == s[1][::-1]:
		print('YES')
	else:
		print('NO')
resolve()

Submission status: Accepted

Solution code:
c_1=input()
c_2=input()
if c_1[::-1]==c_2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s1=input()
s2=input()
s3=s2[::-1]

if s1==s3:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s1=input()
s2=input()

cnt=0
for i in range(len(s1)):
    if s1[i]==s2[-i-1]:
        cnt+=1

if cnt == 3:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:

c = input()
d = input()

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
if s1 == s2[::-1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a = input()
b = input()

print('YES' if a == b[::-1] else 'NO')

Submission status: Accepted

Solution code:
s=input()
t=input()
if s[0]==t[2] and s[1]==t[1] and s[2]==t[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s=input()
t=input() 
if s==(t[::-1]) and t==(s[::-1]):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys
C1 = input()
C2 = input()
if C1[0] != C2[2]:
    print('NO')
    sys.exit()
else:
    if C1[1] != C2[1]:
        print('NO')
        sys.exit()
    else:
        if C1[2] != C2[0]:
            print('NO')
            sys.exit()
print('YES')

Submission status: Accepted

Solution code:
C = list(input() for i in range(2))
A = C[0]
B = C[1][::-1]

if A == B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
print('YES') if c1[::-1] == c2 else print('NO')

Submission status: Accepted

Solution code:
a = input()
b = input()
print('YES' if a == b[::-1] and b == a[::-1] else 'NO')

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()

if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a = input()
b = input()

if a[0] == b[2] and a[2] == b[0] and a[1] == b[1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

c = input()
d = input()

if c == d[::-1] and d == c[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()[::-1]
print("YES") if s1 == s2 else print("NO")

Submission status: Accepted

Solution code:
print("YNEOS"[input()!=input()[::-1]::2])

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()
if C1 == C2[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
c1=input()
c2=input()
if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s=str(input())
t=str(input())
print("YES" if s[0]==t[2] and s[1]==t[1] and s[2]==t[0] else "NO")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = input()
b = input()

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

s = input()
t = input()
t2 = t[::-1]
if s == t2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()

if C1 == C2[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = input()
b = input()

if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
a=input()
b=input()
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
li1= list(input())
li2= list(input())
if (li1[0]==li2[2])&(li1[1]==li2[1])&(li1[2]==li2[0]):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
l = input()
m = input()
if l == m[::-1]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
line1 = input()
line2 = input()

new_line2 = line2[::-1]

if line1 == new_line2:
  print('YES')
else:
  print('NO')