1 solutions

  • 0
    @ 2025-11-5 15:10:23

    C :

    #include<stdio.h>
    int  dp[42];
    int main()
    {
        int n,m;
        int jisuan(int );
        scanf("%d",&n);
        while(n--)
        {
            scanf("%d",&m);
            printf("%d\n",jisuan(m));
        }
    }
    int jisuan(int m)
    {
        int i;
        dp[2]=3;
        dp[3]=5;
        for(i=4; i<42; i++)
            dp[i]=dp[i-1]+dp[i-2];
        return dp[m];
    }
    
    

    C++ :

    #include<cstdio>
    #include<cstring>
    int dp[102][2];
    int main()
    {
        int i, j, n, m;
        dp[1][0] = dp[1][1] = 1;
        for(i = 2; i <= 40; i++){
            dp[i][0] = dp[i-1][0] + dp[i-1][1];
            dp[i][1] = dp[i-1][0];
        }
        scanf("%d", &n);
        while(n--)
        {
            scanf("%d", &m);
            printf("%d\n", dp[m][0]+dp[m][1]);
        }
        return 0;
    }
    
    
    • 1

    Information

    ID
    16473
    Time
    1000ms
    Memory
    64MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By