Cod sursa(job #2811008)

Utilizator OrzataAndreiOrzata Andrei OrzataAndrei Data 30 noiembrie 2021 20:55:54
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int  MAXN = 1001;
int n, i, j ,k, x;
int dist[101][101];

void royfloyd()
{
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                if(dist[i][j]>dist[i][k]+dist[k][j])
                {
                    dist[i][j]=dist[i][k]+dist[k][j];
                }
            }

}
int main()
{

    in>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            int x;
            in>>x;
            if(x == 0 && i!=j)
                dist[i][j] = MAXN;
            else
                dist[i][j] = x;
        }

    royfloyd();
    for(int i=1; i<=n; i++)
    {

        for(int j=1; j<=n; j++)
            if(dist[i][j] == MAXN)
                out<<0<<" ";
            else
                out<<dist[i][j]<<" ";
        out<<"\n";

    }

    return 0;
}