Pagini recente » Cod sursa (job #2307978) | Cod sursa (job #992122) | Cod sursa (job #970675) | Cod sursa (job #622329) | Cod sursa (job #3258327)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[101][101], x;
const int INF = 1000000001;
int main()
{
f >> n;
for (int i = 1; i<=n; ++i)
for (int j = 1; j<=n; ++j)
{
f >> x;
if (x == 0)
a[i][j] = INF;
else
a[i][j] = x;
}
for (int k = 1; k<=n; ++k)
for (int i = 1; i<=n; ++i)
for (int j = 1; j<=n; ++j)
{
if(i != j && j != k && i != k)
if (a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
}
for (int i = 1; i<=n; ++i)
{
for (int j = 1; j<=n; ++j)
{
if (a[i][j] == INF)
g << 0 << ' ';
else
g << a[i][j] << ' ';
}
g << '\n';
}
return 0;
}