1858202_ac_0ms_40k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 33 行

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

int map[35][35];
__int64 way[35][35];

void main()
{
  int i, j;
  int n;
  char tmp[40];
  while(1)
  {
   scanf("%d",&n);
   if(n==-1) break;
   memset(way,0,sizeof(way));
   for(i = 0; i < n; i++)
   {
	   scanf("%s",tmp);
	   for(j = 0; j < n; j++)
	   map[i][j] = (int)tmp[j] - 48;
   }
   way[0][0] = 1;
   for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
       if(map[i][j]!=0)
       {
        if(map[i][j]+j<n) way[i][j+map[i][j]]+=way[i][j];
        if(map[i][j]+i<n) way[i+map[i][j]][j]+=way[i][j];
       }
         printf("%I64d\n",way[n-1][n-1]);
  }
}