Cod sursa(job #1005137)

Utilizator manutrutaEmanuel Truta manutruta Data 4 octombrie 2013 12:30:41
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <iostream>
#include <fstream>
using namespace std;

#define MAXN 105
#define INF 0x3f3f3f3f

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

int a[MAXN][MAXN];

int main()
{
    int n;
    f >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            f >> a[i][j];
        }
    }

    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != j) {
                    a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
                } else {
                    a[i][j] = 0;
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            g << a[i][j] << ' ';
        }
        g << '\n';
    }

    return 0;
}