Pascal's Travels

最新推荐文章于 2020-04-08 00:13:39 发布

slldew

最新推荐文章于 2020-04-08 00:13:39 发布

阅读量284

点赞数

分类专栏： dp

本文链接：https://blog.csdn.net/slldew/article/details/81275364

版权

dp 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

An n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right corner of the board. The integer in any one square dictates how large a step away from that location must be. If the step size would advance travel off the game board, then a step in that particular direction is forbidden. All steps must be either to the right or toward the bottom. Note that a 0 is a dead end which prevents any further progress.

Consider the 4 x 4 board shown in Figure 1, where the solid circle identifies the start position and the dashed circle identifies the target. Figure 2 shows the three paths from the start to the target, with the irrelevant numbers in each removed.

Figure 1

Figure 2

Input

The input contains data for one to thirty boards, followed by a final line containing only the integer -1. The data for a board starts with a line containing a single positive integer n, 4 <= n <= 34, which is the number of rows in this board. This is followed by n rows of data. Each row contains n single digits, 0-9, with no spaces between them.

Output

The output consists of one line for each board, containing a single integer, which is the number of paths from the upper left corner to the lower right corner. There will be fewer than 2^63 paths for any board.

Sample Input

Sample Output

3
0
7


        
  
Brute force methods examining every path will likely exceed the allotted time limit. 
64-bit integer values are available as "__int64" values using the Visual C/C++ or "long long" values 
using GNU C/C++ or "int64" values using Free Pascal compilers.

Hint

Hint

思路：与How many wangs相似，都是dp题，从起点出发找出到终点的方案数。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char a[50][50];
int map[50][50];
long long dp[50][50];
int main()
{
    int n;
    while(~scanf("%d",&n)&&n!=-1)
    {
        memset(dp,0,sizeof(dp));
        int i,j,k;
        for(i=0; i<n; i++)
        {
            scanf("%s",a[i]);
            for(j=0; j<n; j++)
                map[i][j]=a[i][j]-'0';
        }
        dp[0][0]=1;
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                if(map[i][j]!=0)
                {
                    if(map[i][j]+i<n)
                        dp[i+map[i][j]][j]+=dp[i][j];
                    if(map[i][j]+j<n)
                        dp[i][j+map[i][j]]+=dp[i][j];
                }
            }
        }
        printf("%lld\n",dp[n-1][n-1]);
    }
    return 0;
}