自己写的,有点复杂。。。。能运行,但是不一定能过OJ
#include<stdio.h>
#include<math.h>
int judge(int n)
{
int a[10];
int b=1;
int k;
int count=0;
for(b=1;;b++)
{
if(n==0)
break;
else
{
a[b]=n%10;
n=n/10;
}
}
k=b-1;
if(k%2==0)
{
for(b=1;b<=k/2;b++)
{
if(a[b]==a[k+1-b])
count++;
}
if(count==k/2)
return 1;
}
if(k%2==1)
{
for(b=1;b<=(k+1)/2;b++)
{
if(a[b]==a[k+1-b])
count++;
}
if(count==(k+1)/2)
return 1;
else
{
return 0;
}
}
}
int main()
{
int m,n;
int i;
scanf("%d %d",&m,&n);
for(i=m;i<=n;i++)
{
if(judge(i)==0)
{
}
else if(judge(i)==1)
printf("%d ",i);
}
}