6TLE,1WA,求助
查看原帖
6TLE,1WA,求助
355643
蒟蒻QWQ2008楼主2020/7/1 15:37
#include<cstdio>
#include<iostream>
#include <algorithm>
using namespace std;
int n;
int cnt=0;
void dfs(int cur,int res)
{
    if(res>=cur)
    {
        cnt++;
        return ;
    }
    dfs(cur,res+1);
    dfs(cur,res+2);
}
int main()
{
    cin>>n;
    dfs(n,1);
    cout<<cnt;
}
2020/7/1 15:37
加载中...