Cod sursa(job #1298992)

Utilizator somuBanil Ardej somu Data 23 decembrie 2014 13:39:36
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <iostream>
#include <fstream>
#define nmax 105
#define inf (1<<29)
using namespace std;

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

int n;
int A[nmax][nmax];

void citire() {
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            fin >> A[i][j];
            if (A[i][j] == 0)
                A[i][j] = inf;
        }
}

void royFloyd() {
    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)
                    A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
}

void tiparire() {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            if (A[i][j] == inf)
                fout << 0 << " ";
            else
                fout << A[i][j] << " ";
        fout << "\n";
    }
}

int main() {
    citire();
    royFloyd();
    tiparire();
    fin.close();
    fout.close();
    return 0;
}