Cod sursa(job #2168198)

Utilizator ListenerRavasz Tamas Listener Data 14 martie 2018 10:00:45
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>

using namespace std;

int n;
int x[105][105];
//int y[100][100];

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

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

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

    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            fout << x[i][j] << " " ;
        }
        fout << endl;
    }


    fin.close();
    fout.close();
    return 0;
}