Pagini recente » Cod sursa (job #1601459) | Cod sursa (job #2689484) | Cod sursa (job #1525355) | Cod sursa (job #54348) | Cod sursa (job #2499513)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int dim = 101;
const int oo = INT_MAX / 2;
int n, m;
int dist[dim][dim];
int main()
{
int i, a, b, x, j;
f >> n;
for(i = 1; i <= n; ++i)
fill_n(dist[i], n, oo);
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
f >> dist[i][j];
for(x = 1; x <= n; ++x)
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
dist[i][j] = min(dist[i][j], dist[i][x] + dist[x][j]);
for(i = 1; i <= n; ++i, g << '\n')
for(j = 1; j <= n; g << ((i != j && dist[i][j] != oo) ? dist[i][j] : 0) << " ", ++j);
return 0;
}