奥赛讲议：递归2.docVIP

4、将5个大小不等的盘子从位置1移到位置3（可以借助位置2），每次只能移动1个盘子，且大盘子不能压在小盘子上面，问如何移法？（用递归过程完成） 1 2 3 5、上楼梯问题 一个n层的台阶（1=n=100） program lx1; procedure f(x:real,n:integer):real; begin if n=1 then f:=sqrt(1+x) else f:=sqrt(n+f(x,n-1)) end; begin writeln(f(3.1,15); end. 2.program lx2; Procedure f(x:real,n:integer):real; Begin If n=1 then f:=x/(1+x) Else f:=x/(n+f(x,n-1)); End; Begin Writeln(f(3.57,20); End. 3、program lx3; procedure fb(n:integer):longint; var begin if n=1 then fb:=0 else if n=2 then fb:=1 else fb:=fb(n-1)+fb(n-2) end begin writeln(fb(10); writeln(fb(20); end. 4、Program Hanoi; Var total:integer; Procedure move(n,a,b,c:integer); Begin If n=1 then write(a,’(’,b) Else begin Move(n-1,a,c,b); Writeln(a,’(’,c); Move(n-1,b,a,c); End; End; Begin Read(total); Move(total,1,2,3); End. 5、 Program taijie; Var way:array[byte] of byte; Total,nnteger; Procedure print(s:byte); Var i:byte; Begin For i:=1 to s do write(way[i],’ ‘); Writeln; Total:=total+1; End; Procedure search(s,n:byte); Begin If n=0 then print(s) Else begin Way[s+1]:=1; Search(s+1,n-1); If n1 then Begin Way[s+1]:=2; Search(s+1,n-2); End; End; End; Begin Write(‘step:’); Readln(n); Total:=0; Search(0,n); Writeln(‘total=’,total); End.