题库练习 Quasi-palindrome
← 上一题 下一题 →

A11223 | Quasi-palindrome

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Let quasi-palindromic number be such number that adding some leading zeros (possible none) to it produces a palindromic string.

String $t$ is called a palindrome, if it reads the same from left to right and from right to left.

For example, numbers $131$ and $2010200$ are quasi-palindromic, they can be transformed to strings " $131$ " and " $002010200$ ", respectively, which are palindromes.

You are given some integer number $x$ . Check if it's a quasi-palindromic number.

输入格式

The first line contains one integer number $x$ ( $1<=x<=10^{9}$ ). This number is given without any leading zeroes.

输出格式

Print "YES" if number $x$ is quasi-palindromic. Otherwise, print "NO" (without quotes).

输入输出样例

输入 #1
131
输出 #1
YES
输入 #2
320
输出 #2
NO
输入 #3
2010200
输出 #3
YES
C++ 编辑器
输入
输出