Question

【急】pascal递归1+2+3+N……求高手解答

Answer 1

这道题其实不用递归也行的，用循环1 to n do就行了，如果用递归算法做的话，参考程序如下：
var n:longint;
function lj(m:longint):longint;
begin
if m=n then lj:=n else lj:=lj(m+1);
end;
begin
read(n);
writeln(lj(1));
end.

Answer 2

var n,s:longint;

function sum(x:longint):longint;

begin
if x=1 then exit(1) else exit(sum(x-1)+x);
end;

begin
readln(n);
s:=sum(n);
writeln(s);
end.

Answer 3

var n,t:longint;
function fct(n:longint;) : longint;
begin
if n<>1 then fct(n):=fct(n-1)+n else fct(n):=1;
end;
begin
readln(n);
writeln(fct(n));
end.