DOJ 1309: C111的日常之get the ball

http://acm.dlut.edu.cn/problem.php?id=1309

总是觉得这种dp好奇怪！

AC代码：

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAX = 35;

int dp[MAX][MAX];
int main(){
    int n,m; 
    while(cin >> n >> m){
        memset(dp, 0, sizeof(dp));
        dp[1][0] = 1;
        for(int i=1; i<=m; i++){
            dp[1][i] = dp[n][i-1] + dp[2][i-1];
            dp[n][i] = dp[1][i-1] + dp[n-1][i-1];
            for(int j=2; j<n; j++)
                dp[j][i] = dp[j-1][i-1] + dp[j+1][i-1];
        }
        cout << dp[1][m] << endl;
    }
    //system("pause");
    return 0;
}