第1关:Warshall算法
for i in range(len(M)):
for j in range(len(M)):
M[j] = [x + y for x, y in zip([x* M[j][i] for x in M[i]], M[j])]
MT = [[int(bool(j)) for j in i]for i in M]
for i in range(len(M)):
for j in range(len(M)):
M[j] = [x + y for x, y in zip([x* M[j][i] for x in M[i]], M[j])]
MT = [[int(bool(j)) for j in i]for i in M]