코드 import sys input = sys.stdin.readline n = int(input()) graph = [[*map(int, input().split())] for _ in range(n)] def floyd(): # 플로이드 워셜 알고리즘, 함수화하면 속도가 더 빠름 for i in range(n): for j in range(n): for k in range(n): if graph[j][k] ==1 or (graph[j][i]== 1 and graph[i][k]==1): graph[j][k] = 1 floyd() for i in range(n): print(*graph[i])
