4 条题解

  • 0
    @ 2026-10-11 16:31:04

    #include<stdio.h> int main(){ int n; int a=1,b=1; int i,m; scanf("%d",&n); if(n>2){for(i=0;i<n-2;i++){ m=a+b; a=b; b=m;} printf("%d",m);} else{printf("%d",1);}

    }

    • 0
      @ 2026-9-23 17:00:02

      #include using namespace std; int main() { int arr[20] = {1,1,2}; for (int i = 0;i < 18;i++) { arr[i + 2] = arr[i] + arr[i + 1]; } int n = 0; cin >> n; cout << arr[n - 1] << endl; return 0; }

      • 0
        @ 2025-10-17 21:10:20
        #include <stdio.h>
        int main() {
            int n;
            int fib[20] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765};
            scanf("%d", &n);
            printf("%d\n", fib[n-1]);
             return 0;
        }
        • 0
          @ 2025-10-15 21:41:11

          #include<stdio.h> int main(){ int n; scanf("%d",&n); if(n1||n2){ printf("1\n"); return 0; } int a=1,b=1,c; for(int i=3;i<=n;i++){ c=a+b; a=b; b=c; } printf("%d",c); return 0; }

          • 1

          信息

          ID
          230
          时间
          1000ms
          内存
          256MiB
          难度
          4
          标签
          递交数
          879
          已通过
          391
          上传者