Cod sursa(job #2389886)

Utilizator SilvestruState Silvestru Nicolae Silvestru Data 27 martie 2019 16:16:45
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>

using namespace std;

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

int d[1000][1000], INF=999999;

int main()
{
    int n, i;

    in>>n;

    for (i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            in>>d[i][j];

            if (i!=j && d[i][j] != 0)
                d[i][j] = INF;
        }
    }

    for (int k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
            {
                if (d[i][k] + d[k][j] < d[i][j])
                    d[i][j] = d[i][k] + d[k][j];
            }

    for (i=1; i<=n; i++)
        {
            for (int j=1; j<=n; j++)
            {
                if (d[i][j] == INF)
                    out<<"0"<<" ";
                out<<d[i][j]<<" ";
            }
            out<<"\n";
        }

    return 0;
}