1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <queue>
 6 #include <stack>
 7 #include <vector>
 8 #include<math.h>
 9 #include <string.h>
10 #include<set>
11 using namespace std;
12 #define inf 0x3f3f3f3f
13 #define maxn 10000000
14 const double pi=acos(-1.0);
15 #define ll long long
16 #define N 108
17 using namespace std;
18 double fact(double a,double b,double c){
19     double y=sqrt(1-4*a*c);
20     double s=(-b+y)/2.0;
21     return s;
22 }
23 ll ans=0;
24 int a[N][N];
25 int flag;
26 void build(int step,int anum,int bnum,int mstep){
27     if(anum<0||bnum<0){
28         return ;
29    }
30    if(step==-1){
31         flag=1;return ;
32    }
33    for(int i=1;i<=step;i++){
34         if(a[step+1][i]==a[step+1][i+1] ){
35             a[step][i]=1;anum--;
36         }
37         else a[step][i]=0,bnum--;
38    }
39     build(step-1,anum,bnum,mstep);
40 
41    return ;
42 }
43 void dfs(int step,int pos,int anum,int bnum,int mstep){//枚举step行的存储数据，然后往上搭建看看
44    if(anum<0||bnum<0){
45         return ;
46    }
47    if(pos==step+1){
48         flag=0;
49         build(step-1,anum,bnum,mstep);//按照最后一行进行搭建
50         ans+=flag;
51         return ;
52    }
53    for(int i=0;i<=1;i++){
54         a[step][pos]=i;
55         if(i==0)
56             dfs(step,pos+1,anum,bnum-1,mstep);
57         else
58             dfs(step,pos+1,anum-1,bnum,mstep);
59    }
60 }
61 int main(){
62     int m,n;//分别表示A、B的人数
63     while(scanf("%d%d",&m,&n)!=EOF){
64          int x=(int)fact(1.0,1.0,-2.0*(m+n));//表示层数
65          printf("总行数=%d\n",x);
66         ans=0;
67         memset(a,-1,sizeof(a));
68         dfs(x,1,m,n,x);
69         printf("%lld\n",ans);
70     }
71 
72 
73     return 0;
74 }