Cod sursa(job #2862512)

Utilizator 21CalaDarius Calaianu 21Cala Data 5 martie 2022 14:24:58
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,m[105][105],dist[105][105];

int main()
{
    fin >> n;
    for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
        {
            fin >> m[i][j];
            if (m[i][j] == 0 && i != j)
				m[i][j] = 1e9;
            dist[i][j] = m[i][j];
        }
    }
    for(int k=0;k<n;++k)
    {
        for(int i=0;i<n;++i)
        {
            for(int j=0;j<n;++j)
            {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
        {
            if(dist[i][j]==1e9)
                fout << "0 ";
            fout << dist[i][j] << " ";
        }
        fout << '\n';
    }
    return 0;
}