Section 1.2 Palindromic Squares

枚举并判断回文

{
ID: yaoyuan4
PROG: palsquare
LANG: PASCAL
}
Program palsquare;
type
  num = array[0..1000] of longint;
const
  inf = 'palsquare.in'; outf = 'palsquare.out';
var
  n : longint;
  a, b : num;
Procedure init;
  begin
   assign(input, inf); reset(input);
   readln(n);
   close(input);
   assign(output, outf); rewrite(output);
  end;
Procedure orz(var c : num; d : longint);
  var
   i : longint;
  begin
   fillchar(c, sizeof(c), 0);
   repeat
    inc(c[0]);
    c[c[0]] := d mod n;
    d := d div n;
   until d = 0;
  end;
Procedure ok(c : num; var d : boolean);
  var
   i : longint;
  begin
   d := true;
   for i := 1 to c[0] div 2 do
    if c[i] <> c[c[0]-i+1] then
     begin
      d := false;
      break;
     end;
  end;
Procedure print(a : num);
  var
   i : longint;
  begin
   for i := a[0] downto 1 do
    case a[i] of
     10 : write('A');
     11 : write('B');
     12 : write('C');
     13 : write('D');
     14 : write('E');
     15 : write('F');
     16 : write('G');
     17 : write('H');
     18 : write('I');
     19 : write('J');
    else write(a[i]);
   end;
  end;
Procedure work;
  var
   i : longint;
   flag : boolean;
  begin
   for i := 1 to 300 do
    begin
     orz(b, i*i);
     ok(b, flag);
     if flag then
      begin
       orz(a, i);
       print(a);
       write(' ');
       print(b);
       writeln;
      end;
    end;
   close(output);
  end;
begin
  init;
  work;
end.