lanqiao OJ 525 传球游戏

#include<iostream>
#include<algorithm>
#include<cstring>
 
using namespace std ;
const int N = 50;
int cnt ;
int f[N][N] ;
 
 
int main(){
  int n , m ;cin >> n >> m ;
  f[0][0] = 1;
  
  for(int i = 1 ; i <= m ; i ++){
    for(int j = 0 ; j < n ; j ++){
      f[i][j] = f[i-1][(j+ n-1)% n] + f[i-1][(j+n+1 )%n] ;
    }
  }
//  cout << f[1][3] << endl ;
  cout << f[m][0] << endl;
  return 0 ;
}