1 条题解

  • 0
    @ 2024-12-24 9:59:19

    C :

    #include <stdio.h>
    int main() {
        int f[50] ;
        f[0] = f[1] = 1 ;
        for( int i = 2 ; i < 46 ; i ++ ) {
            f[i] = f[i-1] + f[i-2] ;
        }
        int T ; scanf("%d" , &T ) ;
        while( T -- ) {
            int n ; scanf("%d" , &n ) ;
            printf("%d\n" , f[n] ) ;
        }
        return 0 ;
    }
    
    

    C++ :

    #include<stdio.h>
    
    int f[1000] = {1, 1, 2};
    int main() {
      for( int i = 3; i < 1000; ++i ) f[i] = f[i-1] + f[i-2];
      int t, n;
      scanf("%d", &t);
      while(t--) {
        scanf("%d", &n);
        printf("%d\n", f[n]);
      }
      return 0;
    }
    
    

    Java :

    import java.util.*;
    public class Main {
    	public int n;
    	
    	public int ci=0;
    	int[] A;
    	
    	public Main() {
    		Scanner sc=new Scanner(System.in);
    		int c=sc.nextInt();
    		for(int j=0;j<c;j++) {
    			n=sc.nextInt();
    			if(n<=1) {
    				System.out.println(1);
    				continue;
    			}
    			A=new int[n+1];
    			A[0]=1;A[1]=1;
    			for(int i=2;i<=n;i++) {
    				A[i]=A[i-1]+A[i-2];
    			}
    			System.out.println(A[n]);
    		}
    		
    	}
    
    
    	public static void main(String[] args) {
    		Main main=new Main();
    	}
    
    }
    
    
    • 1

    信息

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