Cod sursa(job #1240840)

Utilizator MarronMarron Marron Data 12 octombrie 2014 09:36:44
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include <cstring>
#include <iostream>
#include <fstream>

#define MAXN 105
#define INF 0x3f3f3f3f


std::ifstream f("royfloyd.in");
std::ofstream g("royfloyd.out");

int n;
int a[MAXN][MAXN];


int main()
{
    f >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            f >> a[i][j];
            if (a[i][j] == 0) {
                a[i][j] = INF;
            }
        }
    }


    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            if (a[i][k] == 0) {
                continue;
            }
            for (int j = 1; j <= n; j++) {
                if (a[j][k] == 0) {
                    continue;
                }
                a[i][j] = std::min(a[i][j], a[i][k] + a[k][j]);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == INF) {
                g << 0 << ' ';
            } else {
                g << a[i][j] << ' ';
            }
        }
        g << '\n';
    }


    f.close();
    g.close();
    return 0;
}