上午-5
2025-07-18 11:03:59
发布于:河北
Palindrome Number Check Function

#include <iostream>
using namespace std;
bool is_pal(int n) {
// reversed number t, if t == n, then it's a palindrome
int nn = n, t = 0; // nn is a copy of n
while (nn > 0) {
t = t * 10 + nn % 10;
nn /= 10;
}
return t == n; // simplified return statement
}
int main() {
int n;
cin >> n;
cout << (is_pal(n) ? "Yes" : "No") << endl;
return 0;
}
这里空空如也








有帮助,赞一个