USACO Cow Pedigrees 【Dp】

/*
ID: wushuai2
PROG: nocows
LANG: C++
*/
//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0)
#define RV(num) ((num) > 0 ? 0 : 1)

using namespace std;

typedef long long           ll      ;
typedef unsigned long long  ull     ;
typedef unsigned int        uint    ;
typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-7      ;
const int M = 660000         ;
const ll P = 10000000097ll   ;
const int INF = 0x3f3f3f3f   ;
const int MAX_N = 20         ;
const int MAXSIZE = 101000000;

int N, K;
int dp[220][120];

int main() {
    ofstream fout ("nocows.out");
    ifstream fin ("nocows.in");
    int i, j, k, l, m, n, t, s, c, w, q, num;
    fin >> N >> K;
    for(i = 1; i <= N; ++i)
        dp[1][i] = 1;
    for(j = 1; j <= K; ++j){
        for(i = 1; i <= N; ++i){
            if(i & 1){
                for(k = 1; k <= i - 2; ++k){
                    if(k & 1){
                        dp[i][j] = (dp[k][j - 1] * dp[i - 1 - k][j - 1] + dp[i][j]) % 9901;
                    }
                }
            }
        }
    }
    fout << (dp[N][K] - dp[N][K - 1] + 9901) % 9901 << endl;




    fin.close();
    fout.close();
    return 0;
}