杭州交通信息网县总体规划 纲要:5 用数组求取Fibonacci数列的前40项，并在最后一起输出
来源：百度文库 编辑：杭州交通信息网 时间：2024/05/14 03:14:15
Basic:
Dim arr(39),s$
Arr(0)=1
Arr(1)=1
For a=2 to 39
Arr(a)=Arr(a-1)+Arr(a-2)
next
s$=""
For a=0 to 39
s$=s$ & Arr(a)
Next
Print s$
End
-------------
Pascal:
Var a:byte;Arr:array[1..40] of longint;
begin
arr[1]:=1;
arr[2]:=2;
for a:=3 to 40 do arr[a]:=arr[a-1]+arr[a-2];
For a:=1 to 40 do Write(arr[a],' ');
end.
---------
Asm:
Arr Dd 40 dup (1)
Start:
mov ax,0
....
;不会了
end start
语言？C#的是:
ArrayList array = new ArrayList();
array.Add(1);
array.Add(2);
for(int i = 2; i < 40; i++)
{
array.Add(array[i-2] + array[i-1]);
}
foreach(object obj in array)
{
console.Write(obj.ToString());
}
main()
{
int i;
int a[40];
a[0] = 1;
a[1] = 1;
for (i=2;i<40;i++)
{
a[i] = a[i-1]+a[i-2];
}
for (i=0;i<40;i++)
{
printf("%d ",a[i]);
}
return 0;
}