8 solutions

  • 2
    @ 2026-6-14 15:59:31
    点赞的是彭于晏
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        long long a=1,b=1,c=1;
        int n;
        cin>>n;
        for (int i=3;i<=n;i++)
    	{
    	    c=a+b;
    		a=b;
    		b=c;	
    	}
    	cout<<c;
        return 0;
    }
    
    • 1
      @ 2026-8-11 13:46:13
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          int a,b,c;
      	a=1,b=1,c=1;
      	int k;
      	cin>>k;
      	for(int i=3;i<=k;i++)
      	{
      		c=a+b;
      		a=b;
      		b=c;
      	}
      	cout<<c;
      	return 0; 
      }
      
      • 0
        @ 2025-2-22 11:33:50
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
        int a=1,b=1,c=1;
        int n;
        cin>>n;
        for(int i=3;i<=n;i++)
        {
        	c=a+b;
        	a=b;
        	b=c;
         } 
         cout<<c;
        return 0;
        }
        
        • -1
          @ 2026-8-5 12:00:43
          第二种做法(容易手废)点赞的是彭于晏
          #include<bits/stdc++.h>
          using namespace std;
          int main()
          {
              long long a;
              cin>>a;
              if(a==1){
              	cout<<1;
          	}
          	else if(a==2){
          		cout<<1;
          	}
          	else if(a==3){
          		cout<<2;
          	}
          	else if(a==4){
          		cout<<3;
          	}
          	else if(a==5){
          		cout<<5;
          	}
          	else if(a==6){
          		cout<<8;
          	}
          	else if(a==7){
          		cout<<13;
          	}
          	else if(a==8){
          		cout<<21;
          	}
          	else if(a==9){
          		cout<<34;
          	}
          	else if(a==10){
          		cout<<55;
          	}
          	else if(a==11){
          		cout<<89;
          	}
          	else if(a==12){
          		cout<<144;
          	}
          	else if(a==13){
          		cout<<233;
          	}
          	else if(a==14){
          		cout<<377;
          	}
          	else if(a==15){
          		cout<<610;
          	}
          	else if(a==16){
          		cout<<987;
          	}
          	else if(a==17){
          		cout<<1597;
          	}
          	else if(a==18){
          		cout<<2584;
          	}
          	else if(a==19){
          		cout<<4181;
          	}
          	else if(a==20){
          		cout<<6765;
          	}
          	else if(a==21){
          		cout<<10946;
          	}
          	else if(a==22){
          		cout<<17711;
          	}
          	else if(a==23){
          		cout<<28657;
          	}
          	else if(a==24){
          		cout<<46368;
          	}
          	else if(a==25){
          		cout<<75025;
          	}
          	else if(a==26){
          		cout<<121393;
          	}
          	else if(a==27){
          		cout<<196418;
          	}
          	else if(a==28){
          		cout<<317811;
          	}
          	else if(a==29){
          		cout<<514229;
          	}
          	else if(a==30){
          		cout<<832040;
          	}
          	else if(a==31){
          		cout<<1346269;
          	}
          	else if(a==32){
          		cout<<2178309;
          	}
          	else if(a==33){
          		cout<<3524578;
          	}
          	else if(a==34){
          		cout<<5702887;
          	}
          	else if(a==35){
          		cout<<9227465;
          	}
          	else if(a==36){
          		cout<<14930352;
          	}
          	else if(a==37){
          		cout<<24157817;
          	}
          	else if(a==38){
          		cout<<39088169;
          	}
          	else if(a==39){
          		cout<<63245986;
          	}
          	else if(a==40){
          		cout<<102334155;
          	}
          	else if(a==41){
          		cout<<165580141;
          	}
          	else if(a==42){
          		cout<<267914296;
          	}
          	else if(a==43){
          		cout<<433494437;
          	}
          	else if(a==44){
          		cout<<701408733;
          	}
          	else if(a==45){
          		cout<<1134903170;
          	}
          	else if(a==46){
          		cout<<1836311903;
          	}
              return 0;
          }
          
          
          • -3
            @ 2024-9-22 10:09:46

            #include<bits/stdc++.h> using namespace std; int main(){ int a,b,c,k; a=1,b=1,c=1; cin>>k; for(int i=3;i<=k;i++){ c=a+b; a=b; b=c; } cout<<c;

            return 0;
            

            }

            • -4
              @ 2024-12-14 14:34:52
              #include<bits/stdc++.h>
              using namespace std;
              int main()
              {
              	int a,b,c;
              	c=1,b=1,a=1;
              	int n;
              	cin>>n;
              	for(int i=3;i<=n;i++)
              	{
              		c=a+b;
              		a=b;
              		b=c;
              	}
              	cout<<c;
              	return 0; 
              	
              }
              
              
              • -4
                @ 2024-9-22 10:06:54
                #include <bits/stdc++.h>
                using namespace std;
                int f[50]; 
                int fibonacci(int n) {
                	if(f[n]!=0) return f[n];
                    if (n <= 1){
                    	f[1]=1;
                        return 1;
                    }
                    if (n == 2){
                    	f[2]=1;
                        return 1;
                    }
                    if (n > 2){
                    	f[n]=fibonacci(n - 1) + fibonacci(n - 2);
                        return fibonacci(n - 1) + fibonacci(n - 2);
                    }
                }
                int main(){
                    int k;
                    cin >> k;
                    cout << fibonacci(k);
                
                    return 0;
                }
                
                • 1

                Information

                ID
                882
                Time
                1000ms
                Memory
                256MiB
                Difficulty
                1
                Tags
                (None)
                # Submissions
                230
                Accepted
                105
                Uploaded By