Pagini recente » Cod sursa (job #771449) | Cod sursa (job #2502123) | Cod sursa (job #1086856) | Cod sursa (job #1282030) | Cod sursa (job #1933620)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105];
void royFloyd()
{
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] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
}
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> a[i][j];
royFloyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << a[i][j] << " ";
g << '\n';
}
return 0;
}