Pagini recente » Cod sursa (job #236272) | Cod sursa (job #835012) | Cod sursa (job #2211360) | Cod sursa (job #2575836) | Cod sursa (job #2502435)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[101][101];
void Roy_Warshall() {
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][k] && a[k][j]) {
if (a[i][j] == 0 || a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
}
int main() {
int i, j, cost;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
fin >> cost;
a[i][j] = cost;
}
Roy_Warshall();
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
if (i != j)
fout << a[i][j] << ' ';
else
fout << '0' << ' ';
fout << '\n';
}
return 0;
}