Pagini recente » Cod sursa (job #2281792) | Cod sursa (job #1042971) | Cod sursa (job #2536751) | Cod sursa (job #176153) | Cod sursa (job #2669210)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int NMAX = 100;
const int INF = 2 * 1000 * NMAX;
int N, mat[NMAX + 5][NMAX + 5];
int dist[NMAX + 5][NMAX + 5];
int main()
{
cin >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
cin >> mat[i][j];
dist[i][j] = INF;
if(mat[i][j] > 0) dist[i][j] = mat[i][j];
}
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(i != j && i != k && j != k && mat[k][j] != 0)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
if(dist[i][j] != INF) cout << dist[i][j] << ' ';
else cout << 0 << ' ';
cout << '\n';
}
return 0;
}