数组
** xdoj–回文数**
#include<stdio.h>
int main()
{
int n, i, sum = 0;
scanf("%d",&n);
int a[10] = {0};
for(i=0;n!=0;i++)
{
a[i]=n%10;
sum += a[i];
n /= 10;
}
int t = i;
for(i=0;i<=t/2;i++)
{
if(a[i] != a[t-1-i])
{
printf("no");
break;
}
}
if(i==1+t/2)
printf("%d",sum);
return 0;
}