【HDOJ】1978 How many ways

DFS。

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

#define MAXNUM 105

int map[MAXNUM][MAXNUM], ways[MAXNUM][MAXNUM], n, m;

int dfs(int x, int y) {
    int i, j, way=0;

    if (ways[x][y])
        return ways[x][y];

    for (i=0; i<=map[x][y]; ++i) {
        for (j=0; i+j<=map[x][y]; ++j) {
            if (i==0 && j==0)
                continue;
            if (x+i>=n || y+j>=m)
                continue;
            way += dfs(x+i, y+j);
            if (way >= 10000)
                way %= 10000;
        }
    }

    ways[x][y] = way;

    return way;
}

int main() {
    int t;
    int i, j;

    scanf("%d", &t);

    while (t--) {
        scanf("%d %d", &n, &m);
        memset(ways, 0, sizeof(ways));
        for (i=0; i<n; ++i)
            for (j=0; j<m; ++j)
                scanf("%d", &map[i][j]);
        ways[n-1][m-1] = 1;
        i = dfs(0, 0);
        printf("%d
", i);
    }

    return 0;
}