Cod sursa(job #1918551)

Utilizator tudormaximTudor Maxim tudormaxim Data 9 martie 2017 15:57:01
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int maxn = 105;
const int oo = 1 << 30;
int G[maxn][maxn];

int main() {
    ios_base :: sync_with_stdio (false);
    int n, i, j, k;
    fin >> n;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            fin >> G[i][j];
            if (i != j && G[i][j] == 0) G[i][j] = oo;
        }
    }
    for (k = 1; k <= n; k++) {
        for (i = 1; i <= n; i++) {
            if (k == i) continue;
            for (j = 1; j <= n; j++) {
                if (G[i][k] + G[k][j] < G[i][j]) {
                    G[i][j] = G[i][k] + G[k][j];
                }
            }
        }
    }
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            if (G[i][j] == oo && i != j) G[i][j] = 0;
            fout << G[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}