/**
判断回文数
**/
#include<stdio.h>
int isCircle(int n);
int reverse(int m);
int main()
{
int n;
printf("please input a number: \n");
scanf("%d",&n);
if(isCircle(n))
{
printf("%d is a palindrome\n",n);
}
else
{
printf("%d is not a palindrome\n",n);
}
return 1;
}
int isCircle(int n)
{
if(n == reverse(n))
{
return 1;
}
else
return 0;
}
/*
求m的倒置数，如reverse(123)得321
*/
int reverse(int m)
{
int x = m,y = 0;
while(x)
{
y = x%10 + y*10;
x = x/10;
}
return y;
}
