判断回文数

#include <iostream>
using namespace std;

int IsPalindrome(int iNumber)
{
	int temp[10];
	int i=0;
	int rst=1;
	do 
	{
		temp[i++]=iNumber%10;
		iNumber=iNumber/10;
	} while (iNumber!=0);
	i--;
	for (int j=0;j<=i;j++)
	{
		if (temp[j]!=temp[i])
		{
			rst=0;
		}
		i--;
	}
	return rst;
}

int main()
{
	int IsPalindrome(int iNumber);
	int x;
	cin>>x;
	cout<<IsPalindrome(x)<<endl;
	return 0;
}