一開始寫成了step++，結(jié)果就少一個(gè)，看來還是不能太浪
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <cstdio>#include <set>#include <cmath>#include <algorithm>#include <queue>#define INF 0x3f3f3f3f#define MAXN 100005#define Mod 10001using namespace std;int ans;void dfs(int num,int step){ if(num>=39) { if(step%2==0&&num==39) ans++; return; } for(int i=1;i<=2;++i) { dfs(num+i,step+1); }}int main(){ ans=0; dfs(0,0); cout<<ans<<endl; return 0;}新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
