CF 863A - Quasi-palindrome

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.
Input

The first line contains one integer number x (1 ≤ x ≤ 109). This number is given without any leading zeroes.
Output

Print “YES” if number x is quasi-palindromic. Otherwise, print “NO” (without quotes).
Examples
Input

131

Output

YES

Input

320

Output

NO

Input

2010200

Output

YES

思路：
每次得到一个数先把右边的零全部去掉，让后判断是否是回文。

代码：

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int main(){
    long long N;
    while(cin>>N){
        if(N<10){
            printf("YES\n");
            break;
        }
        while(N>=10 && N%10 == 0)N /= 10;
        long long sum = 0;
        long long T = N;
        while(T){
            sum  = sum*10 + T%10;
            T /= 10;
        }
        if(sum == N)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}