Cod sursa(job #1649377)

Utilizator eu3neuomManghiuc Teodor-Florin eu3neuom Data 11 martie 2016 13:28:42
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 105;

int D[NMax][NMax];

int main(){
    int n;
    fin >> n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fin >> D[i][j];
        }
    }
    for(int k = 1; k <= n; k++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if((D[i][k] * D[k][j] != 0) && i != j && D[i][j] > D[i][k] + D[k][j]){
                    D[i][j] = D[i][k] + D[k][j];
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fout << D[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}