Cod sursa(job #1418834)

Utilizator eu3neuomManghiuc Teodor-Florin eu3neuom Data 14 aprilie 2015 09:43:00
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int NMax = 105;
int v[NMax][NMax];

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