HDU 1978 DP

简单DP

#include "stdio.h"
#include "string.h"
#include "math.h"
int main()
{
	int t,n,m,i,j,x,y;
	int a[101][101];
	int dp[101][101];
	scanf("%d",&t);
	while (t--)
	{
		scanf("%d%d",&n,&m);
		for (i=1;i<=n;i++)
			for (j=1;j<=m;j++)
				scanf("%d",&a[i][j]);

		memset(dp,0,sizeof(dp));

		dp[1][1]=1;

		for (i=1;i<=n;i++)
			for (j=1;j<=m;j++)
			{
			

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

		printf("%d\n",dp[n][m]);
	}
	return 0;
}