蓝桥杯刷题打卡第21天

[木杉]

李白打酒加强版

#include <iostream>
using namespace std;
const int N = 110, MOD = 1e9 + 7;
int f[N][N][N];
int n, m;
int main()
{
  scanf("%d%d", &n, &m);
  f[0][0][2] = 1;
  for(int i = 0; i <= n; i ++)
    for(int j = 0; j <= m; j ++)
      for(int k = 0; k <= m; k ++)
      {
        int& v = f[i][j][k];
        if(i && k % 2 == 0) v = (v + f[i - 1][j][k / 2]) % MOD;
        if(j) v = (v + f[i][j - 1][k + 1]) % MOD;
      }
  cout << f[n][m - 1][1] << endl;
}