1 条题解

  • 0
    @ 2025-4-7 21:28:47

    C :

    
    #include<stdio.h>
    int main()
    {
    //	int a=0,b=1;
    	int f[40];
    	f[1]=1;
    	f[0]=1;
    	for(int i=2;i<40;i++)
    	{
            f[i]=f[i-1]+f[i-2];
    	}
    	for(int j=0;j<40;j++)
    		printf("%d ",f[j]);
    	printf("\n");
    	return 0;
    }
    

    C++ :

    #include <stdio.h>
    #include <math.h>
    int main() {
    	int i, a, b, t;
    	a = 1; b = 1;
    	for (i = 1;i <= 40;i++) {
    		printf("%d ", a);
    		t = a + b;
    		a = b;
    		b = t;
    	}
    	return 0;
    }
    
    

    Pascal :

    var
      i:longint;
      a:array[1..40] of longint; 
    begin
      a[1]:=1;
      a[2]:=1;
      for i:=3 to 40 do
      a[i]:=a[i-1]+a[i-2];
      for i:=1 to 40 do
      write(a[i],' ');
    end.
    
    

    Java :

    public class Main{
    	public static void main(String[] args) {
    		int a=1,b=1,c;
    		System.out.print (a+" "+b+" ");
    		for(int i=1;i<=38;i++){
    			c=a+b;
    			a=b;
    			b=c;
    			System.out.print (c+" ");
    		}
    	}
    }
    

    Python :

    fibs = [1, 1]
    for i in xrange(38):
      fibs.append(fibs[-1]+fibs[-2])
    print ' '.join(str(x) for x in fibs),''
    
    • 1

    信息

    ID
    1270
    时间
    1000ms
    内存
    32MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者