Cod sursa(job #2144948)

Utilizator infomaxInfomax infomax Data 27 februarie 2018 00:06:28
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <bits/stdc++.h>

using namespace std;

ifstream F("royfloyd.in");
ofstream G("royfloyd.out");

int a[105][105], n;

int main()
{
    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(a[i][k] && a[k][j] && i != j && i != k && j != k && (a[i][j]>a[i][k]+a[k][j]||!a[i][j]))
                    a[i][j]=a[i][k]+a[k][j];
    for(int i = 1; i <= n; ++ i, G << '\n'){
        for(int j = 1; j <= n; ++ j)
            G << a[i][j] << " ";
    }
    return 0;
}