Pagini recente » Cod sursa (job #2358647) | Cod sursa (job #3248228) | Cod sursa (job #2954273) | Cod sursa (job #428094) | Cod sursa (job #2257403)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[100][100];
int main()
{
int n;
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fin >> d[i][j];
for (int k = 0 ; k < n ; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if((d[i][j] > d[i][k] + d[k][j]) && d[i][k] && d[k][j] && i != j)
d[i][j] = d[i][k] + d[k][j];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
fout << d[i][j] << " ";
fout << endl;
}
return 0;
}