HDU 1978 How many ways

点击打开链接

思路：

DFS + DP

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

int dp[105][105], a[105][105];
int n,m;

int dfs(int i, int j)
{
if (dp[i][j] > 0)
return dp[i][j];

for (int l = 0; l <= a[i][j]; ++l)
for (int k = 0; k <= a[i][j] - l; ++k)
{
if ( i+l < n && j + k < m && l+k != 0)
dp[i][j] = (dfs(i+l,j+k)+dp[i][j]) % 10000;
}
return dp[i][j];
}

int main()
{
int ss;
cin >> ss;
while (ss--)
{
cin >> n >> m;
for (int i = 0; i != n; ++i)
for (int j = 0; j != m; ++j)
scanf("%d",&a[i][j]);
memset(dp,0,sizeof(dp));
dp[n-1][m-1] = 1;
cout << dfs(0,0) << endl;

}
return 0;
}
/*
1
6 6
4 5 6 6 4 3
2 2 3 1 7 2
1 1 4 6 2 7
5 8 4 3 9 5
7 6 6 2 1 5
3 1 1 3 7 2
*/