OJ Board

Code: Select all

program p10018(input, output);
var
  s: string;
  i1: byte;
  l: integer;

  n: integer;
  p: longint;
  c: longint;

  x: longint;
  temp: char;
  temp2: integer;

  resitev1: integer;
  resitev2: longint;

function JePalindrom(i: Longint): boolean;
begin
  str(i, s);
  l := length(s);
  JePalindrom := True;
  for i1 := 1 to l div 2 do if s[i1] <> s[l + 1 - i1] then
  begin
    JePalindrom := False;
    Break;
  end;
end;

function Obrni(i: longint): longint;
begin
  str(i, s);
  l := length(s);
  for i1 := 1 to l div 2 do
  begin
    temp := s[i1];
    s[i1] := s[l + 1 - i1];
    s[l + 1 - i1] := temp;
  end;

  Val(s, Obrni, temp2);
end;

procedure Resi(p: longint);
begin
  c := 0;

  x := p;
  repeat

    if JePalindrom(x) then
    begin
      resitev1 := c;
      resitev2 := x;
      Exit;
    end;

    x := x + Obrni(x);
    inc(c);
    
  until false;

end;

begin
  readln(n);
  while n <> 0 do
  begin
    readln(p);
    Resi(p);
    Writeln(resitev1, ' ', resitev2);
    dec(n);
  end;

end.

Code: Select all

while (N) {
  R = R*10+N%10;
  N /= 10;
  }

Code: Select all

#include "stdio.h"
#include "stdlib.h"
#include "string.h"

int IsPalindrome();
void reverse();

char number[11];
unsigned long int num, temp;
int N, i, a;

int main(int argc, char* argv[])
{
	scanf("%d", &N);

	for(i=0; i<N; i++)
	{
		scanf("%lu", &temp);

		for(a=0; !IsPalindrome(); a++)
		{
			reverse();
			temp+=num;
		}
		printf("%d %lu\n", a, temp);
	}

	return 0;
}

int IsPalindrome()
{

	int c, b;
	memset(number, '\0', 13);
	sprintf(number, "%lu", temp);

	for(c=0, b=strlen(number)-1; b>=c; c++, b--)
	{
		if(number[c]!=number[b])
			return 0;
		
	}

	if(a==0)
		return 0;

	return 1;
}

void reverse()
{

	int d, e;
	char aux;

	for(d=0, e=strlen(number)-1; d<e; d++, e--)
	{
		aux=number[d];
		number[d]=number[e];
		number[e]=aux;
	}

	num=atoi(number);


}

Code: Select all

Input
2
2
99

Output
1 4
6 79497

Code: Select all

# include <stdio.h>
int main()
{
	unsigned long num,rev,temp,feng;
	unsigned int i,j,k,count,time;
	scanf("%d",&time);
	for(i=0;i<time;i++)
	{
		scanf("%lu",&num);
		count=0;
		while(1)
		{
			rev=0;
			for(j=1000000000;j>0;j=j/10)
			{
				if(num/j>0)
					break;
			}		
			temp=num;
			k=j;
			while(temp!=0)
			{
				rev=rev+(temp%10)*j;
				temp=temp/10;
				j=j/10;
			}
			if(rev==num)
			{
				printf("%d %lu\n",count,num);
				break;
			}
			else
			{
				feng=num;
				count++;
				while(num!=0)
				{
					feng=feng+(num%10)*k;
					num=num/10;
					k=k/10;
				}
				num=feng;
			}
		}
	}
	return 0;
}