Pagini recente » Cod sursa (job #1214710) | Cod sursa (job #1788327) | Cod sursa (job #2703123) | Cod sursa (job #3206212) | Cod sursa (job #2848042)
#include <bits/stdc++.h>
using namespace std;
const int N = 100, inf = 1e9;
int c[N + 5][N + 5], d[N + 5][N + 5];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
fin >> d[i][j];
if(!d[i][j] && i != j) d[i][j] = inf;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fout << d[i][j] << " \n"[j == n];
return 0;
}