Pascal's Travels
2012-11-11 14:49
190 查看
[align=left]Problem Description[/align]
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
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
4
2331
1213
1231
3110
4
3332
1213
1232
2120
5
11101
01111
11111
11101
11101
-1
[align=left]Sample Output[/align]
3
0
7
Hint
Hint
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.
//用暴力应该会超时。简单的DP
#include <iostream>
#include <string.h>
using namespace std;
char map[50][50];
__int64 dp[50][50];
int main()
{
int i,j,n;
while(cin>>n&&n!=-1)
{
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++)
cin>>map[i];
dp[0][0]=1;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(map[i][j]-'0')
{
if(i+map[i][j]-'0'<n)
dp[i+map[i][j]-'0'][j]+=dp[i][j];
if(j+map[i][j]-'0'<n)
dp[i][j+map[i][j]-'0']+=dp[i][j];
}
cout<<dp[n-1][n-1]<<endl;
}
return 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
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
4
2331
1213
1231
3110
4
3332
1213
1232
2120
5
11101
01111
11111
11101
11101
-1
[align=left]Sample Output[/align]
3
0
7
Hint
Hint
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.
//用暴力应该会超时。简单的DP
#include <iostream>
#include <string.h>
using namespace std;
char map[50][50];
__int64 dp[50][50];
int main()
{
int i,j,n;
while(cin>>n&&n!=-1)
{
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++)
cin>>map[i];
dp[0][0]=1;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(map[i][j]-'0')
{
if(i+map[i][j]-'0'<n)
dp[i+map[i][j]-'0'][j]+=dp[i][j];
if(j+map[i][j]-'0'<n)
dp[i][j+map[i][j]-'0']+=dp[i][j];
}
cout<<dp[n-1][n-1]<<endl;
}
return 0;
}
相关文章推荐
- pku2704 Pascal's Travels
- hdu 1208 Pascal's Travels (DP记忆化搜索)
- [HDU] 1208 Pascal's Travels
- POJ 2704(Pascal's Travels-裸dp)
- poj 2704 Pascal's Travels_记忆化搜索
- hdu 1208 Pascal's Travels(dp)
- sicily 1274. Pascal's Travels
- Pascal's Travels
- poj 2704 Pascal's Travels
- poj 2704 Pascal's Travels 记忆化dfs或dp
- HDU1208:Pascal's Travels(DP)
- hdoj 1028/poj 2704 Pascal's Travels(记忆化搜索||dp)
- hdu1208 Pascal's Travels
- Leetcode: Pascal's Triangle II
- Pascal's Triangle
- Pascal's Triangle II
- LeetCode OJ - Pascal's Triangle
- Pascal's Triangle II
- Leetcode-Pascal's Triangle
- Pascal's Triangle