水DP。。。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 40, inf = 0x3f3f3f3f;
LL mat[maxn][maxn], dpa[maxn][maxn];
int n;
LL dp(int i, int j)
{
if(~dpa[i][j]) return dpa[i][j];
if(i == n-1 && j == n-1) return dpa[i][j] = 1;
if(mat[i][j] == 0) return dpa[i][j] = 0;
int k = mat[i][j];
dpa[i][j] = 0;
if(i + k < n)
dpa[i][j] += dp(i+k, j);
if(j + k < n)
dpa[i][j] += dp(i, j+k);
return dpa[i][j];
}
int main()
{
while(~scanf("%d", &n) && ~n) {
char temp[maxn];
for(int i = 0; i < n; i++) {
scanf("%s", temp);
for(int j = 0; j < n; j++)
mat[i][j] = temp[j]-'0';
}
memset(dpa, -1, sizeof(dpa));
printf("%lld\n", dp(0, 0));
}
return 0;
}