Pagini recente » Cod sursa (job #2316334) | Cod sursa (job #418312) | Cod sursa (job #2761714) | Cod sursa (job #2676948) | Cod sursa (job #3202843)
// #include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int INF = INT_MAX;
const int NMAX = 101;
int a[NMAX + 1][NMAX + 1];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
cin >> a[i][j];
if (i != j && !a[i][j])
a[i][j] = INF;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= n; k++)
if (a[i][k]!=INF && a[k][j] != INF && 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++, cout << '\n')
for (int j = 1; j <= n; j++, cout << ' ')
{
if (a[i][j] != INF)
cout << a[i][j];
else
cout << 0;
}
return 0;
}