hdu1208 Pascal's Travels
2013-01-11 00:04
274 查看
求从(0, 0 ) 到 ( n - 1, n - 1 ) 有几种不同的方式。。。
dp[i][j]表示到i, j位置处有几种方式
tmp = data[i][j];
dp[i + tmp][j] += dp[i][j]
dp[i][j + tmp] += dp[i][j]
dp[i][j]表示到i, j位置处有几种方式
tmp = data[i][j];
dp[i + tmp][j] += dp[i][j]
dp[i][j + tmp] += dp[i][j]
#include <stdio.h> #include <string.h> #include <iostream> using namespace std; int ct, tmp, data[40][40]; __int64 dp[40][40]; int main ( ) { while ( scanf ( "%d", &ct ) && ct + 1 ) { for ( int i = 0; i < ct; ++i ) for ( int j = 0; j < ct; ++j ) scanf ( "%1d", &data[i][j] ); memset ( dp, 0, sizeof ( dp ) ); dp[0][0] = 1; for ( int i = 0; i < ct; ++i ) for ( int j = 0; j < ct; ++j ) { if ( data[i][j] == 0 ) continue; dp[i + data[i][j]][j] += dp[i][j]; dp[i][j + data[i][j]] += dp[i][j]; } printf ( "%I64d\n", dp[ct - 1][ct - 1] ); } }
相关文章推荐
- HDU1208:Pascal's Travels(DP)
- pku 2704 Pascal's Travels
- POJ 2704(Pascal's Travels-裸dp)
- Sicily 1274. Pascal's Travels
- BIT1021 Pascal's Travels
- 1274. Pascal's Travels
- hdu 1208 Pascal's Travels (子状态继承dp)
- POJ2704 Pascal's Travels (记忆化DP)
- HDU 1208 Pascal's Travels(dp)
- POJ 2704 Pascal's Travels (基础记忆化搜索)
- Pascal's Travels (HDU 1208)
- hdu 1208 Pascal's Travels (DP记忆化搜索)
- poj 2704 Pascal's Travels_记忆化搜索
- hdoj 1028/poj 2704 Pascal's Travels(记忆化搜索||dp)
- hdoj1208_Pascal's Travels(dp)
- poj 2704 Pascal's Travels 动态规划
- soj 1274. Pascal's Travels
- hdu 1208 Pascal's Travels
- LeetCode|Pascal's Triangle-java
- LeetCode 118, 119. Pascal's Triangle i, ii