CF863A.Quasi-palindrome

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```

首页