Pagini recente » Cod sursa (job #1693796) | Cod sursa (job #33628) | Cod sursa (job #1125679) | Cod sursa (job #2167515) | Cod sursa (job #3214028)
#include <fstream>
#define MAX 100
#define INF 1000000000
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int distMin[MAX + 10][MAX + 10];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
cin >> distMin[i][j];
if (distMin[i][j] == 0 && i != j)
distMin[i][j] = INF;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
distMin[i][j] = min(distMin[i][j], distMin[i][k] + distMin[k][j]);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
if (distMin[i][j] == INF)
cout << 0 << ' ';
else
cout << distMin[i][j] << ' ' ;
cout << '\n';
}
return 0;
}