Cod sursa(job #1933044)

Utilizator serbanSlincu Serban serban Data 20 martie 2017 12:48:58
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <bits/stdc++.h>

using namespace std;

int a[105][105];

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

    int n; f >> n;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            f >> a[i][j];

    for(int k = 1; k <= n; k ++)
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++) {
                if(i != j && a[i][j] > a[i][k] + a[k][j])
                    a[i][j] = a[i][k] + a[k][j];
            }

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