Cod sursa(job #1291445)

Utilizator andreiblaj17Andrei Blaj andreiblaj17 Data 12 decembrie 2014 20:06:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 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];

int main(){
    
    fin >> n;
    
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            fin >> A[i][j];
            if (i != j && A[i][j] == 0)
                A[i][j] = inf;
        }
    
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                    A[i][j] = 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)
                fout << 0 << " ";
            else
                fout << A[i][j] << " ";
        }
        fout << "\n";
    }
    
    fin.close();
    fout.close();
    
    return 0;
}