Problem:


Score : 100 points

Problem Statement

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.

Constraints

100≤N≤999

N is an integer.

Input

Input is given from Standard Input in the following format:  

N

Output

If N is a palindromic number, print Yes; otherwise, print No.

Sample Input 1

575

Sample Output 1

Yes

N=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.

Sample Input 2

123

Sample Output 2

No

N=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.

Sample Input 3

812

Sample Output 3

No



Sample input:
575


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
a = input()
b = ""
for i in range(len(a)):
    b += a[i]
if a == b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = input()
if a[1] == a[2]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
#ABC070A
a = input().split()
print("Yes" if a[-1] == a[0] else "No")

Submission status: Wrong Answer

Solution code:

url = "https://atcoder.jp//contests/abc070/tasks/abc070_a"

def main():
    x = input()
    if x == reversed(x):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
K = input()
print("YES" if K[0] == K[2] else "No")

Submission status: Wrong Answer

Solution code:
K = list(input())
print("YES" if K[0] == K[2] else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()

n = list(n)
t = list(n)
n.reverse()

if n == t:
  print("yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a = input()
b = reversed(a)
print("Yes" if a == b else "No")

Submission status: Wrong Answer

Solution code:
a = input()
print("Yes" if a == reversed(a) else "No")

Submission status: Wrong Answer

Solution code:
s=input()
print('Yes' if s[0]==s[1]==s[2] else 'No')

Submission status: Wrong Answer

Solution code:
a=str(input())
aa =sorted(a,reverse =True)
print("Yes" if a==aa else "No")

Submission status: Wrong Answer

Solution code:
n = str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

if s[0] == s[-1]:
    print('Yes')
else:
    print('No0')

Submission status: Wrong Answer

Solution code:
n = input()
print("Yes" if n == reversed(n) else "No")

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
print('YNeos'[s!=reversed(s)::2])

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
print('YNEOS'[s==reversed(s)::2])

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
print('YNEOS'[s!=reversed(s)::2])

Submission status: Wrong Answer

Solution code:
n = input()
if n[0] == n[2]:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
N = input().split()
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
if(N%100 == N%1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input()
print("YES" if a==c else "NO")

Submission status: Wrong Answer

Solution code:
a,b,c=input()
print('YES' if a==c else 'NO')

Submission status: Wrong Answer

Solution code:
n = input()
flag = True
for i in range(len(n)//2):
    if n[i] != n[-1*(i+1)]:
        flag = False
if flag:
    print("Yes")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = list(input())
print(x)
y = list(reversed(x))
print(y)
if x == y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
x = list(input().split())
if x == x.reverse():
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
x = list(input().split())
if x == reversed(x):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = list(input())
s_rev = reversed(s)
if s == s_rev:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input();print(s==s[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = str(input())
if n[0]==n[2]:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
N=input()
if N[0]==N[2]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
N=input()

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

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
num = int(input())
lst = []
while num > 0:
    lst.append(num%10)
    num //= 10
lst2 = lst
lst2.reverse()
if lst == lst2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
num = int(input())
lst = []
while num > 0:
    lst.append(num%10)
    num //= 10
lst2 = lst.reverse()
if lst == lst2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = input()
print('Yes' if reversed(N) == N else 'No')

Submission status: Wrong Answer

Solution code:
n = input().strip()

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

Submission status: Wrong Answer

Solution code:
a, b, c = input()
if a == c:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()

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

Submission status: Wrong Answer

Solution code:
N=str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


YES = "Yes"  # type: str
NO = "No"  # type: str


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))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
print("yes" if a[0]==a[2] else "no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = list(input())
if l.reverse() == l:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n=input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = input()
ans = "Yes" if N == reversed(N) else "No"
print(ans)

Submission status: Wrong Answer

Solution code:
n = input()

print("".join(list(reversed(n))))

Submission status: Wrong Answer

Solution code:
a,b,c=input()
print("yes" if a==c else "No")

Submission status: Wrong Answer

Solution code:
n = input()
if n[0]==n[2] and n[0]!=n[1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input()

S_1 = S[-3]
S_2 = S[-2]
S_3 = S[-1]

if S == ((S_1) + (S_2) + (S_3)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

n = stdin.readline().rstrip()
print('Yes' if n == reversed(n) else 'No')

Submission status: Wrong Answer

Solution code:
def palindromic_number():
    n = input()
    n_reversed = ''.join(list(reversed(n)))
    print(n_reversed)
    if n == n_reversed:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    palindromic_number()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = list(input())
if N == N.reverse():
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
if n / 100 == n % 10:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    n = input()
    print("Yes" if reversed(n) == n else "No")


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:






def main():
	n = int(input())
	c1 = n % 10
	c2 = n // 10 % 10
	c3 = n // 100
	if c1 == c3:
		print("Yes")
	else:
		print("No")
	print(c1, c2, c3)





if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:






def main():
	n = int(input())
	c1 = n % 10
	c2 = n / 10 % 10
	c3 = n / 100
	if c1 == c3:
		print("Yes")
	else:
		print("No")






if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
n_str = input()
n_list = list(n_str)
if n_list == n_list.reverse():
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n_str = input()
n_list = list(n_str)
n_list_reverse = n_list
n_list_reverse.reverse()
if n_list == n_list_reverse:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
n = list(input())
m = n.reverse()
print('Yes' if n == m else 'No')

Submission status: Wrong Answer

Solution code:
N = input()

if N[0] == N[2]:print("yes")
else:print("no")

Submission status: Wrong Answer

Solution code:
print("Yes" if int(input()) % 101 % 10 == 0 else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input();print('YNeos'[a!=b::2])

Submission status: Wrong Answer

Solution code:
n = str(input())
if int(n[2]+n[1]+n[0]) == int(n):
  print('Yes')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
l = input()
if l == l[:-1]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input();print("No" if(s[0]!=s[2] or s[0]>=s[1]) else "Yes")

Submission status: Wrong Answer

Solution code:
n = str(input())
m = n[::-1]
if n == m:
  print("Yes")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input()
print('yes' if a==c else 'no')

Submission status: Wrong Answer

Solution code:
num=input()

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

Submission status: Wrong Answer

Solution code:
import math

num=int(input())

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

Submission status: Wrong Answer

Solution code:
num=int(input())

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

Submission status: Wrong Answer

Solution code:
num=int(input())

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

Submission status: Wrong Answer

Solution code:
num=int(input())

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

Submission status: Wrong Answer

Solution code:
n = input()
if n[0] == n[2]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
n = int(input())

b = n // 100

c = n % 10

if b == c:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=input()
print('Yes' if n[0]==n[2] else 'no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = list(input())
a = N.reverse()
if a == N:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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")

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
n = input()

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

Submission status: Wrong Answer

Solution code:
n = input()

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

Submission status: Wrong Answer

Solution code:
n = list(input())
s = n.copy()
print("Yes" if n==s.reverse() else "No")

Submission status: Wrong Answer

Solution code:
N = input()
if N[0] == N[1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
print("YES" if s[0]==s[2] else "No")

Submission status: Wrong Answer

Solution code:
s=str(input())
print("YES" if s[0]==s[2] else "No")

Submission status: Wrong Answer

Solution code:
N = list(input())
M = N.sort()
if N == M :
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
n = input()
print("Yes" if n[0] == n[2] else "no")

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
s = input()
if s[0] == s[1]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

n = list(input())
m = n
m.reverse()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
print("yes" if [a == c for a, b, c in zip(*[[int(i)] for i in input()])].count(True) == 1 else "no")

Submission status: Wrong Answer

Solution code:
n = input()

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

Submission status: Wrong Answer

Solution code:
n=int(input())
print("Yes") if int(n/100)==n%19 else print("No")

Submission status: Wrong Answer

Solution code:
a = input()
s = 0
for i in range(len(a)//2):
    if a[i] != a[(-1)*i]: s = 1
if s == 1:print("No")
else:print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

Solution code:
n = input()
a = int(int(n)/100);
c = int(n)%10;
if a == c:
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
A = input()

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

Submission status: Wrong Answer

Solution code:
s=input();print('YNeos'[s!=s[::-1]])

Submission status: Wrong Answer

Solution code:
N = input()
if len(N) == len(set(N)):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
n=input()
print(n[::-1])

Submission status: Wrong Answer

Solution code:
N=list(input())
print(N)
flag=1
for i in range(len(N)):
    if N[i]!=N[-i-1]:
        flag=0
print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
#coding:utf-8
n=str(input())
if(n[0]==n[1]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = input()

top = N[0]
bottom = N[2]

if top == bottom:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N = input()
if int(N) == int(N[-1]):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=(input())
if N[0]==N[2]:
    print ('YES')
else:
    print ('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()
if(N[0]==N[1]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = input()
m =len(n) // 2

for i in range(m):
  if n[i] == n[m]:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = input()
import sys
for i in range(len(n)-1):
    if n[i] != n[i+1]:
        print('No')
        sys.exit(0)

print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
if s == reversed(s):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
str = input()
print(str == str[-1::-1])

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Here your code !
import sys
a=input()
if a==a[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
N = input()
if N[0] == N[2]:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
N = str(input())
if N == N[-1::]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = list(input())
rev_a = a
rev_a.reverse()
if a == rev_a:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = input()
rev_a = reversed(a)

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

Submission status: Wrong Answer

Solution code:
num=list(raw_input())
#print num
#print num[::-1]
if num==num[::-1]:
    print "YES"
else:
    print "NO"

Submission status: Wrong Answer

Solution code:
N=input()
N[0]==N[-1]

Submission status: Wrong Answer

Solution code:
# coding: utf-8
kaibun = str(input())
print(kaibun)
print(kaibun[::-1])
if kaibun == kaibun[::-1]:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
kaibun = str(input())
print(kaibun)
print(kaibun[::-1])
if kaibun == kaibun[::-1]:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print('Yes')

Submission status: Wrong Answer

Solution code:
n = input()
if(n[0] == n[2]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n = input()
if(n[0]==n[2]):
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
N=input()
if N==N[::-1]:
 print('yes')
else:
 print('no')

Submission status: Wrong Answer

Solution code:
x=input()
y=list(x)
if y[0]==y[2]:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,_,b=input()
if a==b:
  print("YES")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = str(input())
start = 0
end = len(N) - 1
result = True

while start < end: 
    if N[start] == N[end]: 
        start += 1
        end -= 1
    else:
        result = False
        break
print(result)

Submission status: Wrong Answer

Solution code:
N=input()
a=list(N)
n=len(a)
count=1
for i in range(n):
 if(a[i]!=a[n-1-i]):
  count=0
 
if(count==1):
 print("Yes")
else:
 print("N0")

Submission status: Wrong Answer

Solution code:
N = int(raw_input('Choose a number: '))

firstD = N / 100
lastD = N % 10
if firstD == lastD:
	print 'Yes'
else:
	print 'No'

Submission status: Wrong Answer

Solution code:
N = int(raw_input('Choose a number: '))

firstD = N / 100
lastD = N % 10
if firstD == lastD:
	print 'yes'
else:
	print 'no'

Submission status: Wrong Answer

Solution code:
N = int(raw_input('Choose a number: '))

firstD = N / 100
lastD = N % 10
if firstD == lastD:
	print "yes"
else:
	print "no"

Submission status: Wrong Answer

Solution code:
n = int(input())
if (n//10//10) == (n%10%10):
    print('Yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
import sys

N = int(sys.stdin.readline())

firstD = N / 100
lastD = N % 10
if firstD == lastD:
	print "yes"
else:
	print "no"

Submission status: Wrong Answer

Solution code:
import sys

# sys.stdin = open('a1.in')


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()

Submission status: Wrong Answer

Solution code:
n = int(input())
if (n//100) == (n%100):
    print('Yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
a = input()
i = 0
n = 1
time = len(a)
ans = "Yes"
while i < time:
    if a[i] == a[-n]:
        pass
    else:
        ans = "No"
    i += 1
    n -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = list(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
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()

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
N = len(S)

for i in range(N // 2):
    if S[i] != S[-i - 1]:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
x = int("".join(s))
y = int("".join(s[::-1]))
if x == y:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = input()
print('Yes' if N == N[::-1] else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().strip()
if int(N)==int(N[::-1]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
if s[0] == s[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = input()
b = ""
for i in range(len(a)):
    b += a[len(a) - i - 1]
if a == b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())
m = list(reversed(n))
if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())
if N[0] == N[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
if N[0]==N[-1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print(["No", "Yes"][s == s[::-1]])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
if a == a[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
print('Yes' if N[0] == N[2] else 'No')

Submission status: Accepted

Solution code:
S=input()
if S==S[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
a = input()
if a[0] == a[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = int(input())
if N//100==N%10:
    print('Yes')
else:
    print('No')