Pagini recente » Cod sursa (job #3366406) | Cod sursa (job #3364942) | Cod sursa (job #3366411) | Cod sursa (job #3366422) | Cod sursa (job #3366420)
#include <iostream>
using namespace std;
const int NMAX = 256+10;
long long dist[NMAX][NMAX];
int main()
{
/*
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
*/
int n;
cin >> n;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
cin >> dist[i][j];
}
}
for (int k=1; k<=n; k++)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (dist[i][j] > dist[i][k]+dist[k][j])
{
dist[i][j] = dist[i][k]+dist[k][j];
}
}
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
cout << dist[i][j] << " ";
}
cout << '\n';
}
return 0;
}