#include<bits/stdc++.h> using namespace std; int n; int is_pal(int a) { int s=0; while(a) { s=s*10+a%10; a/=10; } return s; } int main() { cin>>n; if(is_pal(n)==n) cout << "Yes" << endl; else cout << "No" << endl; return 0; }

#include<iostream> using namespace std; bool is_pal(int n){ int x=0,p=n; while(p!=0){ x=x*10+p%10; p=p/10; } if(x==n){ return true; }else{ return false; } } int main() { int n; cin >> n; if(is_pal(n)) cout << "Yes" << endl; else cout << "No" << endl; return 0; }

#include<cstdio> #include<iostream> #include<cmath> using namespace std; int n[114514]; int hw(int a){ int b,a1; a1=a; while(a1){ b+=a1%10; a1/=10; b*=10; } b/=10; if(b==a)return 1; else return 0; } int main(){ int a; cin>>a; if(hw(a)==1)cout<<"Yes"; else cout<<"No"; return 0; }

#include<iostream> using namespace std; // 完成回文数判定 is_pal 函数 bool is_pal(int n) { int m=n; int ans=0; while(m>0) { ans=ans*10+m%10; m/=10; } if(ans==n) return true; return false; } int main() { return 0; }

#include<bits/stdc++.h> using namespace std; bool is_pal(int x){ string s = to_string(x); string rev_s = s; reverse(s.begin(),s.end()); return rev_s == s; } int main() { int n; cin >> n; if(is_pal(n)) cout << "Yes" << endl; else cout << "No" << endl; return 0; }

简单 难 > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > >