5 条题解

  • 1
    @ 2025-4-20 20:29:46
    //打表最快,哈哈哈
    /***********************************
    四羟基合铝酸(HAl(OH)4)才是对的
    化学书上的偏铝酸(HAlO2)是错的!
    !!!!!!!!!!!!
    ***********************************/
    #include<bits/stdc++.h>
    #define int long long
    #define INFSHORT 1e+3
    #define INFINT 1e+10
    #define INFLONGLONG 1e+19
    using namespace std;
    const int INF=0x3f3f3f3f;
    const int N=1e8+6;
    int a;
    signed main(){
    	cin>>a;
    	cout<<1346269;
    	return 0;
    }
    • 0
      @ 2023-6-28 10:01:13
      #include<iostream>
      #include<algorithm>
      #include<cmath>
      using namespace std;
      int f(int n){
      	int sum;
      	if (n == 1)return 1;
      	if (n == 2)return 2;
      	return sum=f(n-1)+f(n-2);
      }
      int main(){
      	int n;
      	cin>> n;
      	cout << f(n);
      	return 0;
      }
      
      • -1
        @ 2024-4-14 20:24:00
        using namespace std;
        const int N=1e5+10;
        const int INF=0x3f3f3f3f;
        int n,ans;
        int f(int n)
        {
        	int ans;
        	if(n==1) return 1;
        	if(n==2) return 2;
        	return ans=f(n-1)+f(n-2);
        }
        int main()
        {
        	int n;
        	cin>>n;
        	cout<<f(n);
        	return 0;
        }
        
        • -1
          @ 2024-1-17 17:22:04
          #include<iostream>
          #include<cstdio>
          #include<string>
          #include<bits/stdc++.h>
          #define LL long long
          using namespace std;
          const int INF=0x3f3f3f3f;
          const int N=2e5+10;
          int fb(int a){
          	if(a==1) return 1;
          	if(a==2) return 2;
          	return fb(a-1)+fb(a-2);
          }
          int main(){
          	int a;
          	cin>>a;
          	cout<<fb(a);
          }
          
          
          
          
          
          
          • -1
            @ 2023-5-1 16:37:13
            #include<algorithm>
            #include<cmath>
            using namespace std;
            int f(int n){
            	int sum;
            	if (n == 1)return 1;
            	if (n == 2)return 2;
            	return sum=f(n-1)+f(n-2);
            }
            int main(){
            	int n;
            	cin>> n;
            	cout << f(n);
            	return 0;
            }//非常简单
            
            • 1

            信息

            ID
            2630
            时间
            1000ms
            内存
            256MiB
            难度
            5
            标签
            (无)
            递交数
            324
            已通过
            130
            上传者