Pagini recente » Cod sursa (job #1258209) | Cod sursa (job #3307412) | Cod sursa (job #3310546) | Cod sursa (job #3333621) | Cod sursa (job #3308412)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int INF = 1e9;
int n, cost[101][101], dist[101][101], i, j, k;
int main()
{
cin >> n;
for (i = 1; i <= n; i++) for (j = 1; j <= n; j++)
{
cin >> cost[i][j];
dist[i][j] = cost[i][j];
if(i==j)continue;
if (cost[i][j] == 0) dist[i][j] = INF;
}
for (k = 1; k <= n; k++) for (i = 1; i <= n; i++) for (j = 1; j <= n; j++)
dist[i][j] = min (dist[i][j], dist[i][k] + dist[k][j]);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (dist[i][j] == INF) dist[i][j] = 0;
cout << dist[i][j] << ' ';
}
cout << '\n';
}
return 0;
}