Cod sursa(job #1920695)

Utilizator CaLiN0ZCalin Buraciuc CaLiN0Z Data 10 martie 2017 09:22:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>

using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101],n,m,x,y,z,i,j,k;
int main()
{
    /*in>>n>>m;
    for(i=1;i<=m;i++)
    {
        in>>x>>y>>z;
        a[x][y]=z;
    }*/
    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[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                    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]==0)
                if(i==j)
                    out<<"0"<<" ";
                else
                    out<<"-1"<<" ";
            else
            out<<a[i][j]<<" ";
        out<<'\n';
    }
    return 0;
}