Cod sursa(job #1756317)

Utilizator AhileGigel Frone Ahile Data 12 septembrie 2016 16:50:46
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g
#define inf 100000000

ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");

int n;
int d[100][100];
int path[100][100];
int M[100][100];

int main() {

    in >> n;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            in >> M[i][j];
            if(M[i][j] == 0 && i != j) {
                M[i][j] = inf;
            }
        }
    }
    for(int k = 1; k <= n; ++k) {
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= n; ++j) {
                if(M[i][j] > M[i][k] + M[k][j]) {
                    M[i][j] = M[i][k] + M[k][j];
                }
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            out << M[i][j] << " ";
        }
        out << endl;
    }

}