Cod sursa(job #2758494)

Utilizator ioana0211Ioana Popa ioana0211 Data 10 iunie 2021 18:05:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
#include <climits>

using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
int d[101][101];
int main()
{
    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]=INT_MAX/2;
    }
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                d[i][j]=min(d[i][j], d[i][k]+d[k][j]);
            }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(d[i][j]==INT_MAX/2)
                fout<<0<<" ";
            else
                fout<<d[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}