Pagini recente » Cod sursa (job #1446499) | Cod sursa (job #2574364) | Cod sursa (job #2500949) | Cod sursa (job #1379366) | Cod sursa (job #2274578)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int maxn = 105, inf = 0x3f3f3f3f;
int n, i, j, k;
int v[maxn][maxn], dist[maxn][maxn];
int main()
{
f >> n;
for(i = 1; i <= n; i ++) {
for(j = 1; j <= n; j ++) {
f >> v[i][j];
if(i != j) { dist[i][j] = v[i][j] == 0 ? inf : v[i][j]; }
}
}
for(k = 1; k <= n; k ++) {
for(i = 1; i <= n; i ++) {
for(j = 1; j <= n; j ++) {
if(dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for(i = 1; i <= n; i ++) {
for(j = 1; j <= n; j ++) {
g << dist[i][j] << ' ';
}
g << '\n';
}
f.close();
g.close();
return 0;
}