Cod sursa(job #2317234)

Utilizator Liviu_Ionut_MoantaMoanta Ionut Liviu Liviu_Ionut_Moanta Data 12 ianuarie 2019 23:51:19
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m,i,j,k,x,y;
int D[105][105];
int main(){
    fin>>n;
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++){
            fin>>D[i][j];
            if(D[i][j]==0)
                D[i][j]=100000;
        }
    }
    for(k=1;k<=n;k++){
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                if(i!=k&&k!=j&&D[i][k]>0&&D[k][j]>0){
                    D[i][j]=min(D[i][j],D[i][k]+D[k][j]);
                }
                if(i!=k&&k!=j&&D[k][i]>0&&D[j][k]>0){
                    D[j][i]=min(D[j][i],D[k][i]+D[j][k]);
                }
            }
        }
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++){
            if(D[i][j]==100000||i==j)
                fout<<"0"<<" ";
            else
                fout<<D[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}