Pagini recente » Cod sursa (job #3139941) | Cod sursa (job #1023908) | Cod sursa (job #3228934) | Cod sursa (job #23968) | Cod sursa (job #2330168)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int const inf=(1<<30)-4;
int n,D[105][105];
void citire(){
fin >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
fin >> D[i][j];
if(!D[i][j] && i!=j) D[i][j]=inf;
}
}
void afisare(){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++) if(D[i][j]==inf) fout << "0 ";
else fout << D[i][j] << " ";
fout << endl;
}
}
void RoyFloyd(){
for(int k = 1 ; k <= n ; k ++)
for(int i = 1 ; i <= n ; i ++)
for(int j = 1 ; j <= n ; j ++)
if(D[i][j] > D[i][k] + D[k][j])
D[i][j] = D[i][k] + D[k][j];
}
int main(){
citire();
RoyFloyd();
afisare();
return 0;
}