还是未解决,可能是状态定义的问题吧,后面的就不对了。。郁闷。。。。。那位好心人看看啊
题目链接 点击打开链接
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
int b[15][15];
int dp(int n, int m)
{
memset(b, 0, sizeof(b));
b[1][1] = 1;
for(int i=1; i<=n; i++)
b[i][1] = 1;
for(int i=1; i<=m; i++)
b[1][i] = 1;
for(int i=2; i<=n; i++)
for(int j=2; j<=m; j++)
b[i][j] = b[i-1][j] + b[i][j-2] - b[i-1][j-2] + b[i][j-1] + b[i-2][j] - b[i-2][j-1];
return b[n][m];
}
int main()
{
int n, m;
while(scanf("%d %d", &n, &m))
{
if(!m && !n) break;
else
{
int t = dp(n,m);
printf("%d\n",t);
}
}
system("pause");
return 0;
}