Pagini recente » Cod sursa (job #1703276) | Cod sursa (job #2062626) | Cod sursa (job #2599967) | Cod sursa (job #815117) | Cod sursa (job #2594173)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[101][101];
void RoyFloid()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
if (i != j and i != k and j != k and a[i][k] != 0 and a[k][j] != 0)
if (a[i][j] > a[i][k] + a[k][j] or !a[i][j])
a[i][j] = a[i][k] + a[k][j];
}
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> a[i][j];
RoyFloid();
for (int i = 1 ; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout << a[i][j] << " ";
fout << "\n";
}
return 0;
}