Cod sursa(job #2812666)

Utilizator StefaniaCriStefania Cristea StefaniaCri Data 4 decembrie 2021 21:29:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
using namespace std;

fstream f("royfloyd.in");
ofstream g("royfloyd.out");

void roy_floyd(int dist[][102],int n)
{
   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]) && i!=j)
                    dist[i][j] = dist[i][k] + dist[k][j];

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            g<<dist[i][j]<<" ";
    g<<"\n";
    }

}

int main()
{
    int n;
     int pondere[102][102];
        f>>n;

        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                 f>>pondere[i][j];
        f.close();

        roy_floyd(pondere,n);
    return 0;
}