Pagini recente » Cod sursa (job #1989136) | Cod sursa (job #2571816) | Cod sursa (job #1944616) | Cod sursa (job #1964149) | Cod sursa (job #1654615)
#include <iostream>
#include <fstream>
using namespace std;
int N;
int M[101][101];
void royfloyd(){
int i,j,k;
for(k=1;k<=N;k++){
for(i=1;i<=N;i++){
for(j=1;j<=N;j++){
if(M[i][j]>M[i][k]+M[k][j] && i!=j){
M[i][j]=M[i][k]+M[k][j];
}
}
}
}
}
void citire(){
ifstream f("royfloyd.in");
f>>N;
int i,j;
for(i=1;i<=N;i++){
for(j=1;j<=N;j++){
f>>M[i][j];
if(M[i][j]==0 && i!=j){
M[i][j]=9999;
}
}
}
}
void afisare(){
ofstream g("royfloyd.out");
int i,j;
for(i=1;i<=N;i++){
for(j=1;j<=N;j++){
if(M[i][j]==9999){
g<<0<<" ";
}else{
g<<M[i][j]<<" ";
}
}
g<<"\n";
}
}
int main()
{
citire();
royfloyd();
afisare();
return 0;
}