sicily 1763 传球游戏

// Problem#: 1763
// Submission#: 1660942
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
//1763
#include <iostream>
using namespace std;

void solve(int n,int m,int res[][31])
{
    res[0][0] = 1;
    int i,j;
    for (j = 1; j <= m; j++)
        for (i = 0; i < n; i++)
            res[i][j] = res[(i-1+n) % n][j-1] + res[(i+1)%n][j-1];
}
int main()
{
    int n,m;
    while (cin >> n >> m)
    {
        int res[31][31] = {0};
        solve(n,m,res);
        cout << res[0][m] << endl;
    }
    return 0;
}