Pagini recente » Cod sursa (job #2352519) | Cod sursa (job #1918673) | Cod sursa (job #56235) | Cod sursa (job #2671127) | Cod sursa (job #3163268)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105], n;
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 == k) continue;
if (j == k) continue;
if (i == j) continue;
if (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;
}