hdu 1208 pascal travel
来源:互联网 发布:知乎动态怎么不让人看 编辑:程序博客网 时间:2024/05/24 03:20
好简单的一个题目,放在搜索专题里,大家都以为难,老师跑过来说这道题很简单,叫我做一下。。
有点变态的就是直接一个一个数据读进去没运行结果出,改成字符串读进去就可以。有点搞不懂。
Pascal's Travels
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 6 Accepted Submission(s) : 4
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
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 2Input
Output
Sample Input
423311213123131104333212131232212051110101111111111110111101-1
Sample Output
307
#include<iostream>
using namespace std;
#define max 50
int a[max][max];
__int64 sum[max][max];
int main()
{
int n,i,j;
char ch[50];
while(scanf("%d",&n)!=EOF)
{
getchar();
if (n==-1) return 0;
for(i=0;i<n;i++)
{
gets(ch);
for(j=0;j<n;j++)
a[i][j]=ch[j]-'0';
}
memset(sum,0,sizeof(sum));
sum[0][0]=1;
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
{
if (a[i][j]==0) continue;
sum[i+a[i][j]][j]+=sum[i][j];
sum[i][j+a[i][j]]+=sum[i][j];
}
}
cout<<sum[n-1][n-1]<<endl;
}
return 0;
}
- hdu 1208 pascal travel
- hdu Travel
- hdu-travel
- Travel HDU
- Travel HDU
- Travel HDU
- hdu 1208 Pascal's Travels
- HDU 1208 Pascal's Travels
- hdu 1208 Pascal's Travels
- hdu 1208 Pascal's Travels
- HDU 1208 Pascal's Travels
- HDU 1208 Pascal's Travels
- HDU 1208 Pascal's Travels
- hdu 1208 Pascal's Travels
- HDU 3053 Group Travel
- hdu 4284 Travel
- HDU 4284 Travel
- hdu 2433 TRAVEL
- centos开启80端口
- Oracle decode函数
- 如何把SQL Server 2005数据表导入到Access中
- linux经典面试题
- 移动数据库的复制与订阅
- hdu 1208 pascal travel
- javamail发送邮件实例
- 车展与云相机
- 英特尔放弃WiMAX,转为力挺LTE
- 最近好无聊
- asp.net基于jquery的ajax二级联动
- 中国电信的e云备份
- JSP里运用pager-taglib库添加分页
- VTK简介及安装