Submission #332081

#	Time	Username	Problem	Language	Result	Execution time	Memory
332081		Valera_Grinenko	Jump (BOI06_jump)	Pypy 2	0 / 100	43 ms	20296 KiB

jump

n = int(input())
dp = [[0] * n for i in range(n)]
dp[0][0] = 1
for i in range(n):
    d = list(map(int, input().split()))
    for j in range(n):
        if(d[j] != 0):
            if(d[j] + i < n):
                dp[d[j] + i][j] = dp[d[j] + i][j] + dp[i][j]
            if(d[j] + j < n):
                dp[i][d[j] + j] = dp[i][d[j] + j] + dp[i][j]
print(dp[n - 1][n - 1])
#https://codeforces.com/blog/entry/76307?locale=en
#random OI problem 1.12.2020
#meh

• Subtask 1: 0 / 100