Cod sursa(job #2847049)

Utilizator ALEXbrPopa Ioan Alexandru ALEXbr Data 10 februarie 2022 09:15:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int dist[101][101];

int main()
{
    int n;
    fin>>n;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            fin>>dist[i][j];

    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                if (dist[i][k] && dist[k][j] && (dist[i][j]>dist[i][k]+dist[k][j] || dist[i][j]==0 && i!=j))
                    dist[i][j] = dist[i][k]+dist[k][j];

    for (int i=1; i<=n; i++)
    {
        fout<<dist[i][1];
        for (int j=2; j<=n; j++)
            fout<<" "<<dist[i][j];
        fout<<'\n';
    }
	return 0;
}