Pagini recente » Cod sursa (job #588989) | Cod sursa (job #1807559) | Cod sursa (job #2910605) | Cod sursa (job #1249440) | Cod sursa (job #1418834)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMax = 105;
int v[NMax][NMax];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fin >> v[i][j];
}
}
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if((v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && v[i][k] && v[k][j] && i != j){
v[i][j] = v[i][k] + v[k][j];
}
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fout << v[i][j] << " ";
}
fout << "\n";
}
return 0;
}