Pagini recente » Cod sursa (job #355428) | Cod sursa (job #2227051) | Cod sursa (job #1799806) | Cod sursa (job #1747366) | Cod sursa (job #1562676)
#include <cstdio>
using namespace std;
const int nmx = 102;
int n,g[nmx][nmx];
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
scanf("%d", &g[i][j]);
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(i != j && g[i][k] && g[k][j] && (not g[i][j] || g[i][j] > g[i][k] + g[k][j]))
g[i][j] = g[i][k] + g[k][j];
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j)
printf("%d ", g[i][j]);
printf("\n");
}
return 0;
}