Cod sursa(job #2815465)

Utilizator ioana0211Ioana Popa ioana0211 Data 9 decembrie 2021 18:06:28
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <fstream>
#include <climits>

using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
///Matricea drumurilor minime pentru orice pereche de noduri x, y
int n;
int mat[105][105];
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++){
            fin>>mat[i][j];
            if(i!=j && mat[i][j]==0)
                mat[i][j]=INT_MAX;
        }
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                if(mat[i][k]+mat[k][j]<mat[i][j])
                    mat[i][j]=mat[i][k]+mat[k][j];
            }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
        {
            if(mat[i][j]==INT_MAX)
                mat[i][j]=0;
            fout<<mat[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}