The next palindrome

[dhyan]

include

int a,i;
unsigned long int b,j,k;

unsigned long int reverse(unsigned long int x,int y);

int main()
{
scanf("%d",&a);
for(i=0;i {
scanf("%lu",&b);

	for(j=b+1;;j++)
	{
		k=reverse(j,0);

		if(k==j)
		{
			printf("%lu",k);
			break;
		}
		else
		continue;
	}
	printf("\n");
}
return 0;

}

unsigned long int reverse(unsigned long int x,int y)
{
static unsigned long int r1=0,ra=0;
int b;
if(x%10!=0)
{
b=x%10;
x=x/10;
y+=b;
y*=10;
r1=y;
ra=reverse(x,y);

}
return (r1/10);

}

Please, can anyone tell me where i am wrong?

[leppyr64]

What's the largest possible value in the input? Does it fit in the datatype that you have chosen?

[dhyan]

Thanks for the reply,

No,It's taking a lot of time.
Thanks again.
I'll try another way.

[dhyan]

The following code is running in my pc...

But spoj finds it wrong..
please help..

#include<stdio.h>
#include<stdlib.h>
int b,i,j;
unsigned long a,k,l;
int string_length(char*);
void reverse(char*);
main()
{
 scanf("%d",&b);
 for(j=0;j<b;j++)
 {
  scanf("%lu",&a);
  if(a>1000000||a<=0)
  exit(0);
  for(k=(a+1);;k++)
  {
   l=k;
   for(i=0;i<10;i++)
   {
    l=l/10;
    if(l==0)
    break;
    }
   i=i+1;
   char arr[i];
   sprintf(arr,"%lu",k);
   reverse(arr);
   sscanf(arr,"%lu",&l);
   if(l==k)
   break;
  }
  printf("%d\n",k);
  }
  printf("\n");
 return 0;
 }
void reverse(char *string) 
{
   int length, c;
   char *begin, *end, temp;
   length = string_length(string);
   begin = string;
   end = string;
   for ( c = 0 ; c < ( length - 1 ) ; c++ )
      end++;
   for ( c = 0 ; c < length/2 ; c++ ) 
   {        
      temp = *end;
      *end = *begin;
      *begin = temp;
      begin++;
      end--;
   }
}
int string_length(char *pointer)
{
   int c = 0;
   while( *(pointer+c) != '\0' )
      c++;
   return c;
}

[leppyr64]

Why are you doing this?

if(a>1000000||a<=0)
exit(0);

[dhyan]

So that range can be maintained between(0-1000000)

[leppyr64]

Read the problem statement. That's not what it says

Even if the problem stated that range you don't need to verify it. If a problem states constraints on the input then you can assume that the data matches it (in the odd case that it doesn't there will be plenty of comments stating otherwise)

[dhyan]

Ok,Thanks.
I got it.