Pagini recente » Cod sursa (job #334707) | Cod sursa (job #2933157) | Cod sursa (job #1507935) | Cod sursa (job #2350949)
#include <fstream>
#include <iostream>
#define nmax 105
#define oo 1005
using namespace std;
ifstream fin("royfoyd.in");
ofstream fout("royfoyd.out");
int d[nmax][nmax], n;
void read(){
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; j++){
fin >> d[i][j];
if(d[i][j] == 0 && i != j)
d[i][j] = oo;
}
}
void floyd_warshall(){
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];
}
void afisare(){
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
fout << d[i][j] << " ";
fout << endl;
}
}
int main(){
read();
floyd_warshall();
afisare();
fin.close();
fout.close();
return 0;
}