11403번: 경로 찾기

#include <cstdio>
#include <algorithm>
using namespace std;
#define inf 1000000000
int main()
{ 
	int n, route[101][101];
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
		{
			scanf("%d", &route[i][j]);
			if (route[i][j] == 0)
				route[i][j] = inf;
		}
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				route[i][j] = min(route[i][j], route[i][k] + route[k][j]);
	for (int i = 1; i <= n; ++i, printf("\n"))
		for (int j = 1; j <= n; ++j)
			(route[i][j] == inf) ? printf("0 ") : printf("1 ");
}