Pagini recente » Cod sursa (job #2794922) | Cod sursa (job #56850) | Cod sursa (job #256369) | Cod sursa (job #537120) | Cod sursa (job #3192678)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, cost[101][101];
int main(){
fin >> n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fin >> cost[i][j];
}
}
for(int z = 1; z <= n; z++)
for(int x = 1; x <= n; x++)
for(int y = 1; y <= n; y++)
if(cost[x][z] && cost[z][y] && (cost[x][z] + cost[z][y] < cost[x][y] || cost[x][y] == 0))
cost[x][y] = cost[x][z] + cost[z][y];
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(i == j) cost[i][j] = 0;
fout << cost[i][j] << ' ';
}
fout << '\n';
}
}