Cod sursa(job #1537410)

Utilizator Narcys01Ciovnicu Narcis Narcys01 Data 27 noiembrie 2015 11:06:37
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

#define INF (int)1e9+3

using namespace std;

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

int n;
int a[120][120];

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

int main()
{
    int i, j;
    fin >> n;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            fin >> a[i][j];
    Roy_Floyd();
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            fout << a[i][j] << " ";
        fout << "\n";
    }
    return 0;
}