递归练习

递归练习-兔子繁殖 

AYYZOJ p1411

program rabit;
  var  n,p:longint;
function fib(m:longint):longint;
  begin
   if m=0 then fib:=0
          else if m=1 then fib:=1
                   else fib:=fib(m-1)+fib(m-2);
  end;
begin
 readln(n);
   p:=fib(n);
   writeln(p)
end.

program p1411;
var
 n,i,x,y,z:longint;
begin
 readln(n);
  x:=0;y:=1;
  if n=1 then writeln(1) else begin
  for i:=2 to n do
   begin
    z:=x+y;
    x:=y; y:=z;
   end;
 writeln(z); end;
end.

递归练习-杨辉三角

AYYZOJ p1412

var
  n:integer;
  a:array[1..20,1..20] of longint;
procedure print(i,j:integer);
  begin
    if j=1 then begin a[i,1]:=1;write(1);exit;end;
    print(i,j-1);
    a[i,j]:=a[i-1,j]+a[i-1,j-1];
    write(' ',a[i,j]);
  end;
procedure yh(n:integer);
  var i:integer;
  begin
    if n=1 then begin a[1,1]:=1; writeln(a[1,1]);exit;end;
    yh(n-1);
    print(n,n-1);
    a[n,n]:=1;
    writeln(' ',1);
  end;

begin
  readln(n);
  yh(n);
end.

program p1412;
type arr=array[1..20,1..20] of longint;
var
 n:integer;
 f:arr;
procedure YHSJ(x:integer);
var
 i,j:integer;
begin
 for i:=1 to x do
 begin
  for j:=1 to i do
   begin
    if (j=1) or (j=i) then f[i,j]:=1
    else f[i,j]:=f[i-1,j]+f[i-1,j-1];
    write(f[i,j],' ');
   end;
  writeln;
 end;
end;
begin
 readln(n);
 YHSJ(n);
end.

递归练习-进制转换

AYYZOJ p1414

var
 m:integer;
procedure tran(n:integer);
var k:integer;
begin
 k:=n mod 8;
 n:=n div 8;
 if n<>0 then tran(n);
 write(k);
end;
begin
 read(m);
 tran(m);
end.

program p1414;
var
 n,h:integer;
procedure turndata(n,a:integer);
var
 x:array[1..16] of integer;
 i,j,k,h:integer;
begin
 if n<0 then writeln('-');
 j:=abs(n);
 k:=0;
 repeat
  inc(k);
  i:=j mod a;
  j:=j div a;
  x[k]:=i;
 until j=0;
 for h:=k downto 1 do
  if x[h]<10 then write(x[h])
   //else write(chr(55+x[h]));
end;
begin
 readln(n);
 turndata(n,8);
end.