Cod sursa(job #1781888)

Utilizator ggaaggaabbiigoteciuc gabriel ggaaggaabbii Data 17 octombrie 2016 16:24:43
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
using namespace std;
#define MAXN 110
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[MAXN][MAXN],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(i!=j&&k!=i&&k!=j)
            if(a[i][k]&&a[k][j])
                if(a[i][j]==0)
                a[i][j]=a[i][k]+a[k][j];
                else
                a[i][j]=min(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;
}