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.
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++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted