Cod sursa(job #2256991)

Utilizator andrei42Oandrei42O andrei42O Data 9 octombrie 2018 15:36:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N = 102;
const int oo = 1000000000;
int n,i,j,k,a[N][N];
int main()
{
    f>>n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        {
            f>>a[i][j];
            if(a[i][j]==0)
                a[i][j]=oo;
        }
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(i!=j&&i!=k&&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++)
        {
            if(a[i][j]==oo)
                a[i][j]=0;
            g<<a[i][j]<<' ';
        }
        g<<'\n';
    }
    return 0;
}