UVA-825-Walking on the Safe Side

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=111;
int n,m,dp[maxn][maxn];
int main()
{
int T,flag=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
memset(dp,0,sizeof(dp));
char str[1001];
getchar();
for(int i=0;i<n;i++)
{
gets(str);
int len=strlen(str),index=0,num=0;
for(int j=0;j<len;j++)
{
if(str[j]==' ')
{
if(!index)
index=num;
else
dp[index][num]=-1;
num=0;
continue;
}
num=num*10+str[j]-'0';
}
if(index&&num)
dp[index][num]=-1;
}
dp[1][1]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
if(dp[i][j]==-1)
continue;
if(dp[i-1][j]!=-1)
dp[i][j]+=dp[i-1][j];
if(dp[i][j-1]!=-1)
dp[i][j]+=dp[i][j-1];
}
printf("%d\n",dp
[m]);
if(T)
printf("\n");
}
return 0;
}