Cod sursa(job #1322784)

Utilizator TeofilosTeofil Teofilos Data 20 ianuarie 2015 13:40:47
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, c[10100][10100];
int main()
{
    f >> n;
    n = n * n * n * n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
        f >> c[i][j];
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            if (c[i][k] == 0) continue;
        else if (c[k][j] == 0) continue;
        else if (i == j) continue;
        else if(c[i][j] == 0 || c[i][j] > c[i][k] + c[k][j])
            c[i][j] = c[i][k] + c[k][j];
    for (int i = 1; i <= n; ++i){
            for (int j = 1; j <= n; ++j)
            g << c[i][j] << ' ';
        g << "\n";
    }
    g.close();
    return 0;
}