Find the number of palindrome between 1o~1000

A number is not a palindrome number, first separating its numbers, using an array A to store, and then compare the corresponding numbers. To this end, the introduction of a symbol variable flag, the value of 1 is a palindrome number, 0 is not a palindrome number.

The procedure is as follows:

／*程序8—1S，求lO~1000之间的回文数*／
main()
{int i，X；
int a[8]，j；
int b，e；
int flag;
for(i=10; i<1000l i++)
{j=O；x=i;／*将数字分离，用一数组存放*／
while(x>O)
{a[j]=x％10;
x／=1O；
j++；
}
flag=1；／*先假定i为完数*／
b=0;e=j一1；
while(b<e&&flag)／*判断i是否为完数*／
if(a[b]!=a[e])flag=0；
else{b++；e--；}

tf(flag)printf(”％6d”，i)；
}
}