Floyd algorithm, without function, time = 7 sec

import random
random.seed(179)
N = 200

A = [ [random.randint(1, 10000) for i in range(N)] for j in range(N)]

for k in range(N):
    for i in range(N):
        for j in range(N):
            A[i][j] = min(A[i][j], A[i][k] + A[k][j])