Cod sursa(job #1128503)

Utilizator muresan_bogdanMuresan Bogdan muresan_bogdan Data 27 februarie 2014 17:22:36
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include<fstream>
#include<iostream>
using namespace std;

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

const int INF = 1000000000;
int n, i, j, m[101][101], k;

int main() {
    fin >> n;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            fin >> m[i][j];
            if((i != j) && (m[i][j] == 0))
                m[i][j] = INF;
        }
    }
    for(k = 1; k <= n; k++) {
        for(i = 1; i <= n; i++) {
            for(j = 1; j <= n; j++) {
                if(m[i][k] + m[k][j] < m[i][j]) {
                    m[i][j] = m[i][k] + m[k][j];
                }
            }
        }
    }
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if(m[i][j] != INF) {
                fout << m[i][j] << ' ';
            }
            else{
                fout << "0" << ' ';
            }
        }
        fout << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}