第四届 39级台阶

#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<queue>
#define ll long long
using namespace std;
int res=0;
struct node
{
int num;
int ceng;
    int flag;
}temp;
void  bfs(int num)
{
temp.num=num;
temp.ceng=1;
temp.flag=1;
queue<node>q;
q.push(temp);
while(!q.empty())
{
node tt=q.front();
q.pop();
if(tt.ceng%2==0&&tt.num==39)
{
res++;
}
if(tt.num<39)
{
node ttt;
ttt.ceng=tt.ceng+1;
ttt.num=tt.num+2;
q.push(ttt);
ttt.num=tt.num+1;
q.push(ttt);
}
}
return ;
}
int main()
{
bfs(1);
bfs(2);
printf("%d\n",res);
return 0;
}