1 solutions

  • 0
    @ 2025-3-20 13:46:19
    #include<bits/stdc++.h>
    using namespace std;
    int ans;
    void dfs(int n)
    {
        ans++; //这个数本身 
        for(int i=n/2;i>=1;i--) //加法原理 
        {
            dfs(i);
        }
    }
    int main()
    {
        int n;
        cin>>n;
        dfs(n);
        cout<<ans;
        return 0;
    }
    
    • 1

    Information

    ID
    240
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    # Submissions
    2
    Accepted
    2
    Uploaded By