Cod sursa(job #2289613)

Utilizator EdgeLordXDOvidiuPita EdgeLordXD Data 24 noiembrie 2018 22:12:12
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define N 101
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[N][N];
int main(){
    int n,i,j,k;
    in>>n;
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            in>>a[i][j];
    for(k=1; k<=n; ++k)
        for(i=1; i<=n; ++i)
            for(j=1; j<=n; ++j)
                if(a[i][k] && a[j][k])
                    a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
    for(i=1; i<=n; ++i){
        for(j=1; j<=n; ++j)
            out<<a[i][j]<<" ";
        out<<"\n";
    }
    return 0;
}