戰魂 2011-11-02 17:54:00
点我顶贴
收藏
删除
var(递推)
i,n:longint;
a:array[1..1000] of longint;
begin
read(n);
a[1]:=1;a[2]:=2;
for i:=3 to n do
begin
if i mod 2<>0 then a[i]:=a[i-1]
else a[i]:=a[i-1]+a[i div 2];
end;
write(a[n]);
end.
本文用了递推的思想!!!!!!!!!!!!!