Pagini recente » Cod sursa (job #1257341) | Profil Lacraru_Alexandru_Daniel_322CC | Cod sursa (job #140316) | Cod sursa (job #2424508) | Cod sursa (job #2426044)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
long long n, a[105][105];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> a[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 && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && a[i][k] && a[k][j])
a[i][j] = a[i][k] + a[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}