题意:有一个以N为边长的一个N*N的格子里,每一个格子里有一个数
代表着到这个格子里的时候可以向下或是向右前进多少步
问从左上角的位置能以这样方式到右下角的路线条数。
思路:就是进行简单的深度搜索,把搜到的结果用数组存下来就行了。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<ctype.h>
using namespace std;
#define N 35
bool vist[N][N];
int map[N][N];
long long ans[N][N];
int n;
long long dfs(int x,int y)
{
//cout<<x<<' '<<y<<endl;
if (vist[x][y])
return ans[x][y];
vist[x][y]=true;
int xx=x+map[x][y];
int yy=y+map[x][y];
if (xx<=n)
ans[x][y]+=dfs(xx,y);
if (yy<=n)
ans[x][y]+=dfs(x,yy);
return ans[x][y];
}
int main()
{
//freopen("C:\in.txt","r",stdin);
int i,j,k;
char cur[55];
while (cin>>n,n>-1)
{
for (i=1;i<=n;i++)
{
cin>>cur;
for (j=0;j<n;j++)
map[i][j+1]=cur[j]-'0';
}
memset(vist,false,sizeof(vist));
memset(ans,0,sizeof(ans));
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) if (map[i][j]==0)
vist[i][j]=true;
vist[n][n]=true;
ans[n][n]=1;
cout<<dfs(1,1)<<endl;
}
return 0;
}
Pascal's Travels
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4757 | Accepted: 2107 |
Description
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.
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
4 2331 1213 1231 3110 4 3332 1213 1232 2120 5 11101 01111 11111 11101 11101 -1
Sample Output
3 0 7