Pagini recente » Cod sursa (job #2848399) | Cod sursa (job #2809098) | Cod sursa (job #1045402) | Cod sursa (job #2491716) | Cod sursa (job #2682604)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMAX = 101;
int d[NMAX][NMAX];
int main()
{
int n;
in >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
in >> d[i][j];
}
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (d[i][j] > d[i][k] + d[k][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
out << d[i][j] << ' ';
}
out << '\n';
}
return 0;
}